Find Academic Supervisors

Tal Malkin is a Professor of Computer Science at Columbia University, directing the Cryptography Lab and serving as inaugural chair of the Cybersecurity Center at Columbia's Data Science Institute. She holds a Ph.D. from MIT (2000), joined Columbia after AT&T Labs research experience, and focuses on cryptography, security, complexity theory with applications in secure computation, zero-knowledge proofs, and privacy-preserving systems . Education: B.S. in Math and Computer Science, Bar-Ilan University M.S. in Computer Science, Weizmann Institute of Science Ph.D. in Computer Science, MIT (2000) Research Interests: Malkin's work spans foundational and applied cryptography, including homomorphic encryption, lattice-based protocols, attribute-based encryption, and tamper-resilient systems . She explores intersections with machine learning and information theory , addressing challenges in multi-party computation , public-key encryption , and side-channel resistance . Scientific Contributions: Her publications include breakthroughs in non-malleable codes , secure computation , and privacy-preserving databases . Notable works involve continual leakage resilience , optimally-fair coin tossing , and garbled circuits for efficient cryptographic protocols. Awards & Grants: Recipient of the NSF CAREER award, IBM and Google faculty research awards, and the IACR Fellow designation. Her research is funded by NSF, NSA, DHS, NYSIA, IARPA, and industry partnerships with Google, IBM, Mitsubishi, and NEC. Professional Leadership: Former conference chairs at CRYPTO 2021 , CCS 2017 , and CT-RSA conferences. Active in program committees for over 20 leading cryptography and security events, including FOCS , Eurocrypt , and Real World Crypto . Advising: Supervised numerous Ph.D. students and postdoctoral researchers, including Marshall Ball , Chengyu Lin , and Negev Shekhel Nosatzki . Her lab has mentored graduates like Ghada Almashaqbeh (2019) and Fernando Krell (2016), focusing on decentralized networks , secure learning , and cryptographic primitives .

• Cryptography
• Computer Security
• Complexity Theory
• +8 more

Nils Fleischhacker is an Assistant Professor for Cryptography at Ruhr University Bochum, where he leads the Theoretical Cryptography group within the Faculty of Computer Science. His research focuses on foundational aspects of cryptography with particular emphasis on zero-knowledge proofs, digital signatures, and secure computation. Prior to joining Ruhr University, he held postdoctoral positions at Johns Hopkins University and Carnegie Mellon University. Dr. Fleischhacker received his PhD in Computer Science from Saarland University in February 2017, advised by Dominique Schröder. During his doctoral studies, he was a research intern at Microsoft Research with Chris Brzuska and a research visitor at the University of Maryland, College Park with Jonathan Katz and Dana Dachman-Soled. His research spans theoretical cryptography with significant contributions to zero-knowledge proofs, multi-signature schemes, property-preserving hash functions, and security proofs for cryptographic primitives. Fleischhacker's work often addresses fundamental questions about the limits and possibilities of cryptographic constructions, with particular attention to black-box separations and lower bounds. His recent publications demonstrate a strong focus on lattice-based cryptography and post-quantum secure protocols. Fleischhacker's publications over the past five years reveal a consistent research trajectory focused on improving the efficiency and security of cryptographic primitives, with particular emphasis on signature schemes, zero-knowledge protocols, and secure computation frameworks. His work frequently appears in top-tier cryptography venues including CRYPTO, EUROCRYPT, and CCS. Dr. Fleischhacker actively mentors PhD students, with numerous successful graduations spanning from 2010 to 2024. His former PhD students include Önder Askin (2024), Floyd Zweydinger (2023), and Lars Schlieper (2022), among others. His research is supported through various academic channels and collaborations. He is affiliated with several prominent research organizations including the Horst Görtz Institute (HGI) for Information Security, the DFG Excellence Cluster CASA, the EU Marie Curie Network QSI, and the International Association for Cryptologic Research (IACR). These affiliations provide a strong institutional framework for his theoretical cryptography research.

• Cryptography
• Theoretical Computer Science
• Zero-Knowledge Proofs
• +5 more

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +2 more

