- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c86 |      | Oded Goldreich, Shafi Goldwasser, Dana Ron: On the possibilities and limitations of pseudodeterministic algorithms. ITCS 2013: 127-138 |
| c85 | | Elette Boyle, Shafi Goldwasser, Stefano Tessaro: Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting. TCC 2013: 356-376 |
| i25 | | Shafi Goldwasser, Yael Tauman Kalai, Raluca A. Popa, Vinod Vaikuntanathan, Nickolai Zeldovich: Overcoming the Worst-Case Curse for Cryptographic Constructions. IACR Cryptology ePrint Archive 2013: 229 (2013) |
| 2012 | ||
| c84 | | |
| c83 | | Adi Akavia, Shafi Goldwasser, Carmit Hazay: Distributed public key schemes secure against continual leakage. PODC 2012: 155-164 |
| c82 | | |
| c81 | | Elette Boyle, Shafi Goldwasser, Abhishek Jain, Yael Tauman Kalai: Multiparty computation secure against continual memory leakage. STOC 2012: 1235-1254 |
| c80 | | Shafi Goldwasser, Allison B. Lewko, David A. Wilson: Bounded-Collusion IBE from Key Homomorphism. TCC 2012: 564-581 |
| e2 |  | Shafi Goldwasser (Ed.): Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8-10, 2012. ACM 2012, isbn 978-1-4503-1115-1 |
| i24 | | Shafi Goldwasser, Guy N. Rothblum: How to Compute in the Presence of Leakage. Electronic Colloquium on Computational Complexity (ECCC) 19: 10 (2012) |
| i23 | | Oded Goldreich, Shafi Goldwasser, Dana Ron: On the possibilities and limitations of pseudodeterministic algorithms. Electronic Colloquium on Computational Complexity (ECCC) 19: 101 (2012) |
| i22 | | Shafi Goldwasser, Yael Tauman Kalai, Raluca A. Popa, Vinod Vaikuntanathan, Nickolai Zeldovich: Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond. IACR Cryptology ePrint Archive 2012: 733 (2012) |
| 2011 | ||
| p1 | | Oded Goldreich, Shafi Goldwasser, Shai Halevi: Collision-Free Hashing from Lattice Problems. Studies in Complexity and Cryptography 2011: 30-39 |
| c79 | | Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum: Program Obfuscation with Leaky Hardware. ASIACRYPT 2011: 722-739 |
| c78 | | Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai: Black-Box Circular-Secure Encryption beyond Affine Functions. TCC 2011: 201-218 |
| c77 | | Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai: Leakage-Resilient Coin Tossing. DISC 2011: 181-196 |
| i21 | | Eran Gat, Shafi Goldwasser: Probabilistic Search Algorithms with Unique Answers and Their Cryptographic Applications. Electronic Colloquium on Computational Complexity (ECCC) 18: 136 (2011) |
| i20 | | Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai: Leakage-Resilient Coin Tossing. IACR Cryptology ePrint Archive 2011: 291 (2011) |
| i19 | | Shafi Goldwasser, Huijia Lin, Aviad Rubinstein: Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs. IACR Cryptology ePrint Archive 2011: 456 (2011) |
| i18 | | Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum: Program Obfuscation with Leaky Hardware. IACR Cryptology ePrint Archive 2011: 660 (2011) |
| 2010 | ||
| j16 | | Oded Goldreich, Shafi Goldwasser, Asaf Nussboim: On the Implementation of Huge Random Objects. SIAM J. Comput. 39(7): 2761-2822 (2010) |
| c76 | | Zvika Brakerski, Shafi Goldwasser: Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Back). CRYPTO 2010: 1-20 |
| c75 | | Shafi Goldwasser, Guy N. Rothblum: Securing Computation against Continuous Leakage. CRYPTO 2010: 59-79 |
| c74 | | Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan: Robustness of the Learning with Errors Assumption. ICS 2010: 230-240 |
| c73 | | Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz: Erratum for: on basing one-way functions on NP-hardness. STOC 2010: 795-796 |
| c72 | | Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan: Public-Key Encryption Schemes with Auxiliary Inputs. TCC 2010: 361-381 |
| i17 | | Zvika Brakerski, Shafi Goldwasser: Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability (or: Quadratic Residuosity Strikes Back). IACR Cryptology ePrint Archive 2010: 226 (2010) |
| 2009 | ||
| c71 | | |
| c70 | | |
| c69 | | Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan: Simultaneous Hardcore Bits and Cryptography against Memory Attacks. TCC 2009: 474-495 |
| c68 | | Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan: Weak Verifiable Random Functions. TCC 2009: 558-576 |
| i16 | | Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai: Black-Box Circular-Secure Encryption Beyond Affine Functions. IACR Cryptology ePrint Archive 2009: 485 (2009) |
| 2008 | ||
| c67 | | |
| c66 | | |
| c65 | | Ran Canetti, Dror Eiger, Shafi Goldwasser, Dah-Yoh Lim: How to Protect Yourself without Perfect Shredding. ICALP (2) 2008: 511-523 |
| c64 | | Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum: Delegating computation: interactive proofs for muggles. STOC 2008: 113-122 |
| c63 | | Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: A (de)constructive approach to program checking. STOC 2008: 143-152 |
| i15 | | Ran Canetti, Dror Eiger, Shafi Goldwasser, Dah-Yoh Lim: How to Protect Yourself without Perfect Shredding. IACR Cryptology ePrint Archive 2008: 291 (2008) |
| 2007 | ||
| c62 | | Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert de Haan, Vinod Vaikuntanathan: Secure Computation from Random Error Correcting Codes. EUROCRYPT 2007: 291-310 |
| c61 | | Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: Verifying and decoding in constant depth. STOC 2007: 440-449 |
| c60 | | |
| i14 | | 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 | ||
| c59 | | Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanathan: Fault-Tolerant Distributed Computing in Full-Information Networks. FOCS 2006: 15-26 |
| c58 | | Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz: On basing one-way functions on NP-hardness. STOC 2006: 701-710 |
| 2005 | ||
| j15 | | Shafi Goldwasser, Yehuda Lindell: Secure Multi-Party Computation without Agreement. J. Cryptology 18(3): 247-287 (2005) |
| c57 | | Shafi Goldwasser, Yael Tauman Kalai: On the Impossibility of Obfuscation with Auxiliary Input. FOCS 2005: 553-562 |
| c56 | | Shafi Goldwasser, Dmitriy Kharchenko: Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem. TCC 2005: 529-555 |
| c55 | | Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanathan: Distributed Computing with Imperfect Randomness. DISC 2005: 288-302 |
| 2004 | ||
| c54 | | Shafi Goldwasser, Erez Waisbard: Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes. TCC 2004: 77-100 |
| 2003 | ||
| c53 | | Oded Goldreich, Shafi Goldwasser, Asaf Nussboim: On the Implementation of Huge Random Objects. FOCS 2003: 68-79 |
| c52 | | Shafi Goldwasser, Yael Tauman Kalai: On the (In)security of the Fiat-Shamir Paradigm. FOCS 2003: 102-113 |
| c51 | | Adi Akavia, Shafi Goldwasser, Shmuel Safra: Proving Hard-Core Predicates Using List Decoding. FOCS 2003: 146-157 |
| i13 | | Shafi Goldwasser, Yael Tauman: On the (In)security of the Fiat-Shamir Paradigm . Electronic Colloquium on Computational Complexity (ECCC) 10(015) (2003) |
| i12 | | Oded Goldreich, Shafi Goldwasser, Asaf Nussboim: On the Implementation of Huge Random Objects . Electronic Colloquium on Computational Complexity (ECCC)(045) (2003) |
| i11 | | Shafi Goldwasser, Yael Tauman: On the (In)security of the Fiat-Shamir Paradigm. IACR Cryptology ePrint Archive 2003: 34 (2003) |
| 2002 | ||
| c50 | | |
| i10 | | Shafi Goldwasser, Yehuda Lindell: Secure Computation Without Agreement. IACR Cryptology ePrint Archive 2002: 40 (2002) |
| 2001 | ||
| c49 | | Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali: Identification Protocols Secure against Reset Attacks. EUROCRYPT 2001: 495-511 |
| c48 | | Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell: Resettably-Sound Zero-Knowledge and its Applications. FOCS 2001: 116-125 |
| i9 | | Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell: Resettably-Sound Zero-Knowledge and its Applications. IACR Cryptology ePrint Archive 2001: 63 (2001) |
| 2000 | ||
| j14 | | Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky: Testing Monotonicity. Combinatorica 20(3): 301-337 (2000) |
| j13 | | Oded Goldreich, Shafi Goldwasser: On the Limits of Nonapproximability of Lattice Problems. J. Comput. Syst. Sci. 60(3): 540-563 (2000) |
| c47 | | Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali: Resettable zero-knowledge (extended abstract). STOC 2000: 235-244 |
| i8 | | Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali: Identification Protocols Secure Against Reset Attacks. IACR Cryptology ePrint Archive 2000: 15 (2000) |
| 1999 | ||
| j12 | | |
| c46 | | Ran Canetti, Shafi Goldwasser: An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack. EUROCRYPT 1999: 90-106 |
| i7 | | Oded Goldreich, Shafi Goldwasser, Silvio Micali: Interleaved Zero-Knowledge in the Public-Key Model. . Electronic Colloquium on Computational Complexity (ECCC) 6(24) (1999) |
| i6 | | Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali: Resettable Zero-Knowledge. Electronic Colloquium on Computational Complexity (ECCC)(42) (1999) |
| 1998 | ||
| j11 | | Oded Goldreich, Shafi Goldwasser, Dana Ron: Property Testing and its Connection to Learning and Approximation. J. ACM 45(4): 653-750 (1998) |
| j10 | | Oded Goldreich, Shafi Goldwasser, Nathan Linial: Fault-Tolerant Computation in the Full Information Model. SIAM J. Comput. 27(2): 506-544 (1998) |
| j9 | | Shafi Goldwasser: Introduction to Special Section on Probabilistic Proof Systems. SIAM J. Comput. 27(3): 737-738 (1998) |
| c45 | | |
| c44 | | 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 |
| c43 | | Oded Goldreich, Shafi Goldwasser: On the Limits of Non-Approximability of Lattice Problems. STOC 1998: 1-9 |
| 1997 | ||
| c42 | | Mihir Bellare, Shafi Goldwasser: Verifiable Partial Key Escrow. ACM Conference on Computer and Communications Security 1997: 78-91 |
| c41 | | Oded Goldreich, Shafi Goldwasser, Shai Halevi: Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem. CRYPTO 1997: 105-111 |
| c40 | | Oded Goldreich, Shafi Goldwasser, Shai Halevi: Public-Key Cryptosystems from Lattice Reduction Problems. CRYPTO 1997: 112-131 |
| c39 | | Mihir Bellare, Shafi Goldwasser, Daniele Micciancio: "Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case. CRYPTO 1997: 277-291 |
| c38 | | |
| c37 | | |
| i5 | | Oded Goldreich, Shafi Goldwasser, Shai Halevi: Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem. Electronic Colloquium on Computational Complexity (ECCC) 4(18) (1997) |
| i4 | | Oded Goldreich, Shafi Goldwasser: On the Limits of Non-Approximability of Lattice Problems. Electronic Colloquium on Computational Complexity (ECCC) 4(31) (1997) |
| 1996 | ||
| j8 | | 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) |
| c36 | | Oded Goldreich, Shafi Goldwasser, Dana Ron: Property Testing and Its Connection to Learning and Approximation. FOCS 1996: 339-348 |
| i3 | | Oded Goldreich, Shafi Goldwasser, Shai Halevi: Collision-Free Hashing from Lattice Problems. Electronic Colloquium on Computational Complexity (ECCC) 3(42) (1996) |
| i2 | | Oded Goldreich, Shafi Goldwasser, Shai Halevi: Public-Key Cryptosystems from Lattice Reduction Problems. Electronic Colloquium on Computational Complexity (ECCC) 3(56) (1996) |
| i1 | | Oded Goldreich, Shafi Goldwasser, Dana Ron: Property Testing and its connection to Learning and Approximation. Electronic Colloquium on Computational Complexity (ECCC) 3(57) (1996) |
| 1995 | ||
| c35 | | |
| c34 | | Mihir Bellare, Oded Goldreich, Shafi Goldwasser: Incremental cryptography and application to virus protection. STOC 1995: 45-56 |
| 1994 | ||
| j7 | | Mihir Bellare, Shafi Goldwasser: The Complexity of Decision Versus Search. SIAM J. Comput. 23(1): 97-119 (1994) |
| c33 | | Mihir Bellare, Oded Goldreich, Shafi Goldwasser: Incremental Cryptography: The Case of Hashing and Signing. CRYPTO 1994: 216-233 |
| c32 | | Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell: Efficient probabilistic checkable proofs and applications to approximation. STOC 1994: 820 |
| 1993 | ||
| j6 | | Mihir Bellare, Oded Goldreich, Shafi Goldwasser: Randomness in Interactive Proofs. Computational Complexity 3: 319-354 (1993) |
| c31 | | |
| c30 | | Mihir Bellare, Shafi Goldwasser, Carsten Lund, A. Russeli: Efficient probabilistically checkable proofs and applications to approximations. STOC 1993: 294-304 |
| 1992 | ||
| c29 | | Shafi Goldwasser, Rafail Ostrovsky: Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract). CRYPTO 1992: 228-245 |
| 1991 | ||
| c28 | | Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy: Approximating Clique is Almost NP-Complete (Preliminary Version). FOCS 1991: 2-12 |
| c27 | | Richard Beigel, Mihir Bellare, Joan Feigenbaum, Shafi Goldwasser: Languages that Are Easier than their Proofs. FOCS 1991: 19-28 |
| c26 | | Oded Goldreich, Shafi Goldwasser, Nathan Linial: Fault-tolerant Computation in the Full Information Model (Extended Abstract). FOCS 1991: 447-457 |
| 1990 | ||
| j5 | | William Aiello, Shafi Goldwasser, Johan Håstad: On the power of interaction. Combinatorica 10(1): 3-25 (1990) |
| c25 | | Shafi Goldwasser, Leonid A. Levin: Fair Computation of General Functions in Presence of Immoral Majority. CRYPTO 1990: 77-93 |
| c24 | | Mihir Bellare, Oded Goldreich, Shafi Goldwasser: Randomness in Interactive Proofs. FOCS 1990: 563-572 |
| e1 | | Shafi Goldwasser (Ed.): Advances in Cryptology - CRYPTO '88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings. Lecture Notes in Computer Science 403, Springer 1990, isbn 3-540-97196-3 |
| 1989 | ||
| j4 | | Shafi Goldwasser, Silvio Micali, Charles Rackoff: The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. 18(1): 186-208 (1989) |
| c23 | | Mihir Bellare, Shafi Goldwasser: New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs. CRYPTO 1989: 194-211 |
| c22 | | Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson: Efficient Identification Schemes Using Two Prover Interactive Proofs. CRYPTO 1989: 498-506 |
| c21 | | |
| c20 | | Mihir Bellare, Lenore Cowen, Shafi Goldwasser: On the Structure of Secret Key Exchange Protocols. CRYPTO 1989: 604-605 |
| c19 | | Donald Beaver, Shafi Goldwasser: Multiparty Computation with Faulty Majority (Extended Announcement). FOCS 1989: 468-473 |
| 1988 | ||
| j3 | | 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) |
| c18 | | 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 |
| c17 | | Michael Ben-Or, Shafi Goldwasser, Avi Wigderson: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). STOC 1988: 1-10 |
| c16 | | Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson: Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. STOC 1988: 113-131 |
| 1986 | ||
| j2 | | Oded Goldreich, Shafi Goldwasser, Silvio Micali: How to construct random functions. J. ACM 33(4): 792-807 (1986) |
| c15 | | |
| c14 | | Shafi Goldwasser, Michael Sipser: Private Coins versus Public Coins in Interactive Proof Systems. STOC 1986: 59-68 |
| c13 | | |
| 1985 | ||
| c12 | | Benny Chor, Oded Goldreich, Shafi Goldwasser: The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. CRYPTO 1985: 448-457 |
| c11 | | 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 |
| c10 | | Shafi Goldwasser, Silvio Micali, Charles Rackoff: The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). STOC 1985: 291-304 |
| 1984 | ||
| j1 | | Shafi Goldwasser, Silvio Micali: Probabilistic Encryption. J. Comput. Syst. Sci. 28(2): 270-299 (1984) |
| c9 | | Oded Goldreich, Shafi Goldwasser, Silvio Micali: On the Cryptographic Applications of Random Functions. CRYPTO 1984: 276-288 |
| c8 | | Manuel Blum, Shafi Goldwasser: An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. CRYPTO 1984: 289-302 |
| c7 | | Shafi Goldwasser, Silvio Micali, Ronald L. Rivest: A "Paradoxical'"Solution to the Signature Problem (Abstract). CRYPTO 1984: 467 |
| c6 | | Shafi Goldwasser, Silvio Micali, Ronald L. Rivest: A ``Paradoxical'' Solution to the Signature Problem (Extended Abstract). FOCS 1984: 441-448 |
| c5 | | Oded Goldreich, Shafi Goldwasser, Silvio Micali: How to Construct Random Functions (Extended Abstract). FOCS 1984: 464-479 |
| 1983 | ||
| c4 | | |
| 1982 | ||
| c3 | | Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao: On Signatures and Authentication. CRYPTO 1982: 211-215 |
| c2 | | Shafi Goldwasser, Silvio Micali, Po Tong: Why and How to Establish a Private Code on a Public Network (Extended Abstract). FOCS 1982: 134-144 |
| c1 | | Shafi Goldwasser, Silvio Micali: Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information. STOC 1982: 365-377 |
Data released under the ODC-BY 1.0 license — See also our legal information page