| 2021 | FOCS | Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model. | Oded Goldreich, Avi Wigderson |
| 2020 | EDBT | Diverse User Selection for Opinion Procurement. | Yael Amsterdamer, Oded Goldreich |
| 2019 | STOC | Testing graphs in vertex-distribution-free models. | Oded Goldreich |
| 2018 | FOCS | Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems. | Oded Goldreich, Guy N. Rothblum |
| 2017 | CIKM | PODIUM: Procuring Opinions from Diverse Users in a Multi-Dimensional World. | Yael Amsterdamer, Oded Goldreich |
| 2016 | STOC | Matrix rigidity of random toeplitz matrices. | Oded Goldreich, Avishay Tal |
| 2015 | ICALP | Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs - (Extended Abstract). | Oded Goldreich, Tom Gur, Ron D. Rothblum |
| 2014 | FOCS | On Learning and Testing Dynamic Environments. | Oded Goldreich, Dana Ron |
| 2014 | STOC | On derandomizing algorithms that err extremely rarely. | Oded Goldreich, Avi Wigderson |
| 2011 | PODC | A theory of goal-oriented communication. | Oded Goldreich, Brendan Juba, Madhu Sudan |
| 2010 | PKC | More Constructions of Lossy and Correlation-Secure Trapdoor Functions. | David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev |
| 2010 | STOC | Erratum for: on basing one-way functions on NP-hardness. | Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz |
| 2009 | STOC | On proximity oblivious testing. | Oded Goldreich, Dana Ron |
| 2007 | TCC | On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits. | Oded Goldreich |
| 2006 | STOC | On basing one-way functions on NP-hardness. | Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz |
| 2004 | STOC | Robust pcps of proximity, shorter pcps and applications to coding. | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
| 2004 | TCC | On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes. | Ran Canetti, Oded Goldreich, Shai Halevi |
| 2003 | FOCS | On the Implementation of Huge Random Objects. | Oded Goldreich, Shafi Goldwasser, Asaf Nussboim |
| 2002 | FOCS | Zero-Knowledge. | Oded Goldreich |
| 2002 | FOCS | Locally Testable Codes and PCPs of Almost-Linear Length. | Oded Goldreich, Madhu Sudan |
| 2002 | STOC | Concurrent zero-knowledge with timing, revisited. | Oded Goldreich |
| 2001 | CRYPTO | On the (Im)possibility of Obfuscating Programs. | Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang |
| 2001 | CRYPTO | Session-Key Generation Using Human Passwords Only. | Oded Goldreich, Yehuda Lindell |
| 2001 | FOCS | Resettably-Sound Zero-Knowledge and its Applications. | Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell |
| 2001 | FOCS | Three Theorems Regarding Testing Graph Properties. | Oded Goldreich, Luca Trevisan |
| 2001 | ICALP | On Interactive Proofs with a Laconic Prover. | Oded Goldreich, Salil P. Vadhan, Avi Wigderson |
| 2000 | ICALP | Pseudorandomness. | Oded Goldreich |
| 2000 | ICALP | On Pseudorandomness with respect to Deterministic Observes. | Oded Goldreich, Avi Wigderson |
| 2000 | STOC | Resettable zero-knowledge (extended abstract). | Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali |
| 1999 | CRYPTO | Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier. | Mihir Bellare, Oded Goldreich, Hugo Krawczyk |
| 1999 | CRYPTO | Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK. | Oded Goldreich, Amit Sahai, Salil P. Vadhan |
| 1999 | STOC | Chinese Remaindering with Errors. | Oded Goldreich, Dana Ron, Madhu Sudan |
| 1998 | CRYPTO | Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop. | Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest |
| 1998 | FOCS | Testing Monotonicity. | Oded Goldreich, Shafi Goldwasser, Eric P. Lehman, Dana Ron |
| 1998 | STOC | The Random Oracle Methodology, Revisited (Preliminary Version). | Ran Canetti, Oded Goldreich, Shai Halevi |
| 1998 | STOC | On the Limits of Non-Approximability of Lattice Problems. | Oded Goldreich, Shafi Goldwasser |
| 1998 | STOC | A Sublinear Bipartiteness Tester for Bunded Degree Graphs. | Oded Goldreich, Dana Ron |
| 1998 | STOC | Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge. | Oded Goldreich, Amit Sahai, Salil P. Vadhan |
| 1997 | COLT | Computational Sample Complexity. | Scott E. Decatur, Oded Goldreich, Dana Ron |
| 1997 | CRYPTO | On the Foundations of Modern Cryptography. | Oded Goldreich |
| 1997 | CRYPTO | Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem. | Oded Goldreich, Shafi Goldwasser, Shai Halevi |
| 1997 | CRYPTO | Public-Key Cryptosystems from Lattice Reduction Problems. | Oded Goldreich, Shafi Goldwasser, Shai Halevi |
| 1997 | STOC | Property Testing in Bounded Degree Graphs. | Oded Goldreich, Dana Ron |
| 1997 | STACS | Probabilistic Proof Systems - A Survey. | Oded Goldreich |
| 1996 | FOCS | Property Testing and Its Connection to Learning and Approximation. | Oded Goldreich, Shafi Goldwasser, Dana Ron |
| 1996 | STOC | Adaptively Secure Multi-Party Computation. | Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor |
| 1995 | CRYPTO | Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs. | Ivan Damgrd, Oded Goldreich, Tatsuaki Okamoto, Avi Wigderson |
| 1995 | FOCS | Free Bits, PCPs and Non-Approximability - Towards Tight Results. | Mihir Bellare, Oded Goldreich, Madhu Sudan |
| 1995 | FOCS | Private Information Retrieval. | Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan |
| 1995 | FOCS | Learning Polynomials with Queries: The Highly Noisy Case. | Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan |
| 1995 | STOC | Incremental cryptography and application to virus protection. | Mihir Bellare, Oded Goldreich, Shafi Goldwasser |
| 1994 | CRYPTO | Incremental Cryptography: The Case of Hashing and Signing. | Mihir Bellare, Oded Goldreich, Shafi Goldwasser |
| 1994 | STOC | Computational complexity and knowledge complexity (extended abstract). | Oded Goldreich, Rafail Ostrovsky, Erez Petrank |
| 1994 | STOC | Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing. | Oded Goldreich, Avi Wigderson |
| 1993 | STOC | Asynchronous secure computation. | Michael Ben-Or, Ran Canetti, Oded Goldreich |
| 1992 | CRYPTO | On Defining Proofs of Knowledge. | Mihir Bellare, Oded Goldreich |
| 1992 | FOCS | Towards a Computational Theory of Statistical Tests (Extended Abstract) | Manuel Blum, Oded Goldreich |
| 1992 | PODC | On the Complexity of Global Computation in the Presence of Link Failures: The Case of Uni-Directional Faults. | Oded Goldreich, Dror Sneh |
| 1992 | STOC | Approximations of General Independent Distributions | Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic |
| 1991 | FOCS | Fault-tolerant Computation in the Full Information Model (Extended Abstract) | Oded Goldreich, Shafi Goldwasser, Nathan Linial |
| 1991 | FOCS | Quantifying Knowledge Complexity | Oded Goldreich, Erez Petrank |
| 1990 | FOCS | Simple Constructions of Almost k-Wise Independent Random Variables | Noga Alon, Oded Goldreich, Johan Hstad, Ren Peralta |
| 1990 | FOCS | Randomness in Interactive Proofs | Mihir Bellare, Oded Goldreich, Shafi Goldwasser |
| 1990 | FOCS | Bounds on Tradeoffs between Randomness and Communication Complexity | Ran Canetti, Oded Goldreich |
| 1990 | FOCS | Security Preserving Amplification of Hardness | Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman |
| 1990 | ICALP | On the Composition of Zero-Knowledge Proof Systems. | Oded Goldreich, Hugo Krawczyk |
| 1990 | PODC | A Quantitative Approach to Dynamic Networks. | Baruch Awerbuch, Oded Goldreich, Amir Herzberg |
| 1989 | CRYPTO | On-Line/Off-Line Digital Schemes. | Shimon Even, Oded Goldreich, Silvio Micali |
| 1989 | CRYPTO | Sparse Pseudorandom Distributions. | Oded Goldreich, Hugo Krawczyk |
| 1989 | PODC | Source to Destination Communication in the Presence of Faults. | Oded Goldreich, Amir Herzberg, Yishay Mansour |
| 1989 | STOC | On the Theory of Average Case Complexity | Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby |
| 1989 | STOC | A Hard-Core Predicate for all One-Way Functions | Oded Goldreich, Leonid A. Levin |
| 1988 | CRYPTO | Everything Provable is Provable in Zero-Knowledge. | Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Hstad, Joe Kilian, Silvio Micali, Phillip Rogaway |
| 1988 | CRYPTO | A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm. | Oded Goldreich, Eyal Kushilevitz |
| 1988 | CRYPTO | On the Existence of Pseudorandom Generators. | Oded Goldreich, Hugo Krawczyk, Michael Luby |
| 1988 | FOCS | On the Existence of Pseudorandom Generators (Extended Abstract) | Oded Goldreich, Hugo Krawczyk, Michael Luby |
| 1987 | CRYPTO | How to Solve any Protocol Problem - An Efficiency Improvement. | Oded Goldreich, Ronen Vainish |
| 1987 | FOCS | Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract) | Oded Goldreich, Yishay Mansour, Michael Sipser |
| 1987 | PODC | On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization. | Reuven Bar-Yehuda, Oded Goldreich, Alon Itai |
| 1987 | STOC | Towards a Theory of Software Protection and Simulation by Oblivious RAMs | Oded Goldreich |
| 1987 | STOC | How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority | Oded Goldreich, Silvio Micali, Avi Wigderson |
| 1986 | CRYPTO | Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme. | Oded Goldreich |
| 1986 | CRYPTO | Towards a Theory of Software Protection. | Oded Goldreich |
| 1986 | CRYPTO | How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. | Oded Goldreich, Silvio Micali, Avi Wigderson |
| 1986 | FOCS | Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract) | Oded Goldreich, Silvio Micali, Avi Wigderson |
| 1986 | MFCS | Proofs that Release Minimum Knowledge. | Oded Goldreich, Silvio Micali, Avi Wigderson |
| 1986 | PODC | The Effect of Link Failures on Computations in Asynchronous Rings. | Oded Goldreich, Liuba Shrira |
| 1985 | CRYPTO | The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. | Benny Chor, Oded Goldreich, Shafi Goldwasser |
| 1985 | CRYPTO | On the Security of Ping-Pong Protocols when Implemented using the RSA. | Shimon Even, Oded Goldreich, Adi Shamir |
| 1985 | FOCS | Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract) | Benny Chor, Oded Goldreich |
| 1985 | FOCS | The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) | Benny Chor, Oded Goldreich, Johan Hstad, Joel Friedman, Steven Rudich, Roman Smolensky |
| 1985 | ICALP | A Fair Protocol for Signing Contracts (Extended Abstract). | Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest |
| 1984 | CRYPTO | RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. | Benny Chor, Oded Goldreich |
| 1984 | CRYPTO | On the Cryptographic Applications of Random Functions. | Oded Goldreich, Shafi Goldwasser, Silvio Micali |
| 1984 | EuroCrypt | On the Number of Close-and-Equal Pairs of Bits in a String. | Oded Goldreich |
| 1984 | EuroCrypt | On Concurrent Identification Protocols. | Oded Goldreich |
| 1984 | FOCS | RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure | Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr |
| 1984 | FOCS | How to Construct Random Functions (Extended Abstract) | Oded Goldreich, Shafi Goldwasser, Silvio Micali |
| 1983 | CRYPTO | A Simple Protocol for Signing Contracts. | Oded Goldreich |
| 1983 | CRYPTO | On the Power of Cascade Ciphers. | Shimon Even, Oded Goldreich |
| 1983 | CRYPTO | Electronic Wallet. | Shimon Even, Oded Goldreich |
| 1983 | FOCS | On the Security of Multi-Party Ping-Pong Protocols | Shimon Even, Oded Goldreich |
| 1982 | CRYPTO | On the Security of Multi-Party Ping-Pong Protocols. | Shimon Even, Oded Goldreich |
| 1982 | CRYPTO | A Randomized Protocol for Signing Contracts. | Shimon Even, Oded Goldreich, Abraham Lempel |