On Signatures and Authentication. - Shafi Goldwasser; Silvio Micali; Andrew Chi-Chih Yao (CRYPTO, 1982)

Why and How to Establish a Private Code on a Public Network (Extended Abstract) - Shafi Goldwasser; Silvio Micali; Po Tong (FOCS, 1982)

Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information - Shafi Goldwasser; Silvio Micali (STOC, 1982)

Strong Signature Schemes - Shafi Goldwasser; Silvio Micali; Andrew Chi-Chih Yao (STOC, 1983)

An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. - Manuel Blum 001; Shafi Goldwasser (CRYPTO, 1984)

On the Cryptographic Applications of Random Functions. - Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (CRYPTO, 1984)

A "Paradoxical'"Solution to the Signature Problem (Abstract). - Shafi Goldwasser; Silvio Micali; Ronald L. Rivest (CRYPTO, 1984)

How to Construct Random Functions (Extended Abstract) - Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (FOCS, 1984)

A "Paradoxical" Solution to the Signature Problem (Extended Abstract) - Shafi Goldwasser; Silvio Micali; Ronald L. Rivest (FOCS, 1984)

Probabilistic Encryption. - Shafi Goldwasser; Silvio Micali (J. Comput. Syst. Sci., 1984)

The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. - Benny Chor; Oded Goldreich 001; Shafi Goldwasser (CRYPTO, 1985)

Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) - Benny Chor; Shafi Goldwasser; Silvio Micali; Baruch Awerbuch (FOCS, 1985)

The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) - Shafi Goldwasser; Silvio Micali; Charles Rackoff (STOC, 1985)

Almost All Primes Can Be Quickly Certified - Shafi Goldwasser; Joe Kilian (STOC, 1986)

How to construct random functions. - Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (J. ACM, 1986)

Everything Provable is Provable in Zero-Knowledge. - Michael Ben-Or; Oded Goldreich 001; Shafi Goldwasser; Johan Håstad; Joe Kilian; Silvio Micali; Phillip Rogaway (CRYPTO, 1988)

Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions - Michael Ben-Or; Shafi Goldwasser; Joe Kilian; Avi Wigderson (STOC, 1988)

Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) - Michael Ben-Or; Shafi Goldwasser; Avi Wigderson (STOC, 1988)

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. - Shafi Goldwasser; Silvio Micali; Ronald L. Rivest (SIAM J. Comput., 1988)

Multiparty Computation with Faulty Majority. - Donald Beaver; Shafi Goldwasser (CRYPTO, 1989)

On the Structure of Secret Key Exchange Protocols. - Mihir Bellare; Lenore Cowen; Shafi Goldwasser (CRYPTO, 1989)

New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs. - Mihir Bellare; Shafi Goldwasser (CRYPTO, 1989)

Efficient Identification Schemes Using Two Prover Interactive Proofs. - Michael Ben-Or; Shafi Goldwasser; Joe Kilian; Avi Wigderson (CRYPTO, 1989)

Multiparty Computation with Faulty Majority (Extended Announcement) - Donald Beaver; Shafi Goldwasser (FOCS, 1989)

Private Coins versus Public Coins in Interactive Proof Systems. - Shafi Goldwasser; Michael Sipser (Adv. Comput. Res., 1989)

The Knowledge Complexity of Interactive Proof Systems. - Shafi Goldwasser; Silvio Micali; Charles Rackoff (SIAM J. Comput., 1989)

Fair Computation of General Functions in Presence of Immoral Majority. - Shafi Goldwasser; Leonid A. Levin (CRYPTO, 1990)

On the power of interaction. - William Aiello; Shafi Goldwasser; Johan Håstad (Comb., 1990)

Languages that Are Easier than their Proofs - Richard Beigel; Mihir Bellare; Joan Feigenbaum; Shafi Goldwasser (FOCS, 1991)

Approximating Clique is Almost NP-Complete (Preliminary Version) - Uriel Feige; Shafi Goldwasser; László Lovász 001; Shmuel Safra; Mario Szegedy (FOCS, 1991)

Fault-tolerant Computation in the Full Information Model (Extended Abstract) - Oded Goldreich 001; Shafi Goldwasser; Nathan Linial (FOCS, 1991)

Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract). - Shafi Goldwasser; Rafail Ostrovsky (CRYPTO, 1992)

