# Shafi Goldwasser

#895

Most Influential Person Now

American computer scientist, (1958 - ), New York, New York

## Shafi Goldwasser's AcademicInfluence.com Rankings

Shafi Goldwassercomputer-science Degrees

Computer Science

#91

World Rank

#97

Historical Rank

#52

USA Rank

Database

#597

World Rank

#627

Historical Rank

#219

USA Rank

## Download Badge

Computer Science

## Shafi Goldwasser's Degrees

- PhD Computer Science University of California, Berkeley
- Masters Computer Science Carnegie Mellon University
- Bachelors Mathematics Carnegie Mellon University

## Similar Degrees You Can Earn

## Why Is Shafi Goldwasser Influential?

(Suggest an Edit or Addition)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 Massachusetts Institute of Technology; a professor of mathematical sciences at the Weizmann Institute of Science, Israel; the director of the Simons Institute for the Theory of Computing at the University of California, Berkeley; and co-founder and chief scientist of Duality Technologies.

## Shafi Goldwasser's Published Works

### Published Works

- The knowledge complexity of interactive proof-systems (1985) (3994)
- Probabilistic Encryption (1984) (3161)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (1988) (2948)
- Completeness theorems for non-cryptographic fault-tolerant distributed computation (1988) (2414)
- How to construct random functions (1986) (2109)
- Property testing and its connection to learning and approximation (1996) (1109)
- Probabilistic encryption & how to play mental poker keeping secret all partial information (1982) (977)
- Verifiable secret sharing and achieving simultaneity in the presence of faults (1985) (884)
- Machine Learning Classification over Encrypted Data (2015) (653)
- Public-Key Cryptosystems from Lattice Reduction Problems (1996) (609)
- Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) (1988) (569)
- Private coins versus public coins in interactive proof systems (1986) (548)
- Multi-prover interactive proofs: how to remove intractability assumptions (2019) (518)
- Complexity of lattice problems - a cryptographic perspective (2002) (516)
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks (2009) (506)
- Delegating computation: interactive proofs for muggles (2008) (469)
- Interactive proofs and the hardness of approximating cliques (1996) (465)
- Reusable garbled circuits and succinct functional encryption (2013) (392)
- Complexity of lattice problems (2002) (374)
- Fair Computation of General Functions in Presence of Immoral Majority (1990) (368)
- Functional Signatures and Pseudorandom Functions (2014) (363)
- On the (In)security of the Fiat-Shamir paradigm (2003) (354)
- Advances in Cryptology — CRYPTO’ 88: Proceedings (1990) (336)
- Incremental Cryptography: The Case of Hashing and Signing (1994) (329)
- Efficient probabilistically checkable proofs and applications to approximations (1993) (303)
- Lecture Notes on Cryptography (2001) (298)
- The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) (1985) (284)
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information (1985) (283)
- Multi-Input Functional Encryption (2014) (269)
- Multi party computations: past and present (1997) (262)
- Almost all primes can be quickly certified (1986) (243)
- Everything Provable is Provable in Zero-Knowledge (1990) (237)
- One-Time Programs (2008) (232)
- Testing Monotonicity (1998) (216)
- On Best-Possible Obfuscation (2007) (215)
- On the impossibility of obfuscation with auxiliary input (2005) (202)
- Resettable zero-knowledge (extended abstract) (2000) (197)
- Public-Key Encryption Schemes with Auxiliary Inputs (2010) (196)
- An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (1999) (190)
- Delegating Computation (2015) (190)
- On the Cryptographic Applications of Random Functions (1984) (187)
- Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability (or: Quadratic Residuosity Strikes Back) (2010) (185)
- How to Run Turing Machines on Encrypted Data (2013) (184)
- Robustness of the Learning with Errors Assumption (2010) (183)
- Collision-Free Hashing from Lattice Problems (1996) (181)
- How to Construct Random Functions (Extended Abstract) (1984) (171)
- Resettable Zero-Knowledge (1999) (161)
- On the Limits of Nonapproximability of Lattice Problems (2000) (159)
- Incremental cryptography and application to virus protection (1995) (148)
- The Hunting of the SNARK (2016) (144)
- Verifiable partial key escrow (1997) (143)
- New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs (1989) (139)
- Multiparty computation with faulty majority (1989) (138)
- Secure Computation from Random Error Correcting Codes (2007) (130)
- Efficient probabilistic checkable proofs and applications to approximation (1994) (124)
- Proving hard-core predicates using list decoding (2003) (119)
- On the limits of non-approximability of lattice problems (1998) (117)
- Secure Computation without Agreement (2002) (113)
- Resettably-sound zero-knowledge and its applications (2001) (111)
- Secure Multi-Party Computation without Agreement (2005) (111)
- Identification Protocols Secure against Reset Attacks (2001) (106)
- Time-Lock Puzzles from Randomized Encodings (2016) (105)
- The Complexity of Decision Versus Search (1991) (88)
- A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication (1998) (88)
- Why and how to establish a private code on a public network (1982) (87)
- Splinter: Practical Private Queries on Public Data (2017) (86)
- On basing one-way functions on NP-hardness (2006) (86)
- Securing Computation against Continuous Leakage (2010) (85)
- Randomness in interactive proofs (1990) (84)
- Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs (2011) (82)
- Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract) (1992) (81)
- "Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case (1997) (78)
- Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem (1997) (74)
- Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (2012) (70)
- How to Compute in the Presence of Leakage (2012) (69)
- Black-Box Circular-Secure Encryption beyond Affine Functions (2011) (69)
- Homomorphic Encryption Standard (2019) (66)
- Fault-tolerant computation in the full information model (1991) (63)
- Encapsulated Key Escrow (1996) (62)
- Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting (2013) (60)
- How To Construct Randolli Functions (1984) (60)
- Primality testing using elliptic curves (1999) (60)
- Cryptographic Assumptions: A Position Paper (2016) (60)
- Secure large-scale genome-wide association studies using homomorphic encryption (2020) (58)
- SECURITY OF HOMOMORPHIC ENCRYPTION (2017) (58)
- Strong signature schemes (1983) (55)
- On the implementation of huge random objects (2003) (55)
- Probabilistic Search Algorithms with Unique Answers and Their Cryptographic Applications (2011) (54)
- Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes (2004) (52)
- A "Paradoxical" Solution to the Signature Problem (Extended Abstract) (1984) (51)
- Multiparty computation secure against continual memory leakage (2012) (50)
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation (2015) (47)
- A "Paradoxical'"Solution to the Signature Problem (Abstract) (1984) (46)
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator (2014) (46)
- Practical Accountability of Secret Processes (2018) (44)
- Program Obfuscation with Leaky Hardware (2011) (44)
- Verifying and decoding in constant depth (2007) (44)
- Formalizing Data Deletion in the Context of the Right to Be Forgotten (2020) (43)
- Proceedings : 35th Annual Symposium on Foundations of Computer Science, November 20-22, 1994, Santa Fe, New Mexico (1994) (41)
- Cryptology and Computational Number Theory (1997) (40)
- Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond (2012) (38)
- Fine-grained Complexity Meets IP = PSPACE (2018) (35)
- Leakage-resilient coin tossing (2011) (28)
- On the possibility of basing Cryptography on the assumption that P ≠ NP (1998) (28)
- A (de)constructive approach to program checking (2008) (28)
- On the power of interaction (1986) (27)
- The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults (2015) (27)
- On the possibilities and limitations of pseudodeterministic algorithms (2013) (27)
- Languages that are easier than their proofs (1991) (26)
- Weak Verifiable Random Functions (2009) (26)
- Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examples (2020) (25)
- Distributed public key schemes secure against continual leakage (2012) (25)
- The Knowledge Complexity of Interactive Proof System (1989) (24)
- Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem (2005) (24)
- Efficient Identification Schemes Using Two Prover Interactive Proofs (1989) (24)
- A Study of Statistical Zero-Knowledge Proofs (2021) (24)
- Bipartite Perfect Matching in Pseudo-Deterministic NC (2017) (23)
- Bounded-Collusion IBE from Key Homomorphism (2012) (23)
- Fault-Tolerant Distributed Computing in Full-Information Networks (2006) (23)
- New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven) (1997) (21)
- Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal (2017) (21)
- A Random Server Model for Private Information Retrieval (or Information Theoretic PIR Avoiding Database Replication (1997) (21)
- Planting Undetectable Backdoors in Machine Learning Models (2022) (20)
- Adaptively Secure Coin-Flipping, Revisited (2015) (19)
- Distributed Computing with Imperfect Randomness (2005) (19)
- Interactive Proofs for Verifying Machine Learning (2020) (18)
- Universal adaptability: Target-independent inference that competes with propensity scoring (2022) (17)
- The Search for Provably Secure Cryptosystems (1990) (17)
- A "paradoxical" solution to the signature problem (2019) (17)
- Pseudo-deterministic Proofs (2017) (16)
- How to Protect Yourself without Perfect Shredding (2008) (15)
- A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack*: Extended Abstract (1987) (15)
- Perfect Bipartite Matching in Pseudo-Deterministic RNC (2015) (15)
- Improved Identification Schemes Based on Error-Correcting Codes (1995) (14)
- Aggregate Pseudorandom Functions and Connections to Learning (2015) (13)
- On the Structure of Secret Key Exchange Protocols (1989) (13)
- A history of the PCP Theorem (2005) (13)
- A digital signature scheme against adaptive chosen message attack (1988) (12)
- Extractors and the Leftover Hash Lemma (2011) (11)
- How to Incentivize Data-Driven Collaboration Among Competing Parties (2016) (11)
- Multiparty Computation with Faulty Majority (Extended Announcement) (1989) (10)
- Erratum for: on basing one-way functions on NP-hardness (2010) (9)
- Proceedings on Advances in cryptology (1990) (9)
- Interleaved Zero-Knowledge in the Public-Key Model (1999) (8)
- Circular-Secure Encryption Beyond Affine Functions (2009) (8)
- Verification Dilemmas, Law, and the Promise of Zero-Knowledge Proofs (2021) (8)
- Learning noisy characters, multiplication codes, and cryptographic hardcore predicates (2008) (8)
- Toward understanding the communication in sperm whales (2022) (7)
- The Bit Security of Modular Squaring Given Partial Factorization of the Modulos (1985) (7)
- “Pseudo-Random” Number Generation within Cryptographic Algorithms: the DSS Case (2021) (7)
- Population Stability: Regulating Size in the Presence of an Adversary (2018) (7)
- Deniable Fully Homomorphic Encryption from Learning with Errors (2021) (7)
- The Computational Benefit of Correlated Instances (2015) (7)
- Interactive Proof Systems (2002) (5)
- Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality (2014) (5)
- Doubly-Efficient Pseudo-Deterministic Proofs (2019) (5)
- Overcoming the Worst-Case Curse for Cryptographic Constructions (2013) (5)
- Pseudo-deterministic Algorithms (2012) (5)
- On the pseudo-deterministic query complexity of NP search problems (2021) (4)
- Efficient Transformation of Well Known Signature Schemes into Designated Confirmer Signature schemes (2003) (4)
- Cetacean Translation Initiative: a roadmap to deciphering the communication of sperm whales (2021) (4)
- Pseudo-deterministic Streaming (2019) (4)
- Cryptography without (Hardly Any) Secrets ? (2009) (4)
- On Signatures and Authentication (1982) (4)
- Introduction to Special Section on Probabilistic Proof Systems (1998) (4)
- Mathematical Foundations of Modern Cryptography: Computational Complexity Perspective (2002) (3)
- The Complexity of Problems in P Given Correlated Instances (2017) (3)
- A note on the impossibility of obfuscation (2014) (3)
- AUDIT : Practical Accountability of Secret Processes (2018) (3)
- The Edited Truth (2017) (3)
- Approximating Clique is Almost NP-Complete (Preliminary Version) (1991) (2)
- Introduction to Homomorphic Encryption (2011) (2)
- Complexity Theoretic Lower Bounds on Cryptographic Functions (2003) (2)
- Using Zero-Knowledge to Reconcile Law Enforcement Secrecy and Fair Trial Rights in Criminal Cases (2022) (2)
- Eliminating Decryption Errors in theAjtai-Dwork (2014) (2)
- On the Fine Grained Complexity of Polynomial Time Problems Given Correlated Instances (2016) (2)
- Public-Key Encryption Schemes with Auxiliary Inputs. Theory of Cryptography (2010) (2)
- Public-Key Encryption Schemes with Auxiliary Inputs . Theory of Cryptography Citation (2009) (1)
- The impossibility of obfuscation with a universal simulator (2014) (1)
- The Weizmann Workshop on Probabilistic Proof Systems (1994) (1)
- Deniable encryption in a Quantum world (2021) (1)
- Program Obfuscation and One-Time Programs (2008) (1)
- Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : July 1 , 1999 — December 31 , 1999 (2000) (0)
- Theoretical Foundations of Practical Information Security Dagstuhl Seminar (2009) (0)
- Introduction to the Special Issue on Innovations in Theoretical Computer Science 2012 - Part II (2014) (0)
- On the Work of Madhu Sudan: the 2002 Nevalinna Prize Winner (2002) (0)
- Identifying unpredictable test examples with worst-case guarantees (2020) (0)
- 08491 Executive Summary - Theoretical Foundations of Practical Information Security (2008) (0)
- Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract] (2022) (0)
- On Best-Possible Obfuscation (2013) (0)
- Session details: Crypto I (2009) (0)
- Introduction to the special issue on innovations in theoretical computer science 2012 (2013) (0)
- On the complexity of computing algebraic functions (1990) (0)
- Quiz 1 Announcement (2002) (0)
- 9807-12 & 26 Research in Cryptography , Information Security and Algorithm Development (2000) (0)
- The Cryptographic Lens (2007) (0)
- Bounded-Collusion IBE from Key Homomorphism Citation (2012) (0)
- Correction to: Non-Interactive Zero-Knowledge with Preprocessing (1988) (0)
- 08491 Abstracts Collection - Theoretical Foundations of Practical Information Security (2008) (0)
- Proof Verification in Constant Depth (2009) (0)
- Athena lecture: Controlling Access to Programs? (2009) (0)
- Advanced Topics in Cryptography (2009) (0)
- A Theory of Unsupervised Translation for Understanding Animal Communication (2022) (0)
- 6 Zero Knowledge Proofs (0)
- On Time and Order in Multiparty Computation by Sunoo Park (0)
- Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : January 1 , 2001 – June 30 , 2001 (2000) (0)
- MIT Open Access Articles Reusable garbled circuits and succinct functional encryption (2022) (0)
- University of Azores, Ponta Delgada, Azores, Portugal June 30–July 4, 2010 (2011) (0)
- 8 : Approximation Algorithms 1 Approximation Algorithms (0)
- Simultaneous Hardcore Bits and Cryptography Against Freezing Attacks (2008) (0)
- MIT Open Access Articles Leakage-resilient coin tossing (2022) (0)
- Efficient Interactive Proofs and Applications to Approximation (1993) (0)
- Low-Degree Hypergraphs (2002) (0)
- Deniable Fully Homomorphic Encryption from LWE (2021) (0)
- A claw-free permutation signature scheme (2006) (0)
- A "PARADOXICAL" SOl.LJTiOI\I TO THE SIGNATURE: PROBLEM' (1984) (0)
- Local Decoding in Constant Depth (2009) (0)
- Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology (1988) (0)
- Computing on Encrypted Data: Theory and Application (2016) (0)
- Safe Machine Learning ( October 19-20 , 2017 ) DARPA workshop at the Simons Institute Organizers : (2018) (0)
- Leakage-resilient coin tossing (2014) (0)
- Basis Reduction Problems (2002) (0)
- What cryptography can bring to law: keynote presentation (2019) (0)
- Pseudo-deterministic Algorithms (Invited Talk) (2012) (0)
- Advances in Cryptology - CRYPTO '88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings (1990) (0)
- The Hunting of the SNARK (2016) (0)
- C C ] 7 M ay 2 01 8 Fine-grained Complexity Meets (2018) (0)
- A Necessity of Shared Randomness 5 Final Remarks (1997) (0)
- Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : July 1 , 2000 — December 31 , 2000 (1999) (0)
- Deniable Fully Homomorphic Encryption (2020) (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. (1987) (0)
- C C ] 2 O ct 2 01 9 Doubly-Efficient Pseudo-Deterministic Proofs (2019) (0)
- Probabilistically Checkable Proofs and Applications (1995) (0)
- Robustness of the Learning with Errors Assumption Citation (2009) (0)
- Pseudorandom Functions with Structure : Extensions and Implications (2015) (0)
- A Theory of Unsupervised Translation Motivated by Understanding Animal Communication (2022) (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: