Professor Goldwasser has instructed many students during her career and served as adviser to numerous PhD and M.Sc. students listed below.


Bill Aiello , “Proofs, Knowledge, and Oracles: Three Complexity Results for Interactive Proofs and Zero-Knowledge”, 1988
Adi Akavia, “Learning Noisy Characters, Multiplication Codes and Hardcore Predicates”, 2008
Elette Boyle, “Secure Multi-Party Protocols Under a Modern Lens”, 2013
Zvika Brakerski, “Cryptographic Methods for the Clouds”, 2011
Johan Hastad, “Computational Limitations for Small-Depth Circuits”, 1986
Justin Holmgren, “Secure Computation on Untrusted Platforms”, 2018
Stanislaw Jarecki, “Efficient Threshold Cryptosystems”, 2001
Yael Tauman Kalai
Joe Kilian, “Uses of Randomness in Algorithms and Protocols”, 1989
Da-Yoh Lim
Tal Malkin, “A Study of Secure Database Access and General Two-Party Computation”, 2000
Yishay Mansour, “On the Complexity of Computing Algebraic Functions”, 1990
Daniele Micciancio, “On the Hardness of the Shortest Vector Problem”, 1998
Sunoo Park , 2018
Guy Rothblum, “Delegating Computation Reliably: Paradigms and Constructions”, 2010
Amit Sahai, “New Frontiers in Zero Knowledge”, 2000
Salil Vadhan, “A Study of Statistical Zero-Knowledge Proofs”, 1999
Vinod Vaikuntanathan, “Randomized Algorithms for Reliable Broadcast”, 2008
David Wilson


Victor Boyko, “Preprocessing Discrete Log Computation”, 1998
Tony Eng, Generalized Divertible Zero-Knowledge”, 1993
Yael Gertner, “Distributed Data Base Security”, 1997
Ioana Ivan
Dah-Yoh Lim, 3-Round Weak Zero-knowledge Proofs for NP”, 2004
Yoav Meshulam, “An Incremental Editor”, 1997
Rachel Miller, “New Cryptographic Protocols With Side-Channel Attack Security”, 2011
Amit Sahai, “Minimizing Number of Pebbles in Robot Searches”, 1997
Nitin Thaper, “Using Compression for Source Based Classification of Text”, 2001
Vinod Vaikuntanathan, “Distributed Computing with Imperfect Randomness”, 2005


Zvika Brakerski, “Cryptographic Methods for the Clouds”, 2011
Dror Eiger, “Proactive Secret Sharing with Partial Erasures”, 2007
Eran Gat, “Probabilistic Polynomial Time Algorithm with Canonical Output”, 2010
Dmitry Kharchenko, “Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem”, 2004
Assaf Nussbaum, “Huge Pseudorandom Graphs that Preserve Global Properties of Random Graphs”, 2003
Erez Waisbard, “Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes”, 2003


We are accepting postdocs applications for fall 2013. Please send an email to shafi AT (change β€œAT” to an β€œ@” sign).