Efficient Interactive Proofs and Applications to Approximation. - Shafi Goldwasser (ISTCS, 1993)

Efficient probabilistically checkable proofs and applications to approximations. - Mihir Bellare; Shafi Goldwasser; Carsten Lund; Alexander Russell (STOC, 1993)

Randomness in Interactive Proofs. - Mihir Bellare; Oded Goldreich 001; Shafi Goldwasser (Comput. Complex., 1993)

Incremental Cryptography: The Case of Hashing and Signing. - Mihir Bellare; Oded Goldreich 001; Shafi Goldwasser (CRYPTO, 1994)

Efficient probabilistic checkable proofs and applications to approximation. - Mihir Bellare; Shafi Goldwasser; Carsten Lund; Alexander Russell (STOC, 1994)

The Complexity of Decision Versus Search. - Mihir Bellare; Shafi Goldwasser (SIAM J. Comput., 1994)

Probabilistically Checkable Proofs and Applications. - Shafi Goldwasser (GI Jahrestagung, 1995)

Incremental cryptography and application to virus protection. - Mihir Bellare; Oded Goldreich 001; Shafi Goldwasser (STOC, 1995)

Collision-Free Hashing from Lattice Problems - Oded Goldreich 001; Shafi Goldwasser; Shai Halevi (Electron. Colloquium Comput. Complex., 1996)

Public-Key Cryptosystems from Lattice Reduction Problems - Oded Goldreich 001; Shafi Goldwasser; Shai Halevi (Electron. Colloquium Comput. Complex., 1996)

Property Testing and its connection to Learning and Approximation - Oded Goldreich 001; Shafi Goldwasser; Dana Ron (Electron. Colloquium Comput. Complex., 1996)

Verifiable Partial Key Escrow. - Mihir Bellare; Shafi Goldwasser (IACR Cryptol. ePrint Arch., 1996)

Interactive Proofs and the Hardness of Approximating Cliques. - Uriel Feige; Shafi Goldwasser; László Lovász 001; Shmuel Safra; Mario Szegedy (J. ACM, 1996)

"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case. - Mihir Bellare; Shafi Goldwasser; Daniele Micciancio (CRYPTO, 1997)

New Directions in Cryptography: Twenty Some Years Later. - Shafi Goldwasser (FOCS, 1997)

Multi-Party Computations: Past and Present. - Shafi Goldwasser (PODC, 1997)

Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem. - Oded Goldreich 001; Shafi Goldwasser; Shai Halevi (Electron. Colloquium Comput. Complex., 1997)

On the Limits of Non-Approximability of Lattice Problems - Oded Goldreich 001; Shafi Goldwasser (Electron. Colloquium Comput. Complex., 1997)

Testing Monotonicity. - Oded Goldreich 001; Shafi Goldwasser; Eric Lehman; Dana Ron (FOCS, 1998)

A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication. - Yael Gertner; Shafi Goldwasser; Tal Malkin (RANDOM, 1998)

A Random Server Model for Private Information Retrieval (or How to Achieve Information Theoretic PIR Avoiding Data Replication). - Yael Gertner; Shafi Goldwasser; Tal Malkin (IACR Cryptol. ePrint Arch., 1998)

On the possibility of basing Cryptography on the assumption that P ≠ NP. - Oded Goldreich 001; Shafi Goldwasser (IACR Cryptol. ePrint Arch., 1998)

Fault-Tolerant Computation in the Full Information Model. - Oded Goldreich 001; Shafi Goldwasser; Nathan Linial (SIAM J. Comput., 1998)

Introduction to Special Section on Probabilistic Proof Systems. - Shafi Goldwasser (SIAM J. Comput., 1998)

An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack. - Ran Canetti; Shafi Goldwasser (EUROCRYPT, 1999)

Interleaved Zero-Knowledge in the Public-Key Model. - Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (Electron. Colloquium Comput. Complex., 1999)

Resettable Zero-Knowledge. - Ran Canetti; Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (Electron. Colloquium Comput. Complex., 1999)

Primality Testing Using Elliptic Curves. - Shafi Goldwasser; Joe Kilian (J. ACM, 1999)

