معرفی
Alex Lombardi is an Assistant Professor of Computer Science at Princeton University, specializing in cryptography and theoretical computer science. He joined Princeton in 2023 after a Simons-Berkeley postdoctoral fellowship hosted by Shafi Goldwasser. His PhD in computer science from MIT (2022) was advised by Vinod Vaikuntanathan. His research focuses on the theoretical foundations of classical and quantum cryptography, with a strong emphasis on cryptographic protocols, complexity theory, and post-quantum security.
Education: PhD in Computer Science, MIT (2022); Postdoctoral Fellowship at Simons Institute for the Theory of Computing (Berkeley). Prior academic roles include teaching at MIT (2018–2019) and serving as a teaching assistant for Cryptography and Cryptanalysis courses.
Research interests span cryptographic proof systems (e.g., succinct arguments, zero-knowledge proofs), lattice-based cryptography, quantum-resistant algorithms, and complexity-theoretic hardness assumptions. His work often bridges cryptography with computational complexity, exploring topics like PPAD hardness, indistinguishability obfuscation, and the Fiat-Shamir heuristic.
Recent publications highlight contributions to SNARGs (succinct non-interactive arguments), post-quantum security analyses, and foundational studies of cryptographic protocols under advanced assumptions (e.g., LWE, Decisional Diffie-Hellman). Key trends include advancing succinct verification techniques, analyzing quantum computational threats, and formalizing cryptographic assumptions via complexity reductions.
Awards: No explicit awards listed, though his prolific publication record in top venues (STOC, CRYPTO, EUROCRYPT) reflects academic recognition.
Teaching: Taught COS 533 (Advanced Cryptography) in 2023 and COS 433/533 (Cryptography) in 2024. Previously, led courses at MIT on cryptographic proofs and foundations.
Service: Served on program committees for STOC 2025, EUROCRYPT 2025, and multiple CRYPTO and TCC events. Active in reviewing for leading cryptography and theoretical computer science conferences.
