New York City, NY, US
|Fields||Computer science, cryptography|
|Thesis||Probabilistic Encryption: Theory and Applications (1984)|
|Doctoral advisor||Manuel Blum|
Shafrira Goldwasser (Hebrew: שפרירה גולדווסר) is an American-Israeli 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.
Born in New York City, Goldwasser obtained her B.S. (1979) in mathematics and science from Carnegie Mellon University, and M.S. (1981) and PhD (1984) in computer science from the University of California, Berkeley under the supervision of Manuel Blum, who is well known for advising some of the most prominent researchers in the field. She joined MIT in 1983, and in 1997 became the first holder of the RSA Professorship. She became a professor at the Weizmann Institute of Science, concurrent to her professorship at MIT, in 1993. She is a member of the Theory of Computation group at MIT Computer Science and Artificial Intelligence Laboratory. Goldwasser was a co-recipient of the 2012 Turing Award. On January 1, 2018, Goldwasser became the director of the Simons Institute for the Theory of Computing at the University of California, Berkeley.
Since November 2016, Goldwasser is Chief Scientist and Co-Founder of Duality Technologies, an Israeli-American start-up which offers secure data analytics using advanced cryptographic techniques. She is also a scientific advisor for several technology start ups in the security area, including QED-it, specializing in the Zero Knowledge Blockchain, and Algorand, a Proof-of-stake Blockchain.
Goldwasser's research areas include computational complexity theory, cryptography and computational number theory. She is the co-inventor of probabilistic encryption, which set up and achieved the gold standard for security for data encryption. She is the co-inventor of zero-knowledge proofs, which probabilistically and interactively demonstrate the validity of an assertion without conveying any additional knowledge, and are a key tool in the design of cryptographic protocols. Her work in complexity theory includes the classification of approximation problems, showing that some problems in NP remain hard even when only an approximate solution is needed, and pioneering methods for delegating computations to untrusted servers. Her work in number theory, includes the invention with Joe Kilian of primality proving using elliptic curves.
Goldwasser was awarded the 2012 Turing Award along with Silvio Micali for their work in the field of cryptography. Goldwasser has twice won the Gödel Prize in theoretical computer science: first in 1993 (for "The knowledge complexity of interactive proof systems"), and again in 2001 (for "Interactive Proofs and the Hardness of Approximating Cliques"). Other awards include the ACM Grace Murray Hopper Award (1996) for outstanding young computer professional of the year and the RSA Award in Mathematics (1998) for outstanding mathematical contributions to cryptography. In 2001 she was elected to the American Academy of Arts and Sciences, in 2004 she was elected to the National Academy of Science, and in 2005 to the National Academy of Engineering. She was selected as an IACR Fellow in 2007. Goldwasser received the 2008-2009 Athena Lecturer Award of the Association for Computing Machinery's Committee on Women in Computing. She is the recipient of The Franklin Institute's 2010 Benjamin Franklin Medal in Computer and Cognitive Science. She received the IEEE Emanuel R. Piore Award in 2011. She received the 2018 Frontier of Knowledge award together with Micali, Rivest and Shamir. She was elected as an ACM Fellow in 2017. In 2018, she was awarded an honorary degree by her alma mater, Carnegie Mellon University.
- Goldwasser, S.; Micali, S.; Rivest, R. L. (1988). "A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks". SIAM Journal on Computing. 17 (2): 281. doi:10.1137/0217017.
- Savage, N. (2013). "Proofs probable: Shafi Goldwasser and Silvio Micali laid the foundations for modern cryptography, with contributions including interactive and zero-knowledge proofs". Communications of the ACM. 56 (6): 22. doi:10.1145/2461256.2461265.
- Shafi Goldwasser at the Mathematics Genealogy Project
- "Shafi Goldwasser | MIT CSAIL". www.csail.mit.edu. Retrieved 2018-11-02.
- "About - Duality Technologies". Duality Technologies. Retrieved 10 April 2018.
- Exponent: Shafi Goldwasser Archived September 27, 2010, at the Wayback Machine.
- Shafi Goldwasser author profile page at the ACM Digital Library
- Shafi Goldwasser's publications indexed by the Scopus bibliographic database. (subscription required)
- Goldwasser, S.; Micali, S. (1984). "Probabilistic encryption". Journal of Computer and System Sciences. 28 (2): 270. doi:10.1016/0022-0000(84)90070-9.
- "Shafi Goldwasser Biography". www.BookRags.com.
- AbAbazorius, CSAIL (13 March 2013). "Goldwasser and Micali win Turing Award". MIT News.
- "Shafi Goldwasser appointed director of the Simons Institute for the Theory of Computing". News.berkeley.edu. 10 October 2017. Retrieved 10 April 2018.
- "Probabilistic Encryption" (PDF). Groups.csail.mit.edu. Retrieved 10 April 2018.
- "Interactive Proofs and the Hardness of Approximating Cliques" (PDF). Groups.csail.mit.edu. Retrieved 10 April 2018.
- Goldwasser, Shafi; Kalai, Yael Tauman; Rothblum, Guy (1 January 2008). "Delegating computation: interactive proofs for muggles". Microsoft Research. Retrieved 10 April 2018.
- "Primality Testing Using Elliptic Curves - Semantic Scholar". Semanticscholar.org. Retrieved 10 April 2018.
- "Goldwasser, Micali Receive ACM Turing Award for Advances in Cryptography". ACM. Archived from the original on 16 March 2013. Retrieved 13 March 2013.
- Goldwasser, S.; Micali, S.; Rackoff, C. (1985). "The knowledge complexity of interactive proof-systems". Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85. p. 291. doi:10.1145/22145.22178. ISBN 0897911512.
- Feige, U.; Goldwasser, S.; Lovász, L.; Safra, S.; Szegedy, M. (1996). "Interactive proofs and the hardness of approximating cliques". Journal of the ACM. 43 (2): 268–292. doi:10.1145/226643.226652.
- "Home". weizmann.ac.il.
- News Office (21 October 2009). "Goldwasser, Stubbe named Franklin Institute laureates". MIT News.
- "homepage - Premios Fronteras". Premios Fronteras. Retrieved 10 April 2018.
- ACM Recognizes 2017 Fellows for Making Transformative Contributions and Advancing Technology in the Digital Age, Association for Computing Machinery, December 11, 2017, retrieved 2017-11-13
- University, Carnegie Mellon. "Commencement Speakers and Honorary Degree Recipients - Leadership - Carnegie Mellon University". www.cmu.edu. Retrieved 2018-09-21.