Resettable zero-knowledge (extended abstract). - Ran Canetti; Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (STOC, 2000)

Testing Monotonicity. - Oded Goldreich 001; Shafi Goldwasser; Eric Lehman; Dana Ron; Alex Samorodnitsky (Comb., 2000)

Identification Protocols Secure Against Reset Attacks. - Mihir Bellare; Marc Fischlin; Shafi Goldwasser; Silvio Micali (IACR Cryptol. ePrint Arch., 2000)

On the Limits of Nonapproximability of Lattice Problems. - Oded Goldreich 001; Shafi Goldwasser (J. Comput. Syst. Sci., 2000)

Resettably-Sound Zero-Knowledge and its Applications. - Boaz Barak; Oded Goldreich 001; Shafi Goldwasser; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2001)

Complexity of lattice problems - a cryptographic perspective. - Daniele Micciancio; Shafi Goldwasser (Springer, 2002)

Secure Computation Without Agreement. - Shafi Goldwasser; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2002)

Proving Hard-Core Predicates Using List Decoding. - Adi Akavia; Shafi Goldwasser; Shmuel Safra (FOCS, 2003)

On the (In)security of the Fiat-Shamir Paradigm. - Shafi Goldwasser; Yael Tauman (Electron. Colloquium Comput. Complex., 2003)

Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes. - Shafi Goldwasser; Erez Waisbard (TCC, 2004)

On the Impossibility of Obfuscation with Auxiliary Input. - Shafi Goldwasser; Yael Tauman Kalai (FOCS, 2005)

Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem. - Shafi Goldwasser; Dmitriy Kharchenko (TCC, 2005)

Distributed Computing with Imperfect Randomness. - Shafi Goldwasser; Madhu Sudan 001; Vinod Vaikuntanathan (DISC, 2005)

Secure Multi-Party Computation without Agreement. - Shafi Goldwasser; Yehuda Lindell (J. Cryptol., 2005)

Fault-Tolerant Distributed Computing in Full-Information Networks. - Shafi Goldwasser; Elan Pavlov; Vinod Vaikuntanathan (FOCS, 2006)

On basing one-way functions on NP-hardness. - Adi Akavia; Oded Goldreich 001; Shafi Goldwasser; Dana Moshkovitz (STOC, 2006)

Secure Computation from Random Error Correcting Codes. - Hao Chen 095; Ronald Cramer; Shafi Goldwasser; Robbert de Haan; Vinod Vaikuntanathan (EUROCRYPT, 2007)

Verifying and decoding in constant depth. - Shafi Goldwasser; Dan Gutfreund; Alexander Healy; Tali Kaufman; Guy N. Rothblum (STOC, 2007)

A (De)constructive Approach to Program Checking. - Shafi Goldwasser; Dan Gutfreund; Alexander Healy; Tali Kaufman; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2007)

One-Time Programs. - Shafi Goldwasser; Yael Tauman Kalai; Guy N. Rothblum (CRYPTO, 2008)

Program Obfuscation and One-Time Programs. - Shafi Goldwasser (CT-RSA, 2008)

08491 Abstracts Collection - Theoretical Foundations of Practical Information Security. - Ran Canetti; Shafi Goldwasser; Günter Müller; Rainer Steinwandt (Theoretical Foundations of Practical Information Security, 2008)

08491 Executive Summary - Theoretical Foundations of Practical Information Security. - Ran Canetti; Shafi Goldwasser; Günter Müller; Rainer Steinwandt (Theoretical Foundations of Practical Information Security, 2008)

How to Protect Yourself without Perfect Shredding. - Ran Canetti; Dror Eiger; Shafi Goldwasser; Dah-Yoh Lim (IACR Cryptol. ePrint Arch., 2008)

Cryptography without (Hardly Any) Secrets ? - Shafi Goldwasser (EUROCRYPT, 2009)

Athena lecture: Controlling Access to Programs? - Shafi Goldwasser (STOC, 2009)

Simultaneous Hardcore Bits and Cryptography against Memory Attacks. - Adi Akavia; Shafi Goldwasser; Vinod Vaikuntanathan (TCC, 2009)

Weak Verifiable Random Functions. - Zvika Brakerski; Shafi Goldwasser; Guy N. Rothblum; Vinod Vaikuntanathan (TCC, 2009)

