Students/visitors and supervised projects/theses
PhD students
Current
- Kasra Abbaszadeh
- Kanav Gupta
- Ben Sela
Former
- Giorgos Tsimos (2025, co-advised with Babis Papamanthou): Improving Round and Communication Metrics in Consensus
-
Doruk Gur (2025): Practical Multiparty Protocols from Lattice Assumptions: Threshold Signatures, Oblivious Pseudorandom Functions, and More
- Noemi Glaeser (2024, co-advised with Giulio Malavolta): Practical Cryptography for Blockchains: Secure Protocols with Minimal Trust
- Chen Bai (2024, co-advised with Gorjan Alagic): Symmetric-Key Cryptography and Query Complexity in the Quantum World
- Michael Rosenberg (2024, co-advised with Ian Miers): Zero-Knowledge Proofs for Programmable Anonymity, Moderation, and Reputation
- Erica Blum (2023): Resilient and Efficient Consensus Under Unknown Network Conditions
- Yupeng Zhang (2018, co-advised with Babis Papamanthou): New (Zero-Knowledge) Arguments and Their Applications to Verifiable Computation
Recipient of ACM SIGSAC dissertation award
ECE Department Distinguished Dissertation Award
- Xiao Wang (2018): A New Paradigm For Practical Maliciously Secure Multi-Party Computation
Larry S. Davis Doctoral Dissertation Award
- Kartik Nayak (2018, co-advised with Elaine Shi): Efficient Data-Oblivious Computation
- Daniel Apon (2017): Frontiers in Lattice Cryptography and Program Obfuscation
- Aishwarya Thiruvengadam (2017, co-advised with Dana Dachman-Soled):
Improving Round Complexity of Ideal-Cipher Constructions
- Andrew Miller (2016, co-advised with Elaine Shi): Provable Security for Cryptocurrencies
Larry S. Davis Doctoral Dissertation Award
- Alex Malozemoff (2016): Efficient Secure Computation for Real-World Settings and Security Models
- Adam Groce (2014): New Notions and Mechanisms for Statistical Privacy
- Ranjit Kumaresan (2012): Broadcast and Verifiable Secret Sharing: New Security Models and Round-Optimal Constructions
- Arkady Yerukhimovich (2011): A Study of Separations in Cryptography: New Results and New Models
- Dov Gordon (2010): On Fairness in Secure Computation
- Chiu-Yuen Koo (2007): Studies on Fault-Tolerant Broadcast and Secure Computation
- Omer Horvitz (2007): Expressiveness of Definitions and Efficiency of Constructions in Computational Cryptography
- Ruggero Morselli (2006, co-advised with Bobby Bhattacharjee): Lookup Protocols and Techniques for Anonymity
Postdocs (current and former)
Visitors
PhD Theses, committee member (selected)
Master's Theses, advisor
Undergraduate Projects, advisor (selected)