Ron Steinfeld is an Associate Professor in the Department of Software Systems & Cybersecurity at Monash University, Australia. He holds editorial roles in Designs Codes and Cryptography (since 2017) and has served on technical committees for top-tier conferences like ASIACRYPT, CRYPTO, and EUROCRYPT. His research focuses on quantum-safe cryptography, lattice-based cryptography, and blockchain security, with over 80 refereed publications and AUD$4M+ in research funding. Education: BSc Mathematics and Physics (Monash University, 1998) BE (Hons., First Class) Electrical and Computer Systems (Monash University, 2000) PhD Computer Science (Monash University, 2003) Research Interests: Design and analysis of cryptographic algorithms, quantum-safe protocols, lattice-based security foundations, and blockchain applications. His work underpins NIST standard algorithms like Kyber and Dilithium through structured lattice problem research. Recent Articles Trends: Focus on privacy-preserving blockchain protocols, post-quantum signature schemes, encrypted data search, and cryptographic applications in adversarial AI. Recent work includes fair Bitcoin watchtower schemes and genomic database privacy solutions. Awards: ASIACRYPT 2015 Best Paper Award Advising & Grants: Supervises PhD projects on quantum-safe cryptography and blockchain security. Leads initiatives like the AUD$4M ARC-funded Quantum Information Technology project. Collaborates with industry partners including CSIRO/Data61. Labs/Teams: Key contributor to Monash’s cybersecurity and cryptography research groups, involving interdisciplinary projects on materials discovery ( Æinstein initiative) and post-quantum blockchain security.

• Quantum-safe cryptography
• Lattice-Based Cryptography
• Post-Quantum Cryptography
• +4 more

Stefano Tessaro is a Professor in the Paul G. Allen School of Computer Science & Engineering at the University of Washington. He holds the Paul G. Allen Career Development Professorship. His research focuses on cryptography, theoretical computer science, and computer security, emphasizing practical applications of cryptographic techniques. He co-leads the cryptography group at UW with Andrea Coladangelo and Huijia Lin, and is part of the theory group. Education: PhD in Computer Science from ETH Zurich (2010) Postdoctoral researcher at MIT CSAIL (2010-2014) and UC San Diego (2014-2019) Joined UW in 2019 as faculty Research Interests: His work spans theoretical cryptography, privacy-preserving systems, cryptographic protocols, and security foundations. He explores practical applications of cryptography, including secure protocols, post-quantum cryptography, and efficient cryptographic constructions. Articles Trends: Recent publications emphasize threshold signatures, memory-tight security proofs, lattice-based cryptography, and privacy-preserving systems. Key themes include adaptive security, formal verification, and efficiency improvements in cryptographic protocols. Awards: NSF CAREER Award Sloan Research Fellowship Hellman Fellowship Research awards from Cisco, JP Morgan, and Microsoft Grants & Advising: His research has been supported by NSF grants and industry partnerships. He advises students in cryptographic theory and applications, though no specific student names are listed in the provided text. Labs & Teams: Co-leads the UW cryptography group, collaborating on projects like LERNA (secure aggregation) and Twinkle (threshold signatures). Engages with interdisciplinary teams in theoretical computer science and security.

• Cryptography
• Computer Security
• Theoretical Computer Science
• +3 more

Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.

• Number Theory
• Combinatorics
• Complexity Theory
• +3 more

Ben Fisch is an Assistant Professor of Computer Science at Yale University's School of Engineering & Applied Science. He is also the co-founder of Espresso Systems, a company focused on blockchain infrastructure. His research focuses on privacy and verifiability in decentralized systems like Bitcoin and Ethereum, with applications in digital finance and healthcare. Dr. Fisch received his B.A. from the University of Pennsylvania and completed his Ph.D. at Stanford University, where he worked with Dan Boneh in the applied cryptography research group. His educational background provided the foundation for his work at the intersection of cryptography, distributed systems, and economics. His research centers on leveraging cryptographic tools such as succinct non-interactive zero-knowledge proofs (zk-SNARKs), private information retrieval, and homomorphic encryption to address challenges in verifiable computation, verifiable storage, and verifiable fairness. He has made significant contributions to verifiable delay functions (VDFs) and proofs of replication, which have been adopted by major blockchain projects including Ethereum 2.0, Chia, and Filecoin. His work on Filecoin's Proofs of Replication has helped the network reach over 1.5 exabytes of storage capacity. His publication record shows a clear trend toward increasingly sophisticated cryptographic protocols for blockchain applications, with recent work focusing on data availability for Bitcoin rollups, efficient folding schemes for pairing-based arguments, and privacy pools with proof-carrying disclosures. His research bridges theoretical cryptography with practical implementations that have real-world impact in decentralized systems. His notable recognition includes: Best Paper Finalist at ACM CCS 2017 for 'Iron: Functional Encryption using Intel SGX' Dr. Fisch's research has led to significant technology transfer, most notably with his work on Verifiable Delay Functions (VDFs) sparking a multimillion dollar industry initiative through the VDF Alliance. His research on Proofs of Replication forms the basis of Filecoin's incentive layer and consensus protocol. His newer SNARK system Basefold is being used by several commercial products. He maintains active collaborations across academia and industry, with publications spanning top conferences in cryptography and security. As co-founder of Espresso Systems, Dr. Fisch leads a team developing next-generation blockchain infrastructure, particularly focusing on sequencing layers for rollups. His work bridges academic research with practical implementation, ensuring that theoretical advances in cryptography find real-world applications in decentralized systems.