Black-Box Circular-Secure Encryption Beyond Affine Functions. - Zvika Brakerski; Shafi Goldwasser; Yael Tauman Kalai (IACR Cryptol. ePrint Arch., 2009)

Securing Computation against Continuous Leakage. - Shafi Goldwasser; Guy N. Rothblum (CRYPTO, 2010)

Robustness of the Learning with Errors Assumption. - Shafi Goldwasser; Yael Tauman Kalai; Chris Peikert; Vinod Vaikuntanathan (ICS, 2010)

Erratum for: on basing one-way functions on NP-hardness. - Adi Akavia; Oded Goldreich 001; Shafi Goldwasser; Dana Moshkovitz (STOC, 2010)

Public-Key Encryption Schemes with Auxiliary Inputs. - Yevgeniy Dodis; Shafi Goldwasser; Yael Tauman Kalai; Chris Peikert; Vinod Vaikuntanathan (TCC, 2010)

Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability (or: Quadratic Residuosity Strikes Back). - Zvika Brakerski; Shafi Goldwasser (IACR Cryptol. ePrint Arch., 2010)

On the Implementation of Huge Random Objects. - Oded Goldreich 001; Shafi Goldwasser; Asaf Nussboim (SIAM J. Comput., 2010)

Collision-Free Hashing from Lattice Problems. - Oded Goldreich 001; Shafi Goldwasser; Shai Halevi (Studies in Complexity and Cryptography, 2011)

Probabilistic Search Algorithms with Unique Answers and Their Cryptographic Applications. - Eran Gat; Shafi Goldwasser (Electron. Colloquium Comput. Complex., 2011)

Program Obfuscation with Leaky Hardware. - Nir Bitansky; Ran Canetti; Shafi Goldwasser; Shai Halevi; Yael Tauman Kalai; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2011)

Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs. - Shafi Goldwasser; Huijia Lin; Aviad Rubinstein (IACR Cryptol. ePrint Arch., 2011)

Distributed public key schemes secure against continual leakage. - Adi Akavia; Shafi Goldwasser; Carmit Hazay (PODC, 2012)

Pseudo-deterministic Algorithms (Invited Talk). - Shafi Goldwasser (STACS, 2012)

Multiparty computation secure against continual memory leakage. - Elette Boyle; Shafi Goldwasser; Abhishek Jain 002; Yael Tauman Kalai (STOC, 2012)

Bounded-Collusion IBE from Key Homomorphism. - Shafi Goldwasser; Allison B. Lewko; David A. Wilson (TCC, 2012)

On the possibilities and limitations of pseudodeterministic algorithms. - Oded Goldreich 001; Shafi Goldwasser; Dana Ron (Electron. Colloquium Comput. Complex., 2012)

Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond. - Shafi Goldwasser; Yael Tauman Kalai; Raluca A. Popa; Vinod Vaikuntanathan; Nickolai Zeldovich (IACR Cryptol. ePrint Arch., 2012)

How to Run Turing Machines on Encrypted Data. - Shafi Goldwasser; Yael Tauman Kalai; Raluca A. Popa; Vinod Vaikuntanathan; Nickolai Zeldovich (CRYPTO (2), 2013)

Reusable garbled circuits and succinct functional encryption. - Shafi Goldwasser; Yael Tauman Kalai; Raluca A. Popa; Vinod Vaikuntanathan; Nickolai Zeldovich (STOC, 2013)

Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting. - Elette Boyle; Shafi Goldwasser; Stefano Tessaro (TCC, 2013)

Functional Signatures and Pseudorandom Functions. - Elette Boyle; Shafi Goldwasser; Ioana Ivan (IACR Cryptol. ePrint Arch., 2013)

Multi-Input Functional Encryption. - Shafi Goldwasser; Vipul Goyal; Abhishek Jain 002; Amit Sahai (IACR Cryptol. ePrint Arch., 2013)

A Note on the Impossibility of Obfuscation with Auxiliary Input. - Shafi Goldwasser; Yael Tauman Kalai (IACR Cryptol. ePrint Arch., 2013)

Overcoming the Worst-Case Curse for Cryptographic Constructions. - Shafi Goldwasser; Yael Tauman Kalai; Raluca A. Popa; Vinod Vaikuntanathan; Nickolai Zeldovich (IACR Cryptol. ePrint Arch., 2013)

