Shafi Goldwasser | Academic Influence

Why Is Shafi Goldwasser Influential?

By Erik J. Larson, PhD

Areas of Specialization: Computational Complexity Theory, Cryptography, Number Theory
Shafrira “Shafi” Goldwasser is the RSA Professor of Computer Science at Massachusetts Institute of Technology, as well as Professor of Mathematical Sciences at Weizmann Institute of Science in Israel. She received a bachelor’s degree in computer science and mathematics from Carnegie Mellon University, and a master’s and Ph.D. from the University of California, Berkeley.

Goldwasser’s impressive career spans many areas in computer science, including computational complexity theory, cryptography, and number theory. She has been in high demand during her impressive career in computer science, serving as chief scientist and co-founder of thr Israeli company Duality Technologies using cryptographic methods for data security, and has served as an advisor to a number of successful ventures, including companies focusing on blockchain technology, which has become hugely popular in recent years. Goldwasser is also a member of the Theory of Computation group at the world-renowned Artificial Intelligence Laboratory at MIT. Her primary focus is on fundamental aspects of computer security, like cryptography, a topic that is of both theoretical interest in computer science and mathematics and has obvious practical applications to many industries like finance, banking, and data protection.

Goldwasser received the highest honor in computer science, the Turing Award in 2012, along with Silvio Micali for their work on cryptography. She was elected to the American Academy of Arts and Sciences in 2001, and has received many other awards and distinctions in her career as a computer scientist.

Academic Website

Professional Website

Featured in Top Influential Computer Scientists Today and Top Women in STEM

According to Wikipedia, Shafrira Goldwasser 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.

Shafi Goldwasser's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

