Alex Lombardi

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.