Shafi Goldwasser
Born	Shafrira Goldwasser 1958 New York City, New York, U.S.
Nationality	Israeli American
Alma mater	Carnegie Mellon University (BS) University of California, Berkeley (PhD)
Known for	Blum–Goldwasser cryptosystem Goldwasser–Micali cryptosystem
Awards	Grace Murray Hopper Award (1996) Gödel Prize (1993, 2001) IEEE Emanuel R. Piore Award (2011) ACM Turing Award (2012)
Scientific career
Fields	Computer science, cryptography
Institutions	Massachusetts Institute of Technology Weizmann Institute of Science Simons Institute for the Theory of Computing
Thesis	Probabilistic Encryption: Theory and Applications (1984)
Doctoral advisor	Manuel Blum
Doctoral students	Elette Boyle Johan Håstad Yael Tauman Kalai Amit Sahai Joe Kilian Bill Aiello Yishai Mansour Adi Akavia Tal Malkin Daniele Micciancio Vinod Vaikuntanathan Guy Rothblum Zvika Brakerski David Wilson Stanislaw Jarecki Salil Vadhan
Website	people.csail.mit.edu/shafi www.wisdom.weizmann.ac.il/~shafi www.eecs.mit.edu/people/faculty/shafrira-goldwasser

Shafrira "Shafi" Goldwasser (Hebrew: שפרירה גולדווסר‎; born 1958) is an Israeli-American computer scientist and winner of the Turing Award in 2012. She is the RSA Professor of Electrical Engineering and Computer Science at MIT, a professor of mathematical sciences at the Weizmann Institute of Science, Israel, co-founder and chief scientist of Duality Technologies and the director of the Simons Institute for the Theory of Computing in Berkeley, CA.

Publications

