Some CRYPTO Related Papers by Oded Goldreich

last updated: Oct. 2006

NOTE: This page is casually updated. In case you don't find some paper here, please look at the general list of papers.

See also a webpage on the Foundations of Cryptography (including surveys).

The following papers can be obtained in PostScript (papers in REVERSE CHRONOLOGICAL ORDER):

M. Bellare and O. Goldreich, On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge, 2006.
O. Goldreich, On Expected Probabilistic Polynomial-Time Adversaries - A suggestion for restricted definitions and their benefits, August 2006.
A. Akavia, O. Goldreich, S. Goldwasser, and D. Moshkovitz, On Basing One-Way Functions on NP-Hardness, 2005.
M. Bellare, O. Goldreich and A. Mityagin, The Power of Verification Queries in Message Authentication and Authenticated Encryption, 2004.
R. Canetti, O. Goldreich, S. Halevi, On the random-oracle methodology as applied to length-restricted signature schemes, July 2003.
O. Goldreich, The GGM Construction does NOT yield Correlation Intractable Function Ensembles, 2002.
O. Goldreich, Y. Lustig and M. Naor, On Chosen Ciphertext Security of Multiple Encryptions, 2002.
B. Barak and O. Goldreich, Universal Arguments and their Applications, 2001.
O. Goldreich, Concurrent Zero-Knowledge With Timing, Revisited, 2001.
B. Barak, O. Goldreich, S. Goldwasser and Y. Lindell, Resettably-Sound Zero-Knowledge and its Applications, 2001.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan and K. Yang, On the (Im)possibility of Obfuscating Programs, 2001.
O. Goldreich, Cryptography and Cryptographic Protocols, June 2001.
O. Goldreich, Candidate One-Way Functions Based on Expander Graphs, 2000.
O. Goldreich and Y. Lindell, Session-Key Generation using Human Passwords Only, 2000.
O. Goldreich and V. Rosen, On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators, 2000.
O. Goldreich, On Security Preserving Reductions - Revised Terminology, Jan. 2000.
R. Canetti, O. Goldreich, S. Goldwasser and S. Micali, Resettable Zero-Knowledge, 1999.
O. Goldreich, Preface to Special Issue on General Secure Multi-Party Computation, 1999.
O. Goldreich, S. Goldwasser and S. Micali, Interleaved Zero-Knowledge, 1999.
M. Bellare, O. Goldreich and H. Krawczyk, Stateless evaluation of pseudorandom functions: Security beyond the birthday barrier, 1999. (Available in multiple formats from Mihir's page.)
R. Canetti, O. Goldreich, S. Halevi, The Random Oracle Methodology, Revisited, March 1998.
O. Goldreich and S. Goldwasser, On the possibility of basing Cryptography on the assumption that P neq NP, Feb. 1998.
O. Goldreich, B. Pfitzmann, and R.L. Rivest, Self-Delegation with Controlled Propagation, Sept 1997.
O. Goldreich, The Foundations of Cryptography - An Essay, June 1997.
O. Goldreich, S. Goldwasser and S. Halevi, Using Lattice Problems in Cryptography
- Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem, May 1997.
- Public-Key Cryptosystems from Lattice Reduction Problems, May 1997.
- Collision-Free Hashing from Lattice Problems, July 1996.
O. Goldreich and A. Kahan,
How to Construct Constant-Round Zero-Knowledge Proof Systems for NP, March 1996.
R. Canetti, U. Feige, O. Goldreich and M. Naor,
Adaptively Secure Multi-party Computation, TR-682, LCS/MIT, 1996.
B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan,
Private Information Retrieval, 1995.
O. Goldreich and R. Ostrovsky,
Software Protection and Simulation on Oblivious RAMs, revised October 1995.
O. Goldreich, S. Goldwasser and N. Linial,
Fault-tolerant Computation in the Full Information Model, revised October 1995.
I. Damgard, O. Goldreich, T. Okamoto and A. Wigderson,
Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs (Extended Abstract), September 1995. See also partial version by Damgard, Goldreich, and Wigderson, November 1994.
O. Goldreich, L.A. Levin and N. Nisan , On Constructing 1-1 One-Way Functions, June 1995.
M. Bellare, O. Goldreich and S. Goldwasser, Incremental Cryptography, 1995.
O. Goldreich, N. Nisan and A. Wigderson, On Yao's XOR-Lemma, March 1995.
O. Goldreich and H. Krawczyk, On the Composition of Zero-Knowledge Proof Systems, revised 1994.
S. Even, O. Goldreich and S. Micali, On-Line/Off-Line Digital Signatures, revised 1994.
M. Ben-Or, R. Canetti and O. Goldreich, Asynchronous Secure Computation, 1993.
See Ran Canetti's PhD Thesis, 1995. (over 100 pages, 1.4M)
M. Bellare and O. Goldreich, On Defining Proofs of Knowledge, 1992.
See also our notes on Proofs of Computational Ability (1992).
O. Goldreich and Y. Oren, Definitions and properties of Zero-Knowledge proof systems, an old version (1992?).
O. Goldreich, Three XOR-Lemmas - An Exposition, July 1991.
O. Goldreich, A Uniform-Complexity Treatment of Encryption and Zero-Knowledge, July 1991.
O. Goldreich, R. Impagliazzo, L.A. Levin, R. Venkatesan and D. Zuckerman,
Security Preserving Amplification of Hardness, August 1990.
O. Goldreich and L.A. Levin, Hard-core Predicates for any One-way Function, 1989.
See Three XOR-Lemmas - An Exposition.
O. Goldreich, A Note on Computational Indistinguishability, 1989.
O. Goldreich and R. Vainish, How to Solve any Protocol Problem - An Efficiency Improvement, 1987.
O. Goldreich, S. Micali, and A. Wigderson, How to Solve any Protocol Problem, 1987.
O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing But their Validity or All Languages in NP have Zero-Knowledge Proofs, 1986.
O. Goldreich, Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme, 1986.
O. Goldreich and S. Micali, Increasing the Expansion of Pseudorandom Generators, 1984.
O. Goldreich, S. Goldwasser and S. Micali, How to Construct Random Functions, 1984.
S. Even and O. Goldreich, On the Security of Multi-Party Ping-Pong Protocols, 1983.

Back to Oded Goldreich's homepage or to General list of Oded Goldreich's papers