• Cryptography
• Distributed Systems
• Blockchain Technology
• +5 more

Alessandro Chiesa is an Associate Professor at École Polytechnique Fédérale de Lausanne (EPFL) in the School of Computer and Communication Sciences, holding positions across multiple departments including Computer Security (COMPSEC), SSC, SIN, and EDIC. His office is located at BC 245 in Building BC, Station 14, Lausanne, Switzerland. Chiesa's research spans cryptography, complexity theory, and computer security, with particular focus on the theoretical foundations and practical implementations of cryptographic proofs that are short and easy to verify. His work bridges theoretical computer science with real-world applications, especially in blockchain technology and privacy-preserving systems. He has made significant contributions to zero-knowledge proof systems, including zkSNARKs, and their applications in cryptocurrency. His publications reveal a strong focus on cryptographic protocols, with particular emphasis on privacy-preserving technologies. The analysis of his articles shows consistent work in applying mathematical foundations to practical security problems, especially in the domain of blockchain and digital currencies. His research demonstrates expertise in both theoretical aspects of cryptography and their implementation in real systems. IEEE SP Test-of-Time Award (2024) Sloan Research Fellowship (2021) Okawa Foundation Research Grant (2020) Google Faculty Research Awards (2018 and 2017) MIT Technology Review's 35 Innovators Under 35 list (2018) Chiesa has supervised multiple PhD students including Di Zijing, Fenzi Giacomo, Guan Ziyi, Knabenhans Christian Louis, Manzur Ignacio, Weissenberg Guy, and Zheng Yuxi. His teaching includes Algorithms I, Foundations of Probabilistic Proofs, and Lattice-based Cryptography. He co-founded Zcash and StarkWare Industries, translating his theoretical research into practical applications that have significantly impacted the cryptocurrency space.

• Cryptography
• Complexity Theory
• Computer Security
• +3 more

Benedikt Bünz is an Assistant Professor of Computer Science at New York University's Courant Institute of Mathematical Sciences. He is also a co-founder and chief scientist of Espresso Systems, where he applies his research expertise to real-world blockchain solutions. His academic work bridges theoretical cryptography with practical blockchain implementations, focusing on enhancing privacy, security, and usability of decentralized systems. Dr. Bünz's research centers around applied cryptography, consensus mechanisms, and game theory as they relate to cryptocurrencies. His work spans zero-knowledge proofs, verifiable delay functions, secure multi-party computation, and privacy-preserving protocols. He has made significant contributions to Bulletproofs, a zero-knowledge proof system deployed on blockchains like Monero, and pioneered research in verifiable delay functions which are now part of Ethereum 2.0's design. His recent work focuses on recursive proof systems, accumulation schemes, and efficient verification techniques for blockchain scalability. His publication record shows a consistent progression from foundational cryptographic primitives to practical blockchain implementations. Recent work demonstrates increasing sophistication in recursive proof systems (ProtoStar, HyperPlonk), novel accumulation techniques (ARC, DewTwo), and foundational work on randomness generation (VDFs). His research consistently bridges theoretical cryptography with real-world blockchain applications, resulting in protocols that are both theoretically sound and practically implementable across multiple blockchain platforms. Dr. Bünz actively contributes to the academic community through teaching and mentorship. He teaches courses on cryptography of blockchains and computer security at NYU, providing students with hands-on experience in blockchain security and cryptographic protocols. His industry engagement through Espresso Systems demonstrates his commitment to translating academic research into practical solutions for the blockchain ecosystem.

• Applied Cryptography
• Blockchain Technology
• Consensus Algorithms
• +4 more