• Goldwasser, S. and Micali, S. Probabilistic Encryption. Special issue of Journal of Computer and Systems Sciences, Vol. 28, No. 2, pages 270-299, April 1984. .pdf
• Goldreich, O., Goldwasser, S., and Micali S. How to Construct Random Functions. Journal of the ACM, vol. 33, no. 4, pages 792-807, October 1986. .pdf
• Goldwasser, S., Micali S., and Rackoff, C. The Knowledge Complexity of Interactive Proof Systems. SIAM J. of Computing, vol. 18, no. 1, pages 186-208, January 1989. .pdf
•  Feige, U., Goldwasser, S., Lovasz, L., Safra, S., and Szegedi, M. Interactive Proofs and the Hardness of Approximating Cliques. Journal of the ACM, vol. 43, no 2., pages 268-292, 1996. .pdf
• Goldreich, O., and Goldwasser S., and Linial N. Fault Tolerant Computation in the Full Information Model. SIAM Journal of Computing, vol. 27, no. 2, pages 506-544, April 1998. .pdf
• Golderich, O., Goldwasser S., and Ron D. Property Testing and Its Connection to Learning and Approximation. Journal of the ACM, vol. 45, no. 4, pages 653-750, July 1998. .pdf
• Goldwasser, S. and Kilian J. Primality Testing based on Elliptic Curves. Journal of the ACM, vol. 46, no. 4, pages 450-472, July 1999. .pdf
• Golderich, O. and Goldwasser S. On the Limits of Non-Approximability of Lattice Problems. Journal of Computer and System Sciences, vol. 60, no. 3, pages 540-563, June 2000. .pdf
• Golderich, O., Goldwasser S., Lehman E., Ron D., and Samorodnitsky A. Testing Monotonicity. Combinatorica, vol. 20, no. 3, pages 301-337, 2000. .pdf
• Goldwasser, S. and Micali, S. Probabilistic Encryption and How to Play Mental Poker Hiding All Partial Information. Proceedings of the 14th Annual ACM Symposium on the Theory of Computing, San Francisco California, pages 365-377, May 1982. .pdf
• Goldwasser, S., Micali, S., and Yao, A. Strong Signature Schemes. Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston Massachusetts, pages 431-439, April 1983. .pdf 
•  Goldreich, O., Goldwasser, S., and Micali, S. How to Construct Random Functions. Proceedings of the 25th Annual Symposium on Foundations of Computer Science (FOCS'84), West Palm Beach Florida, pages 464-480, October 1984. .pdf
• Goldwasser, S., Micali, S., and Rivest, R. A Paradoxical Solution to the Signature Problem. Proceedings of the 25th Annual Symposium on Foundations of Computer Science (FOCS'84), West Palm Beach Florida, pages 441-449, October 1984. .pdf
• Goldreich O., Goldwasser, S., and Micali, S. On the Cryptographic Applications of Random Functions. In G.R. Blakely and David Chaum, editors, Advances in Cryptology: Proceedings of CRYPTO'84, Santa Barbara, CA, August 1984, volume 196 of Lecture Notes in Computer Science, pages 276-288, Springer, 1985. .pdf
• Goldwasser, S., Micali, S., and Rackoff, C. The Knowledge Complexity of Interactive Proof Systems. Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC'85), Providence Rhode Island, pages 291-304, May 1985. .pdf
• Chor, B., Goldreich O., and Goldwasser S. The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. In Hugh C. Williams, editor, Advances in Cryptology - Crypto 85, Santa Barbara, CA, August 1985, volume 218 of Lecture Notes in Computer Science, pages 448-457, Springer, 1986. .pdf
• Goldwasser, S. and Sipser, M. Private Coins versus Public Coins in Interactive Proof Systems. Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC'86), Berkeley CA, May, pages 59-86, 1986. .pdf
• Goldwasser, S. and Kilian, J. Almost All Primes Can be Quickly Certified. Proceedings of the 18th Annual ACM Symposium on the Theory of Computing (STOC'86), Berkeley, CA, pages 315-329, May 1986. .pdf
• Ben-Or, M., Goldwasser S., Kilian J., and Wigderson A. Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC'88),Chicago, Illinois, pages 113-122, May 1988. .pdf
• Ben-Or, M., Goldwasser S., and Wigderson A. Completeness Theorems for Non-Cryptographic Fault Tolerant Distributed Computation Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC'88), Chicago, Illinois, pages 1-10, May 1988. Invited to special issue of Journal of Computer Science and Systems. .pdf
• Bellare, M. and Goldwasser, S. New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge Proofs. In G. Brassard, editor, Advances in Cryptology - CRYPTO'89, Proceedings, Santa Barbara, CA, August 1989, volume 435 of Lecture Notes in Computer Science, pages 194-211, Springer, 1990. .pdf
• Beaver, D. and Goldwasser, S. Multiparty Computation with Faulty Majority. In G. Brassard, editor, Advances in Cryptology - CRYPTO'89, Proceedings, Santa Barbara, CA, August 1989, volume 435 of Lecture Notes in Computer Science, pages 589-590, Springer, 1990. .pdf
• Ben-Or, M., Goldwasser S., Kilian J., and Wigderson A. Efficient Identification Schemes Using Two Prover Interactive Proofs. In G. Brassard, editor, Advances in Cryptology - CRYPTO'89, Proceedings, Santa Barbara, CA, August 1989, volume 435 of Lecture Notes in Computer Science, pages 498-506, Springer, 1990. .pdf
• Beaver, D., and Goldwasser, S. Multiparty Computation with Faulty Majority. Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS'89), Duke, NC, pages 468-473, IEEE, October 1989. .pdf
• Bellare, M., Goldreich, O., and Goldwasser S. Randomness in Interactive Proofs. Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS'90), St. Louis, MS, pages 563-573, IEEE, May 1990. .pdf
• Goldwasser, S. and Levin L. Fair Computation of General Functions in Presence of Immoral Majority. In A. J. Menezes and S. A. Vanstone, editors Advances in Cryptology - Crypto'90, Proceedings, in volume 537 of Lecture Notes in Computer Science, pages 77-93, Springer, 1991. .pdf
• Feige, U., Goldwasser S., Lovasz L., Szegedi M., and Safra S. Approximating the Clique is Almost NP-Complete. Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS'91),, San Juan, Puerto Rico, pages 2-12, IEEE, October 1991. .pdf
• Beigel, R., Bellare, M., Feigenbaum, J., and Goldwasser, S. Languages That Are Faster Than Their Proofs Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS'91),, San Juan, Puerto Rico, pages 19-28, IEEE, October 1991. .pdf
• Goldreich, O., Goldwasser S., Linial N. Fault Tolerant Computation in the Full Information Model. Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS'91),, San Juan, Puerto Rico, pages 447-457, IEEE, October 1991. .pdf
• Goldwasser, S., Ostrovsky, R. Invariant Signatures and Non-interactive Zero-Knowledge Proofs are Equivalent In Ernest F. Brickell, editor, Advances in Cryptology - CRYPTO'92, Proceedings of the 12th Annual International Cryptology Conference, Santa Barbara, CA, August 1992,, in volume 740 of Lecture Notes in Computer Science, pages 228-245, Springer, 1993. .pdf
• Bellare, M., Goldreich O., Goldwasser S. Incremental Cryptography: the Case of Hashing and Signing. In Yvo Desmedt, editor, Advances in Cryptology - CRYPTO'94, 14th Annual International Cryptology Conference, Santa Barbara, CA, August 1994, volume 839 of Lecture Notes in Computer Science, pages 216-233, Springer, 1994. .pdf
• Bellare, M., Goldreich O., Goldwasser S. Incremental Cryptography and Application to Virus Protection. Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing (STOC'95), Las Vegas, NV, pages 45-56, May 1995. .pdf
• Goldreich O., Goldwasser S., and Ron D. Property Testing and its Connections to Learning and Approximation. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS'96), Burlington, VT, pages 339-348, October 1996. Final version Accepted to the Journal of the ACM. .pdf
• Bellare, M. and Goldwasser, S. Verifiable partial key escrow. Proceedings of the 4th ACM Conference on Computer & Communications Security (CCS'97), Zurich, Switzerland, pages 78-91, April 1997. Also, Technical Report number CS95-447, Dept of CS and Engineering, UCSD, October 1995. .pdf
• Goldreich, O., Goldwasser, S., and Halevi, S. Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem. In B. Kaliski, Jr., editor, Advances in Cryptology - CRYPTO'97, Proceedings of the 17th Annual International Cryptology Conference, Santa Barbara, CA, August, 1997, volume 1294 of Lecture Notes in Computer Science, pages 105-111, Springer, 1997. .pdf
• Goldreich, O., Goldwasser, S., and Halevi, S. Public-Key Cryptosystems from Lattice Reduction Problems. In B. Kaliski, Jr., editor, Advances in Cryptology - CRYPTO'97, Proceedings of the 17th Annual International Cryptology Conference, Santa Barbara, CA, August, 1997, volume 1294 of Lecture Notes in Computer Science, pages 112-131, Springer, 1997. .pdf
• Bellare, M., Goldwasser S., and Micciancio, D. "Pseudo-Random" Number Generation within Cryptographic Algorithms: The DDS Case. In B. Kaliski, Jr., editor, Advances in Cryptology - CRYPTO'97, Proceedings of the 17th Annual International Cryptology Conference, Santa Barbara, CA, August, 1997, volume 1294 of Lecture Notes in Computer Science, pages 277-291, Springer, 1997. .pdf
• Goldwasser, S. Multi-Party Computations: Past and Present. Invited paper to the Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing (PODC'97), Santa Barbara, CA, pages 1-6, August, 1997. .pdf
• Goldwasser, S. New Directions in Cryptography: Twenty Some Years Later (or Cryptography and Complexity: A Match Made in Heaven). Invited paper to the Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, (FOCS '97), Miami Beach, Florida, pages 314-324, October 1997. .pdf
• Goldreich, O. and Goldwasser, S. On the Limits of Non-Approximability of Lattice Problems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), Dallas, TX, pages 1-9, May 1998. .pdf 
• Goldreich, O., Goldwasser, S., Lehman, E., and Ron, D. Testing Monotonicity. In Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science (FOCS'98), Palo Alto, CA, pages 426-435, October 1998. .pdf
• Gertner Y., Goldwasser S., and Malkin T. A Random Server Model for Private Information Retrieval (or How to Achieve Information Theoretic PIR Avoiding Database Replication).. In M. Luby, J. D. P. Rolim, and M. Serna, editors, Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 1998, volume 1518 of Lecture Notes in Computer Science, pages 200-217, Springer, 1998..pdf
• Canetti, R., Goldreich, O., Goldwasser, S., and Micali, S. Resettable Zero Knowledge. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC'00), pages 235-244, Portland, Oregon, May 2000. .pdf
• Bellare, M., Fischlin, M., Goldwasser, S., and Micali, S. Identification Protocols Secure Against Reset Attacks.. In B. Pfitzmann, editor, Advances in Cryptology - Eurocrypt 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May, 2001, volume 2045 of Lecture Notes in Computer Science, pages 495-511, Springer, 2001. .pdf
• Barak, B., Goldreich, O., Goldwasser, S., and Lindell, Y. Resettably-Sound Zero-Knowledge and its Applications. Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS'01), pages 116-125, Las Vegas, Nevada, October 2001. .pdf
• Goldwasser S. and Lindell, Y. Secure Computation without Agreement. Proceedings of the 16th Int'l Symposium on DIStributed Computing (DISC), pages 17-32, Toulouse, France, October 2002. .pdf
• Akavia, A., Goldwasser, S., and Safra, Samuel. Proving Hard-Core Predicates Using List Decoding. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 146-157, Cambridge, MA, October 2003. .pdf
• Goldreich, O., Goldwasser, S., and Nussboim, A. On the Implementation of Huge Random Objects. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 68-79, Cambridge, MA, October 2003. .pdf
• Goldwasser, S. and Kalai, Y.T. On the (in)security of the Fiat-Shamir paradigm. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), pages 102-113, Cambridge, MA, October 2003. .pdf