| 2009 |
|---|
| 96 | EE | Shafi Goldwasser:
Cryptography without (Hardly Any) Secrets ?
EUROCRYPT 2009: 369-370 |
| 95 | EE | Adi Akavia,
Shafi Goldwasser,
Vinod Vaikuntanathan:
Simultaneous Hardcore Bits and Cryptography against Memory Attacks.
TCC 2009: 474-495 |
| 94 | EE | Zvika Brakerski,
Shafi Goldwasser,
Guy N. Rothblum,
Vinod Vaikuntanathan:
Weak Verifiable Random Functions.
TCC 2009: 558-576 |
| 2008 |
|---|
| 93 | EE | Shafi Goldwasser,
Yael Tauman Kalai,
Guy N. Rothblum:
One-Time Programs.
CRYPTO 2008: 39-56 |
| 92 | EE | Shafi Goldwasser:
Program Obfuscation and One-Time Programs.
CT-RSA 2008: 333-334 |
| 91 | EE | Ran Canetti,
Dror Eiger,
Shafi Goldwasser,
Dah-Yoh Lim:
How to Protect Yourself without Perfect Shredding.
ICALP (2) 2008: 511-523 |
| 90 | EE | Shafi Goldwasser,
Yael Tauman Kalai,
Guy N. Rothblum:
Delegating computation: interactive proofs for muggles.
STOC 2008: 113-122 |
| 89 | EE | Shafi Goldwasser,
Dan Gutfreund,
Alexander Healy,
Tali Kaufman,
Guy N. Rothblum:
A (de)constructive approach to program checking.
STOC 2008: 143-152 |
| 2007 |
|---|
| 88 | EE | Hao Chen,
Ronald Cramer,
Shafi Goldwasser,
Robbert de Haan,
Vinod Vaikuntanathan:
Secure Computation from Random Error Correcting Codes.
EUROCRYPT 2007: 291-310 |
| 87 | EE | Shafi Goldwasser,
Dan Gutfreund,
Alexander Healy,
Tali Kaufman,
Guy N. Rothblum:
Verifying and decoding in constant depth.
STOC 2007: 440-449 |
| 86 | EE | Shafi Goldwasser,
Guy N. Rothblum:
On Best-Possible Obfuscation.
TCC 2007: 194-213 |
| 85 | EE | Shafi Goldwasser,
Dan Gutfreund,
Alexander Healy,
Tali Kaufman,
Guy N. Rothblum:
A (De)constructive Approach to Program Checking.
Electronic Colloquium on Computational Complexity (ECCC) 14(047): (2007) |
| 2006 |
|---|
| 84 | EE | Shafi Goldwasser,
Elan Pavlov,
Vinod Vaikuntanathan:
Fault-Tolerant Distributed Computing in Full-Information Networks.
FOCS 2006: 15-26 |
| 83 | EE | Adi Akavia,
Oded Goldreich,
Shafi Goldwasser,
Dana Moshkovitz:
On basing one-way functions on NP-hardness.
STOC 2006: 701-710 |
| 2005 |
|---|
| 82 | EE | Shafi Goldwasser,
Madhu Sudan,
Vinod Vaikuntanathan:
Distributed Computing with Imperfect Randomness.
DISC 2005: 288-302 |
| 81 | EE | Shafi Goldwasser,
Yael Tauman Kalai:
On the Impossibility of Obfuscation with Auxiliary Input.
FOCS 2005: 553-562 |
| 80 | EE | Shafi Goldwasser,
Dmitriy Kharchenko:
Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem.
TCC 2005: 529-555 |
| 79 | EE | Shafi Goldwasser,
Yehuda Lindell:
Secure Multi-Party Computation without Agreement.
J. Cryptology 18(3): 247-287 (2005) |
| 2004 |
|---|
| 78 | EE | Shafi Goldwasser,
Erez Waisbard:
Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes.
TCC 2004: 77-100 |
| 2003 |
|---|
| 77 | EE | Shafi Goldwasser,
Yael Tauman Kalai:
On the (In)security of the Fiat-Shamir Paradigm.
FOCS 2003: 102- |
| 76 | EE | Adi Akavia,
Shafi Goldwasser,
Shmuel Safra:
Proving Hard-Core Predicates Using List Decoding.
FOCS 2003: 146- |
| 75 | EE | Oded Goldreich,
Shafi Goldwasser,
Asaf Nussboim:
On the Implementation of Huge Random Objects.
FOCS 2003: 68-79 |
| 74 | EE | Shafi Goldwasser,
Yael Tauman:
On the (In)security of the Fiat-Shamir Paradigm
Electronic Colloquium on Computational Complexity (ECCC) 10(015): (2003) |
| 73 | EE | Oded Goldreich,
Shafi Goldwasser,
Asaf Nussboim:
On the Implementation of Huge Random Objects
Electronic Colloquium on Computational Complexity (ECCC)(045): (2003) |
| 2002 |
|---|
| 72 | EE | Shafi Goldwasser,
Yehuda Lindell:
Secure Computation without Agreement.
DISC 2002: 17-32 |
| 2001 |
|---|
| 71 | EE | Mihir Bellare,
Marc Fischlin,
Shafi Goldwasser,
Silvio Micali:
Identification Protocols Secure against Reset Attacks.
EUROCRYPT 2001: 495-511 |
| 70 | | Boaz Barak,
Oded Goldreich,
Shafi Goldwasser,
Yehuda Lindell:
Resettably-Sound Zero-Knowledge and its Applications.
FOCS 2001: 116-125 |
| 2000 |
|---|
| 69 | EE | Ran Canetti,
Oded Goldreich,
Shafi Goldwasser,
Silvio Micali:
Resettable zero-knowledge (extended abstract).
STOC 2000: 235-244 |
| 68 | EE | Oded Goldreich,
Shafi Goldwasser,
Eric Lehman,
Dana Ron,
Alex Samorodnitsky:
Testing Monotonicity.
Combinatorica 20(3): 301-337 (2000) |
| 67 | | Oded Goldreich,
Shafi Goldwasser:
On the Limits of Nonapproximability of Lattice Problems.
J. Comput. Syst. Sci. 60(3): 540-563 (2000) |
| 1999 |
|---|
| 66 | EE | Ran Canetti,
Shafi Goldwasser:
An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack.
EUROCRYPT 1999: 90-106 |
| 65 | EE | Oded Goldreich,
Shafi Goldwasser,
Silvio Micali:
Interleaved Zero-Knowledge in the Public-Key Model.
Electronic Colloquium on Computational Complexity (ECCC) 6(24): (1999) |
| 64 | EE | Ran Canetti,
Oded Goldreich,
Shafi Goldwasser,
Silvio Micali:
Resettable Zero-Knowledge.
Electronic Colloquium on Computational Complexity (ECCC)(42): (1999) |
| 63 | EE | Shafi Goldwasser,
Joe Kilian:
Primality Testing Using Elliptic Curves.
J. ACM 46(4): 450-472 (1999) |
| 1998 |
|---|
| 62 | EE | Oded Goldreich,
Shafi Goldwasser,
Eric Lehman,
Dana Ron:
Testing Monotonicity.
FOCS 1998: 426-435 |
| 61 | EE | Yael Gertner,
Shafi Goldwasser,
Tal Malkin:
A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication.
RANDOM 1998: 200-217 |
| 60 | EE | Oded Goldreich,
Shafi Goldwasser:
On the Limits of Non-Approximability of Lattice Problems.
STOC 1998: 1-9 |
| 59 | EE | Oded Goldreich,
Shafi Goldwasser,
Dana Ron:
Property Testing and its Connection to Learning and Approximation.
J. ACM 45(4): 653-750 (1998) |
| 58 | | Oded Goldreich,
Shafi Goldwasser,
Nathan Linial:
Fault-Tolerant Computation in the Full Information Model.
SIAM J. Comput. 27(2): 506-544 (1998) |
| 57 | | Shafi Goldwasser:
Introduction to Special Section on Probabilistic Proof Systems.
SIAM J. Comput. 27(3): 737-738 (1998) |
| 1997 |
|---|
| 56 | EE | Mihir Bellare,
Shafi Goldwasser:
Verifiable Partial Key Escrow.
ACM Conference on Computer and Communications Security 1997: 78-91 |
| 55 | EE | Oded Goldreich,
Shafi Goldwasser,
Shai Halevi:
Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem.
CRYPTO 1997: 105-111 |
| 54 | EE | Oded Goldreich,
Shafi Goldwasser,
Shai Halevi:
Public-Key Cryptosystems from Lattice Reduction Problems.
CRYPTO 1997: 112-131 |
| 53 | EE | Mihir Bellare,
Shafi Goldwasser,
Daniele Micciancio:
"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case.
CRYPTO 1997: 277-291 |
| 52 | EE | Shafi Goldwasser:
New Directions in Cryptography: Twenty Some Years Later.
FOCS 1997: 314-324 |
| 51 | | Shafi Goldwasser:
Multi-Party Computations: Past and Present.
PODC 1997: 1-6 |
| 50 | EE | Oded Goldreich,
Shafi Goldwasser,
Shai Halevi:
Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem.
Electronic Colloquium on Computational Complexity (ECCC) 4(18): (1997) |
| 49 | EE | Oded Goldreich,
Shafi Goldwasser:
On the Limits of Non-Approximability of Lattice Problems
Electronic Colloquium on Computational Complexity (ECCC) 4(31): (1997) |
| 1996 |
|---|
| 48 | | Oded Goldreich,
Shafi Goldwasser,
Dana Ron:
Property Testing and Its Connection to Learning and Approximation.
FOCS 1996: 339-348 |
| 47 | EE | Oded Goldreich,
Shafi Goldwasser,
Shai Halevi:
Collision-Free Hashing from Lattice Problems
Electronic Colloquium on Computational Complexity (ECCC) 3(42): (1996) |
| 46 | EE | Oded Goldreich,
Shafi Goldwasser,
Shai Halevi:
Public-Key Cryptosystems from Lattice Reduction Problems
Electronic Colloquium on Computational Complexity (ECCC) 3(56): (1996) |
| 45 | EE | Oded Goldreich,
Shafi Goldwasser,
Dana Ron:
Property Testing and its connection to Learning and Approximation
Electronic Colloquium on Computational Complexity (ECCC) 3(57): (1996) |
| 44 | EE | Uriel Feige,
Shafi Goldwasser,
László Lovász,
Shmuel Safra,
Mario Szegedy:
Interactive Proofs and the Hardness of Approximating Cliques.
J. ACM 43(2): 268-292 (1996) |
| 1995 |
|---|
| 43 | | Shafi Goldwasser:
Probabilistically Checkable Proofs and Applications.
GI Jahrestagung 1995: 13-25 |
| 42 | EE | Mihir Bellare,
Oded Goldreich,
Shafi Goldwasser:
Incremental cryptography and application to virus protection.
STOC 1995: 45-56 |
| 1994 |
|---|
| 41 | EE | Mihir Bellare,
Oded Goldreich,
Shafi Goldwasser:
Incremental Cryptography: The Case of Hashing and Signing.
CRYPTO 1994: 216-233 |
| 40 | EE | Mihir Bellare,
Shafi Goldwasser,
Carsten Lund,
Alexander Russell:
Efficient probabilistic checkable proofs and applications to approximation.
STOC 1994: 820 |
| 39 | | Mihir Bellare,
Shafi Goldwasser:
The Complexity of Decision Versus Search.
SIAM J. Comput. 23(1): 97-119 (1994) |
| 1993 |
|---|
| 38 | | Shafi Goldwasser:
Efficient Interactive Proofs and Applications to Approximation.
ISTCS 1993: 1-2 |
| 37 | EE | Mihir Bellare,
Shafi Goldwasser,
Carsten Lund,
A. Russeli:
Efficient probabilistically checkable proofs and applications to approximations.
STOC 1993: 294-304 |
| 36 | | Mihir Bellare,
Oded Goldreich,
Shafi Goldwasser:
Randomness in Interactive Proofs.
Computational Complexity 3: 319-354 (1993) |
| 1992 |
|---|
| 35 | EE | Shafi Goldwasser,
Rafail Ostrovsky:
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract).
CRYPTO 1992: 228-245 |
| 1991 |
|---|
| 34 | | Richard Beigel,
Mihir Bellare,
Joan Feigenbaum,
Shafi Goldwasser:
Languages that Are Easier than their Proofs
FOCS 1991: 19-28 |
| 33 | | Uriel Feige,
Shafi Goldwasser,
László Lovász,
Shmuel Safra,
Mario Szegedy:
Approximating Clique is Almost NP-Complete (Preliminary Version)
FOCS 1991: 2-12 |
| 32 | | Oded Goldreich,
Shafi Goldwasser,
Nathan Linial:
Fault-tolerant Computation in the Full Information Model (Extended Abstract)
FOCS 1991: 447-457 |
| 1990 |
|---|
| 31 | | Shafi Goldwasser:
Advances in Cryptology - CRYPTO '88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings
Springer 1990 |
| 30 | EE | Shafi Goldwasser,
Leonid A. Levin:
Fair Computation of General Functions in Presence of Immoral Majority.
CRYPTO 1990: 77-93 |
| 29 | | Mihir Bellare,
Oded Goldreich,
Shafi Goldwasser:
Randomness in Interactive Proofs
FOCS 1990: 563-572 |
| 28 | | William Aiello,
Shafi Goldwasser,
Johan Håstad:
On the power of interaction.
Combinatorica 10(1): 3-25 (1990) |
| 1989 |
|---|
| 27 | EE | Mihir Bellare,
Shafi Goldwasser:
New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs.
CRYPTO 1989: 194-211 |
| 26 | EE | Michael Ben-Or,
Shafi Goldwasser,
Joe Kilian,
Avi Wigderson:
Efficient Identification Schemes Using Two Prover Interactive Proofs.
CRYPTO 1989: 498-506 |
| 25 | EE | Donald Beaver,
Shafi Goldwasser:
Multiparty Computation with Faulty Majority.
CRYPTO 1989: 589-590 |
| 24 | EE | Mihir Bellare,
Lenore Cowen,
Shafi Goldwasser:
On the Structure of Secret Key Exchange Protocols.
CRYPTO 1989: 604-605 |
| 23 | | Donald Beaver,
Shafi Goldwasser:
Multiparty Computation with Faulty Majority (Extended Announcement)
FOCS 1989: 468-473 |
| 22 | | Shafi Goldwasser,
Silvio Micali,
Charles Rackoff:
The Knowledge Complexity of Interactive Proof Systems.
SIAM J. Comput. 18(1): 186-208 (1989) |
| 1988 |
|---|
| 21 | EE | Michael Ben-Or,
Oded Goldreich,
Shafi Goldwasser,
Johan Håstad,
Joe Kilian,
Silvio Micali,
Phillip Rogaway:
Everything Provable is Provable in Zero-Knowledge.
CRYPTO 1988: 37-56 |
| 20 | | Michael Ben-Or,
Shafi Goldwasser,
Avi Wigderson:
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
STOC 1988: 1-10 |
| 19 | | Michael Ben-Or,
Shafi Goldwasser,
Joe Kilian,
Avi Wigderson:
Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions
STOC 1988: 113-131 |
| 18 | | Shafi Goldwasser,
Silvio Micali,
Ronald L. Rivest:
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks.
SIAM J. Comput. 17(2): 281-308 (1988) |
| 1986 |
|---|
| 17 | | William Aiello,
Shafi Goldwasser,
Johan Håstad:
On the Power of Interaction
FOCS 1986: 368-379 |
| 16 | | Shafi Goldwasser,
Joe Kilian:
Almost All Primes Can Be Quickly Certified
STOC 1986: 316-329 |
| 15 | | Shafi Goldwasser,
Michael Sipser:
Private Coins versus Public Coins in Interactive Proof Systems
STOC 1986: 59-68 |
| 14 | EE | Oded Goldreich,
Shafi Goldwasser,
Silvio Micali:
How to construct random functions.
J. ACM 33(4): 792-807 (1986) |
| 1985 |
|---|
| 13 | EE | Benny Chor,
Oded Goldreich,
Shafi Goldwasser:
The Bit Security of Modular Squaring Given Partial Factorization of the Modulos.
CRYPTO 1985: 448-457 |
| 12 | | Benny Chor,
Shafi Goldwasser,
Silvio Micali,
Baruch Awerbuch:
Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract)
FOCS 1985: 383-395 |
| 11 | | Shafi Goldwasser,
Silvio Micali,
Charles Rackoff:
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract)
STOC 1985: 291-304 |
| 1984 |
|---|
| 10 | EE | Oded Goldreich,
Shafi Goldwasser,
Silvio Micali:
On the Cryptographic Applications of Random Functions.
CRYPTO 1984: 276-288 |
| 9 | EE | Manuel Blum,
Shafi Goldwasser:
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information.
CRYPTO 1984: 289-302 |
| 8 | EE | Shafi Goldwasser,
Silvio Micali,
Ronald L. Rivest:
A "Paradoxical'"Solution to the Signature Problem (Abstract).
CRYPTO 1984: 467 |
| 7 | | Shafi Goldwasser,
Silvio Micali,
Ronald L. Rivest:
A ``Paradoxical'' Solution to the Signature Problem (Extended Abstract)
FOCS 1984: 441-448 |
| 6 | | Oded Goldreich,
Shafi Goldwasser,
Silvio Micali:
How to Construct Random Functions (Extended Abstract)
FOCS 1984: 464-479 |
| 5 | | Shafi Goldwasser,
Silvio Micali:
Probabilistic Encryption.
J. Comput. Syst. Sci. 28(2): 270-299 (1984) |
| 1983 |
|---|
| 4 | | Shafi Goldwasser,
Silvio Micali,
Andrew Chi-Chih Yao:
Strong Signature Schemes
STOC 1983: 431-439 |
| 1982 |
|---|
| 3 | | Shafi Goldwasser,
Silvio Micali,
Andrew Chi-Chih Yao:
On Signatures and Authentication.
CRYPTO 1982: 211-215 |
| 2 | | Shafi Goldwasser,
Silvio Micali,
Po Tong:
Why and How to Establish a Private Code on a Public Network (Extended Abstract)
FOCS 1982: 134-144 |
| 1 | | Shafi Goldwasser,
Silvio Micali:
Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information
STOC 1982: 365-377 |