Assoc Prof Ng Teng Yong is an Associate Professor at the School of Mechanical & Aerospace Engineering (NTU), specializing in numerical modeling and simulation. With a background as Research Manager at A*STAR Institute of High Performance Computing, his work spans materials science, nanotechnology, and aerospace engineering. Current focus on graphene-based desalination membranes Expertise in molecular dynamics simulations Investigates nanoscale fluid mechanics and structural dynamics Recent publications highlight advancements in energy-efficient electrodialysis, smart robotics, and nonlinear vibration analysis. His interdisciplinary approach integrates computational methods with experimental validation in additive manufacturing and soft material mechanics.

• Numerical Modeling
• Computational Simulation
• Materials Science
• +5 more

Dr. Amin Sakzad is an Associate Professor in the Department of Software Systems & Cybersecurity at Monash University's Faculty of Information Technology. His research focuses on lattice-based cryptography, wireless communications, and post-quantum security protocols. He holds a PhD in Applied Mathematics from Amirkabir University of Technology (2011) and has held academic roles at Carleton University and Monash since 2012. Dr. Sakzad’s expertise spans lattice coding theory, MIMO systems, and privacy-preserving technologies for genomic databases and blockchain applications. He leads multiple ARC-funded projects, including work on secure databases (SRDBMS) and post-quantum cryptographic primitives for FinTech and energy sectors. His research has been recognized through awards such as the FIT Dean’s Award for Teaching Excellence (2021). Key collaborations include projects on blockchain security (CollinStar Lab), genomic data privacy, and energy market cybersecurity. His work addresses UN SDGs through contributions to quality education (SDG 4) and industry innovation (SDG 9). Recent publications highlight advancements in lattice-based cryptography (e.g., CRYSTALS-Kyber variants), privacy-preserving energy trading, and secure blockchain protocols like FPPW watchtower systems. His research bridges theoretical cryptography with practical implementations in embedded systems and 5G telecommunications. Grants: 16 active/completed projects including $1.2M in ARC funding Advising: Supervising PhD projects on lattice applications in post-quantum crypto and blockchain Labs: Core member of Monash’s Software Defined Telecommunications (SDT) Lab and CollinStar Lab

• Lattice-Based Cryptography
• Wireless Communications
• Post-Quantum Cryptography
• +6 more

Cong Ling is a Professor of Information Theory and Cryptography at Imperial College London's Department of Electrical and Electronic Engineering, within the Faculty of Engineering. His research focuses on lattice theory and its applications in coding, cryptography, quantum information, and number theory. Key affiliations include the Academic Centre of Excellence in Cyber Security Research and the Engineering Secure Software Systems group. Education details are not explicitly provided in the text, but his professional experience indicates advanced qualifications in electrical engineering and mathematics. Research interests span lattice-based cryptography, post-quantum security, algebraic coding theory, and quantum-resistant algorithms. His work bridges information theory and number theory, with contributions to MIMO systems, secure communication protocols, and cryptographic protocol design. Recent publications emphasize lattice reduction techniques, quantum algorithms for the shortest vector problem, and advancements in polar codes. Notable trends include exploration of non-commutative algebras for cryptography, Gaussian sampling optimizations, and hybrid quantum-classical approaches to hard integer problems. Over 50+ articles published since 2018 reflect his leadership in lattice-based research and quantum-safe technologies. Awards: None explicitly listed in the text. Grants/Advising: No specific grants or student advisees mentioned; focus remains on collaborative research outputs. Labs/Teams: Associated with Imperial's Cyber Security Research groups and quantum engineering initiatives.

• Information Theory
• Cryptography
• Lattice Theory
• +5 more

Jens Groth is an Honorary Professor at the Department of Computer Science, University College London (UCL), and serves as Chief Scientist at Nexus. His primary research focuses on cryptography, with an emphasis on cryptographic protocols, zero-knowledge proofs, and privacy-preserving technologies. Groth has contributed significantly to advancements in digital signatures, homomorphic encryption, and secure multi-party computation. He holds a leadership role as Program Chair for the 15th IMA International Conference on Cryptography and Coding (2015) and has been a key figure in shaping modern cryptographic standards. His work often bridges theoretical foundations with practical implementations, emphasizing efficiency and security. Groth's research interests include but are not limited to: cryptographic protocol design, lattice-based cryptography, and the application of zero-knowledge proofs in real-world systems such as blockchain and voting systems. His publications span venues like CRYPTO, EUROCRYPT, and ASIACRYPT, reflecting his impact on the field. Notably, he advocates for open access to research and has contributed to strategies ensuring conferences adopt de facto open-access policies. His current focus at Nexus centers on verifiable computation and distributed cryptographic systems.

