#1822 Overall Influence

American computer scientist

Shafrira “Shafi” Goldwasser is the RSA Professor of Computer Science at MIT, 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 at 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.

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

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.

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

University of California, Berkeley

Public research university in Berkeley, California, United States

Massachusetts Institute of Technology

Research university in Cambridge, Massachusetts, United States

Weizmann Institute of Science

Public research university in Rehovot, Israel

Carnegie Mellon University

Private research university in Pittsburgh, Pennsylvania, United States

#109 World Rank

Computer Science

#448 World Rank

Engineering

#581 World Rank

Mathematics

Stay informed! Get the latest Academic Influence news, information, and rankings with our upcoming newsletter.