Introduction to the special issue on innovations in theoretical computer science 2012. - Eric Allender; Shafi Goldwasser (ACM Trans. Comput. Theory, 2013)

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. - Nir Bitansky; Ran Canetti; Henry Cohn; Shafi Goldwasser; Yael Tauman Kalai; Omer Paneth; Alon Rosen (CRYPTO (2), 2014)

Multi-input Functional Encryption. - Shafi Goldwasser; S. Dov Gordon; Vipul Goyal; Abhishek Jain 002; Jonathan Katz; Feng-Hao Liu; Amit Sahai; Elaine Shi; Hong-Sheng Zhou (EUROCRYPT, 2014)

The impossibility of obfuscation with a universal simulator. - Henry Cohn; Shafi Goldwasser; Yael Tauman Kalai (CoRR, 2014)

Leakage-resilient coin tossing. - Elette Boyle; Shafi Goldwasser; Yael Tauman Kalai (Distributed Comput., 2014)

The Computational Benefit of Correlated Instances. - Irit Dinur; Shafi Goldwasser; Huijia Lin (Electron. Colloquium Comput. Complex., 2014)

Machine Learning Classification over Encrypted Data. - Raphael Bost; Raluca Ada Popa; Stephen Tu; Shafi Goldwasser (IACR Cryptol. ePrint Arch., 2014)

Adaptively Secure Two-party Computation From Indistinguishability Obfuscation. - Ran Canetti; Shafi Goldwasser; Oxana Poburinnaya (IACR Cryptol. ePrint Arch., 2014)

Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality. - Nishanth Chandran; Wutichai Chongchitmate; Juan A. Garay; Shafi Goldwasser; Rafail Ostrovsky; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2014)

On Best-Possible Obfuscation. - Shafi Goldwasser; Guy N. Rothblum (J. Cryptol., 2014)

Introduction to the Special Issue on Innovations in Theoretical Computer Science 2012 - Part II. - Eric Allender; Shafi Goldwasser (ACM Trans. Comput. Theory, 2014)

The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults. - Nishanth Chandran; Wutichai Chongchitmate; Juan A. Garay; Shafi Goldwasser; Rafail Ostrovsky; Vassilis Zikas (ITCS, 2015)

Aggregate Pseudorandom Functions and Connections to Learning. - Aloni Cohen; Shafi Goldwasser; Vinod Vaikuntanathan (Electron. Colloquium Comput. Complex., 2015)

Perfect Bipartite Matching in Pseudo-Deterministic RNC. - Shafi Goldwasser; Ofer Grossman (Electron. Colloquium Comput. Complex., 2015)

How to Incentivize Data-Driven Collaboration Among Competing Parties. - Pablo Azar 002; Shafi Goldwasser; Sunoo Park (IACR Cryptol. ePrint Arch., 2015)

Time-Lock Puzzles from Randomized Encodings. - Nir Bitansky; Shafi Goldwasser; Abhishek Jain 002; Omer Paneth; Vinod Vaikuntanathan; Brent Waters (IACR Cryptol. ePrint Arch., 2015)

Aggregatable Pseudorandom Functions and Connections to Learning. - Aloni Cohen; Shafi Goldwasser; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2015)

Cryptographic Assumptions: A Position Paper. - Shafi Goldwasser; Yael Tauman Kalai (IACR Cryptol. ePrint Arch., 2015)

Adaptively Secure Coin-Flipping, Revisited. - Shafi Goldwasser; Yael Tauman Kalai; Sunoo Park (IACR Cryptol. ePrint Arch., 2015)

How to Compute in the Presence of Leakage. - Shafi Goldwasser; Guy N. Rothblum (SIAM J. Comput., 2015)

On the Fine Grained Complexity of Polynomial Time Problems Given Correlated Instances. - Shafi Goldwasser; Dhiraj Holden (Electron. Colloquium Comput. Complex., 2016)

Splinter: Practical Private Queries on Public Data. - Frank Wang; Catherine Yun; Shafi Goldwasser; Vinod Vaikuntanathan; Matei Zaharia (IACR Cryptol. ePrint Arch., 2016)