Probabilistic Encryption (2976)
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (2865)
The knowledge complexity of interactive proof-systems (2519)
Completeness theorems for non-cryptographic fault-tolerant distributed computation (2318)
How to construct random functions (1968)
The Knowledge Complexity of Interactive Proof Systems (1278)
Property testing and its connection to learning and approximation (1017)
Probabilistic encryption & how to play mental poker keeping secret all partial information (876)
Verifiable secret sharing and achieving simultaneity in the presence of faults (830)
Public-Key Cryptosystems from Lattice Reduction Problems (564)
Private coins versus public coins in interactive proof systems (560)
Machine Learning Classification over Encrypted Data (545)
Multi-prover interactive proofs: how to remove intractability assumptions (498)
Approximating clique is almost NP-complete (488)
Interactive proofs and the hardness of approximating cliques (486)
Simultaneous Hardcore Bits and Cryptography against Memory Attacks (484)
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) (458)
Complexity of lattice problems - a cryptograhic perspective (417)
Complexity of lattice problems (415)
Fair Computation of General Functions in Presence of Immoral Majority (375)
Reusable garbled circuits and succinct functional encryption (365)
Functional Signatures and Pseudorandom Functions (341)
On the (In)security of the Fiat-Shamir paradigm (336)
Advances in Cryptology — CRYPTO’ 88: Proceedings (336)
Efficient probabilistically checkable proofs and applications to approximations (328)
Incremental Cryptography: The Case of Hashing and Signing (317)
Delegating Computation (294)
Lecture Notes on Cryptography (291)
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information (283)
Multi party computations: past and present (257)
Delegating computation: interactive proofs for muggles (255)
Multi-Input Functional Encryption (254)
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) (245)
Almost all primes can be quickly certified (242)
Everything Provable is Provable in Zero-Knowledge (226)
One-Time Programs (218)
Testing Monotonicity (212)
The knowledge complexity of interactive proof-systems (205)
Resettable zero-knowledge (extended abstract) (200)
On the impossibility of obfuscation with auxiliary input (199)
Public-Key Encryption Schemes with Auxiliary Inputs (189)
An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (186)
Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability (or: Quadratic Residuosity Strikes Back) (186)
On the Cryptographic Applications of Random Functions (183)
Collision-Free Hashing from Lattice Problems (180)
Robustness of the Learning with Errors Assumption (165)
How to Run Turing Machines on Encrypted Data (165)
Resettable Zero-Knowledge (164)
On the Limits of Nonapproximability of Lattice Problems (159)
How to Construct Random Functions (Extended Abstract) (153)
Incremental cryptography and application to virus protection (146)
Property testing and its connection to learning and approximation (145)
Verifiable partial key escrow (137)
On Best-Possible Obfuscation (135)
New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs (134)
Secure Computation from Random Error Correcting Codes (124)
On the limits of non-approximability of lattice problems (120)
Proving hard-core predicates using list decoding (119)
The Hunting of the SNARK (115)
Resettably-sound zero-knowledge and its applications (112)
Secure Computation without Agreement (110)
Identification Protocols Secure against Reset Attacks (110)
Secure Multi-Party Computation without Agreement (106)
Multiparty Computation with Faulty Majority (105)
Efficient probabilistic checkable proofs and applications to approximation (100)
Time-Lock Puzzles from Randomized Encodings (95)
How to construct random functions (91)
The Complexity of Decision Versus Search (89)
On Best-Possible Obfuscation (88)
Why and how to establish a private code on a public network (87)
"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case (85)
Securing Computation against Continuous Leakage (83)
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract) (83)
On basing one-way functions on NP-hardness (82)
A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication (82)
Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs (79)
Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem (72)
How to Compute in the Presence of Leakage (69)
Black-Box Circular-Secure Encryption beyond Affine Functions (68)
Splinter: Practical Private Queries on Public Data (68)
Encapsulated Key Escrow (61)
How To Construct Randolli Functions (60)
Primality testing using elliptic curves (59)
Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes (56)
Cryptographic Assumptions: A Position Paper (55)
Fault-tolerant computation in the full information model (54)
Strong signature schemes (54)
Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting (52)
Multiparty computation secure against continual memory leakage (49)
A "Paradoxical'"Solution to the Signature Problem (Abstract) (49)
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (48)
A "Paradoxical" Solution to the Signature Problem (Extended Abstract) (48)
Verifying and decoding in constant depth (48)
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator (47)
Probabilistic encryption & how to play mental poker keeping secret all partial information (46)
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation (45)
SECURITY OF HOMOMORPHIC ENCRYPTION (45)
Proceedings : 35th Annual Symposium on Foundations of Computer Science, November 20-22, 1994, Santa Fe, New Mexico (41)
Probabilistic Search Algorithms with Unique Answers and Their Cryptographic Applications (41)
Program Obfuscation with Leaky Hardware (41)
Cryptology and Computational Number Theory (40)
On the Implementation of Huge Random Objects (38)
Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond (37)
Multiparty computation with faulty majority (36)
Randomness in interactive proofs (36)
Homomorphic Encryption Standard (35)
On the possibility of basing Cryptography on the assumption that P ≠ NP (30)
Practical Accountability of Secret Processes (30)
Multi-prover interactive proofs: how to remove intractability assumptions (30)
The Knowledge Complexity of Interactive Proof System (29)
A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack*: Extended Abstract (29)
A Random Server Model for Private Information Retrieval (or Information Theoretic PIR Avoiding Database Replication (28)
Languages that are easier than their proofs (28)
Fine-grained Complexity Meets IP = PSPACE (28)
A (de)constructive approach to program checking (27)
Formalizing Data Deletion in the Context of the Right to Be Forgotten (26)
Secure large-scale genome-wide association studies using homomorphic encryption (25)
Efficient Identification Schemes Using Two Prover Interactive Proofs (25)
Randomness in interactive proofs (24)
The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults (24)
Weak Verifiable Random Functions (24)
Fault-Tolerant Distributed Computing in Full-Information Networks (24)
Distributed public key schemes secure against continual leakage (23)
On the possibilities and limitations of pseudodeterministic algorithms (22)
On the Power of Interaction (22)
Improved Identification Schemes Based on Error-Correcting Codes (22)
Leakage-resilient coin tossing (21)
Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem (21)
Bounded-Collusion IBE from Key Homomorphism (20)
Distributed Computing with Imperfect Randomness (18)
New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven) (18)
Bipartite Perfect Matching in Pseudo-Deterministic NC (17)
Adaptively Secure Coin-Flipping, Revisited (17)
The Search for Provably Secure Cryptosystems (17)
On the power of interaction (15)
A Study of Statistical Zero-Knowledge Proofs (15)
Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal (15)
Fault-Tolerant Computation in the Full Information Model (15)
Perfect Bipartite Matching in Pseudo-Deterministic RNC (14)
How to Protect Yourself without Perfect Shredding (14)
On the Structure of Secret Key Exchange Protocols (13)
A history of the PCP Theorem (12)
Extractors and the Leftover Hash Lemma (11)
A digital signature scheme against adaptive chosen message attack (11)
Aggregate Pseudorandom Functions and Connections to Learning (11)
Multiparty Computation with Faulty Majority (Extended Announcement) (10)
Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examples (10)
Pseudo-deterministic Proofs (10)
A "paradoxical" solution to the signature problem (10)
How to Incentivize Data-Driven Collaboration Among Competing Parties (10)
Interleaved Zero-Knowledge in the Public-Key Model (8)
Proceedings on Advances in cryptology (8)
Circular-Secure Encryption Beyond Affine Functions (8)
Learning noisy characters, multiplication codes, and cryptographic hardcore predicates (8)
The Bit Security of Modular Squaring Given Partial Factorization of the Modulos (8)
Population Stability: Regulating Size in the Presence of an Adversary (7)
The Computational Benefit of Correlated Instances (7)
Pseudo-deterministic Algorithms (6)
Interactive Proof Systems (6)
Interactive Proofs for Verifying Machine Learning (5)
“Pseudo-Random” Number Generation within Cryptographic Algorithms: the DSS Case (5)
Closest Vector Problem (5)
Overcoming the Worst-Case Curse for Cryptographic Constructions (5)
Leakage-Resilient Coin Tossing (4)
Doubly-Efficient Pseudo-Deterministic Proofs (4)
Cryptography without (Hardly Any) Secrets ? (4)
Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality (4)
Efficient Transformation of Well Known Signature Schemes into Designated Confirmer Signature schemes (4)
Verification Dilemmas, Law, and the Promise of Zero-Knowledge Proofs (3)
On Signatures and Authentication (3)
AUDIT : Practical Accountability of Secret Processes (3)
The Edited Truth (3)
Introduction to Special Section on Probabilistic Proof Systems (3)
A note on the impossibility of obfuscation (3)
Mathematical Foundations of Modern Cryptography: Computational Complexity Perspective (3)
Public-Key Encryption Schemes with Auxiliary Inputs. Theory of Cryptography (2)
Eliminating Decryption Errors in theAjtai-Dwork (2)
Deniable Fully Homomorphic Encryption from Learning with Errors (2)
On the Fine Grained Complexity of Polynomial Time Problems Given Correlated Instances (2)
The Complexity of Problems in P Given Correlated Instances (2)
Shortest Vector Problem (1)
Public-Key Encryption Schemes with Auxiliary Inputs . Theory of Cryptography Citation (1)
Introduction to Homomorphic Encryption (1)
Program Obfuscation and One-Time Programs (1)
Pseudo-deterministic Streaming (1)
The Weizmann Workshop on Probabilistic Proof Systems (1)
Complexity Theoretic Lower Bounds on Cryptographic Functions (1)
How to Compute in the Presence of Leakage (1)
The impossibility of obfuscation with a universal simulator (1)
Safe Machine Learning ( October 19-20 , 2017 ) DARPA workshop at the Simons Institute Organizers : (0)
Robustness of the Learning with Errors Assumption Citation (0)
Deniable Fully Homomorphic Encryption from LWE (0)
A claw-free permutation signature scheme (0)
Bounded-Collusion IBE from Key Homomorphism Citation (0)
Advances in Cryptology - CRYPTO '88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings (0)
8 : Approximation Algorithms 1 Approximation Algorithms (0)
On Time and Order in Multiparty Computation by Sunoo Park (0)
C C ] 7 M ay 2 01 8 Fine-grained Complexity Meets (0)
Athena lecture: Controlling Access to Programs? (0)
Proof Verification in Constant Depth (0)
9807-12 & 26 Research in Cryptography , Information Security and Algorithm Development (0)
What cryptography can bring to law: keynote presentation (0)
On the pseudo-deterministic query complexity of NP search problems (0)
Efficient Interactive Proofs and Applications to Approximation (0)
A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack**This research was supported by NSF grant MCS-80-06938, an IBM/MIT Faculty Development Award, and DARPA contract N00014-85-K-0125. (0)
Advanced Topics in Cryptography (0)
Pseudorandom Functions with Structure : Extensions and Implications (0)
Introduction to the special issue on innovations in theoretical computer science 2012 (0)
Computing on Encrypted Data: Theory and Application (0)
Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : July 1 , 2000 — December 31 , 2000 (0)
University of Azores, Ponta Delgada, Azores, Portugal June 30–July 4, 2010 (0)
On the Work of Madhu Sudan: the 2002 Nevalinna Prize Winner (0)
Identifying unpredictable test examples with worst-case guarantees (0)
A Necessity of Shared Randomness 5 Final Remarks (0)
Deniable Fully Homomorphic Encryption (0)
Introduction to the Special Issue on Innovations in Theoretical Computer Science 2012 - Part II (0)
Pseudo-deterministic Algorithms (Invited Talk) (0)
A "PARADOXICAL" SOl.LJTiOI\I TO THE SIGNATURE: PROBLEM' (0)
Probabilistically Checkable Proofs and Applications (0)
Session details: Crypto I (0)
08491 Abstracts Collection - Theoretical Foundations of Practical Information Security (0)
Local Decoding in Constant Depth (0)
Universal adaptability: Target-independent inference that competes with propensity scoring (0)
Quiz 1 Announcement (0)
Simultaneous Hardcore Bits and Cryptography Against Freezing Attacks (0)
08491 Executive Summary - Theoretical Foundations of Practical Information Security (0)
On the Structure of Secret Key Exchange Protocols (0)
The Cryptographic Lens (0)
Correction to: Non-Interactive Zero-Knowledge with Preprocessing (0)
Deniable Encryption in a Quantum World (0)
Cetacean Translation Initiative: a roadmap to deciphering the communication of sperm whales (0)
Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : January 1 , 2001 – June 30 , 2001 (0)
Theoretical Foundations of Practical Information Security Dagstuhl Seminar (0)
6 Zero Knowledge Proofs (0)
On the complexity of computing algebraic functions (0)
Basis Reduction Problems (0)
Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology (0)
Low-Degree Hypergraphs (0)
Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : July 1 , 1999 — December 31 , 1999 (0)
C C ] 2 O ct 2 01 9 Doubly-Efficient Pseudo-Deterministic Proofs (0)

This paper list is powered by the following services:

Other Resources About Shafi Goldwasser

What Schools Are Affiliated With Shafi Goldwasser?

Shafi Goldwasser is affiliated with the following schools:

Shafi Goldwasser's AcademicInfluence.com Rankings

Computer Science