• Cryptography
• Cryptographic Protocols
• Zero-Knowledge Proofs
• +5 more

Sushmita Ruj is an Associate Professor in the School of Computer Science and Engineering at the University of New South Wales (UNSW), Sydney. She serves as the Faculty of Engineering Lead for the UNSW Institute for Cybersecurity (IfCyber) and as the Taste of Research (ToR) Coordinator within the School of Computer Science and Engineering. Her academic journey includes previous positions as a Senior Research Scientist at CSIRO's Data61 (2019-2022), Associate Professor at the Indian Statistical Institute, Kolkata, and Assistant Professor at the Indian Institute of Technology (IIT), Indore. Dr. Ruj's primary research interests focus on applied cryptography, post-quantum cryptography, cybersecurity, blockchains, and data privacy. She designs practical, efficient, and provably secure protocols for real-life applications, with particular emphasis on critical infrastructure including smart grids, cloud computing, ad hoc networks, and data sharing frameworks. As quantum technology advances, her work increasingly focuses on developing quantum-safe algorithms to ensure a more secure Internet infrastructure. Her research spans multiple domains including cryptographic key management, proofs of storage, verifiable computation, vector commitments, and privacy-enhancing technologies for cloud and IoT environments. Her recent publications demonstrate a strong trend toward post-quantum cryptography solutions, with particular emphasis on blockchain applications, DNS security, and privacy-preserving protocols for industrial IoT. The research shows increasing focus on practical implementations of theoretical cryptographic concepts, with applications across multiple sectors including finance, healthcare, and critical infrastructure. Her work bridges the gap between theoretical cryptography and real-world security challenges, with growing emphasis on the transition from classical to quantum-resistant systems. Best Paper Award at ACISP 2024 JNCA Best Survey Award (2023) NSW Innovation Award (iAward) Merit Winner (2022) Women in Science Award from CSIRO (2020) ACM Senior Member (2016) IEEE Senior Member (2015) Samsung GRO award (2014) Dr. Ruj has successfully mentored numerous PhD and Master's students, with many of her former students now holding academic positions at institutions like IIT Indore, TU Wien, and CISPA Helmholtz Center. She has secured significant competitive funding including multiple Australian Research Council (ARC) grants, Samsung GRO Award, NetApp Faculty Fellowship, Cisco Academic Grant, and IBM Research grant. Her current research portfolio includes projects on blockchain-based quantum-safe digital medical passports, embedding trust in digital IDs, and resilience of supply chain unstructured data. As Faculty of Engineering Lead for IfCyber, Dr. Ruj plays a key role in UNSW's cybersecurity research initiatives. She has served on editorial boards for prestigious journals including IEEE Transactions on Information Forensics and Security and has held leadership positions in major conferences such as ACISP 2021 and Indocrypt 2020. She was also a member of the working group on "Blockchain For Cybersecurity" for the National Blockchain Roadmap of Australia and the first Blockchain Working group set up by the Reserve Bank of India.

• Cryptography
• Blockchains
• Data Privacy
• +6 more

Alex Lombardi is an Assistant Professor of Computer Science at Princeton University, specializing in cryptography and theoretical computer science. His work explores cryptographic proof systems, post-quantum security, and quantum cryptography. Princeton University (Current) Simons-Berkeley Postdoctoral Fellow (Former) MIT (Graduate Training) Visiting Scientist, Cryptography 10 Years Later Program (2025) Education: PhD in Computer Science from MIT (advised by Vinod Vaikuntanathan) Master's Thesis on Provable Instantiations of Correlation Intractability and the Fiat-Shamir Heuristic Dr. Lombardi's research spans foundational cryptography, with a focus on indistinguishability obfuscation, worst-case assumptions, and quantum cryptographic protocols. His work on SNARGs and PPAD hardness has advanced cryptographic proof systems, while his recent projects address quantum verification and post-quantum security. He encourages prospective cryptography students to apply to Princeton's PhD program. His publications highlight advancements in LWE-based cryptography, quantum protocols, and complexity-theoretic foundations. Key themes include secure computation, hash function design, and cryptographic reductions under quantum assumptions. Scientific Awards: Simons-Berkeley Postdoctoral Fellowship Dr. Lombardi serves on program committees for STOC 2025, EUROCRYPT 2025, and other conferences. He has taught courses like COS 433/533 (Cryptography) and COS 533 (Advanced Cryptography) at Princeton.

• Cryptography
• Theoretical Computer Science
• Post-Quantum Cryptography
• +3 more