Bipartite Perfect Matching in Pseudo-Deterministic NC. - Shafi Goldwasser; Ofer Grossman (ICALP, 2017)

The Complexity of Problems in P Given Correlated Instances. - Shafi Goldwasser; Dhiraj Holden (ITCS, 2017)

Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal. - Shafi Goldwasser; Sunoo Park (WPES@CCS, 2017)

Pseudo-Deterministic Proofs. - Shafi Goldwasser; Ofer Grossman; Dhiraj Holden (Electron. Colloquium Comput. Complex., 2017)

Delegating Computation: Interactive Proofs for Muggles. - Shafi Goldwasser; Guy N. Rothblum; Yael Tauman Kalai (Electron. Colloquium Comput. Complex., 2017)

The Edited Truth. - Shafi Goldwasser; Saleet Klein; Daniel Wichs (IACR Cryptol. ePrint Arch., 2017)

The Hunting of the SNARK. - Nir Bitansky; Ran Canetti; Alessandro Chiesa; Shafi Goldwasser; Huijia Lin; Aviad Rubinstein; Eran Tromer (J. Cryptol., 2017)

Population Stability: Regulating Size in the Presence of an Adversary. - Shafi Goldwasser; Rafail Ostrovsky; Alessandra Scafuro; Adam Sealfon (PODC, 2018)

Practical Accountability of Secret Processes. - Jonathan Frankle; Sunoo Park; Daniel Shaar; Shafi Goldwasser; Daniel J. Weitzner (IACR Cryptol. ePrint Arch., 2018)

Public Accountability vs. Secret Laws: Can They Coexist? - Shafi Goldwasser; Sunoo Park (IACR Cryptol. ePrint Arch., 2018)

How to construct random functions. - Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (Providing Sound Foundations for Cryptography, 2019)

Multi-prover interactive proofs: how to remove intractability assumptions. - Michael Ben-Or; Shafi Goldwasser; Joe Kilian; Avi Wigderson (Providing Sound Foundations for Cryptography, 2019)

Completeness theorems for non-cryptographic fault-tolerant distributed computation. - Michael Ben-Or; Shafi Goldwasser; Avi Wigderson (Providing Sound Foundations for Cryptography, 2019)

Probabilistic encryption & how to play mental poker keeping secret all partial information. - Shafi Goldwasser; Silvio Micali (Providing Sound Foundations for Cryptography, 2019)

The knowledge complexity of interactive proof-systems. - Shafi Goldwasser; Silvio Micali; Charles Rackoff (Providing Sound Foundations for Cryptography, 2019)

A "paradoxical" solution to the signature problem. - Shafi Goldwasser; Silvio Micali; Ronald L. Rivest (Providing Sound Foundations for Cryptography, 2019)

What cryptography can bring to law: keynote presentation. - Shafi Goldwasser (CSLAW, 2019)

Fine-grained Complexity Meets IP = PSPACE. - Lijie Chen 001; Shafi Goldwasser; Kaifeng Lyu; Guy N. Rothblum; Aviad Rubinstein (SODA, 2019)

Doubly-Efficient Pseudo-Deterministic Proofs. - Michel X. Goemans; Shafi Goldwasser; Dhiraj Holden (Electron. Colloquium Comput. Complex., 2019)

Pseudo-deterministic Streaming. - Shafi Goldwasser; Ofer Grossman; Sidhanth Mohanty; David P. Woodruff (Electron. Colloquium Comput. Complex., 2019)

Homomorphic Encryption Standard. - Martin R. Albrecht; Melissa Chase; Hao Chen 030; Jintai Ding; Shafi Goldwasser; Sergey Gorbunov 001; Shai Halevi; Jeffrey Hoffstein; Kim Laine; Kristin E. Lauter; Satya Lokam; Daniele Micciancio; et al. (IACR Cryptol. ePrint Arch., 2019)

Identifying unpredictable test examples with worst-case guarantees. - Shafi Goldwasser; Adam Tauman Kalai; Yael Tauman Kalai; Omar Montasser (ITA, 2020)

Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examples. - Shafi Goldwasser; Adam Tauman Kalai; Yael Kalai; Omar Montasser (NeurIPS, 2020)

Interactive Proofs for Verifying Machine Learning. - Shafi Goldwasser; Guy N. Rothblum; Jonathan Shafer; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2020)

Deniable Fully Homomorphic Encryption. - Shweta Agrawal 001; Shafi Goldwasser; Saleet Mossel (IACR Cryptol. ePrint Arch., 2020)

Secure large-scale genome-wide association studies using homomorphic encryption. - Marcelo Blatt; Alexander Gusev; Yuriy Polyakov; Shafi Goldwasser (IACR Cryptol. ePrint Arch., 2020)

Formalizing Data Deletion in the Context of the Right to be Forgotten. - Sanjam Garg; Shafi Goldwasser; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2020)

On the Pseudo-Deterministic Query Complexity of NP Search Problems. - Shafi Goldwasser; Russell Impagliazzo; Toniann Pitassi; Rahul Santhanam (CCC, 2021)

Deniable Fully Homomorphic Encryption from Learning with Errors. - Shweta Agrawal 001; Shafi Goldwasser; Saleet Mossel (CRYPTO (2), 2021)

Cetacean Translation Initiative: a roadmap to deciphering the communication of sperm whales. - Jacob Andreas; Gasper Begus; Michael M. Bronstein; Roee Diamant; Denley Delaney; Shane Gero; Shafi Goldwasser; David F. Gruber; Sarah de Haas; Peter Malkin; Roger Payne; Giovanni Petri; et al. (CoRR, 2021)

Using Zero-Knowledge to Reconcile Law Enforcement Secrecy and Fair Trial Rights in Criminal Cases. - Dor Bitan; Ran Canetti; Shafi Goldwasser; Rebecca Wexler (CSLAW, 2022)

Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]. - Shafi Goldwasser; Michael P. Kim; Vinod Vaikuntanathan; Or Zamir (FOCS, 2022)

Deniable encryption in a Quantum world. - Andrea Coladangelo; Shafi Goldwasser; Umesh V. Vazirani (STOC, 2022)

Planting Undetectable Backdoors in Machine Learning Models. - Shafi Goldwasser; Michael P. Kim; Vinod Vaikuntanathan; Or Zamir (CoRR, 2022)

A Theory of Unsupervised Translation Motivated by Understanding Animal Communication. - Shafi Goldwasser; David F. Gruber; Adam Tauman Kalai; Orr Paradise (NeurIPS, 2023)

Collaborative Privacy-Preserving Analysis of Oncological Data using Multiparty Homomorphic Encryption. - Ravit Geva; Alexander Gusev; Yuriy Polyakov; Lior Liram; Oded Rosolio; Andreea Alexandru; Nicholas Genise; Marcelo Blatt; Zohar Duchin; Barliz Waissengrin; Dan Mirelman; Felix Bukstein; et al. (IACR Cryptol. ePrint Arch., 2023)

Learning Randomized Reductions and Program Properties. - Ferhat Erata; Orr Paradise; Timos Antonopoulos; ThanhVu Nguyen; Shafi Goldwasser; Ruzica Piskac (CoRR, 2024)

Models That Prove Their Own Correctness. - Noga Amit; Orr Paradise; Guy N. Rothblum; Shafi Goldwasser (Electron. Colloquium Comput. Complex., 2024)

Certifying Private Probabilistic Mechanisms. - Zoë Ruha Bell; Shafi Goldwasser; Michael P. Kim; Jean-Luc Watson (IACR Cryptol. ePrint Arch., 2024)

Unsupervised Translation of Emergent Communication. - Ido Levy; Orr Paradise; Boaz Carmeli; Ron Meir; Shafi Goldwasser; Yonatan Belinkov (AAAI, 2025)

Oblivious Defense in ML Models: Backdoor Removal without Detection. - Shafi Goldwasser; Jonathan Shafer; Neekon Vafa; Vinod Vaikuntanathan (STOC, 2025)

A Cryptographic Perspective on Mitigation vs. Detection in Machine Learning. - Greg Gluch; Shafi Goldwasser (CoRR, 2025)

On the Impossibility of Separating Intelligence from Judgment: The Computational Intractability of Filtering for AI Alignment. - Sarah Ball; Greg Gluch; Shafi Goldwasser; Frauke Kreuter; Omer Reingold; Guy N. Rothblum (CoRR, 2025)