The Minimum-Length Generator Sequence Problem is NP-Hard. - Shimon Even; Oded Goldreich 001 (J. Algorithms, 1981)

On the Security of Multi-Party Ping-Pong Protocols. - Shimon Even; Oded Goldreich 001 (CRYPTO, 1982)

A Simple Protocol for Signing Contracts. - Oded Goldreich 001 (CRYPTO, 1983)

Electronic Wallet. - Shimon Even; Oded Goldreich 001 (CRYPTO, 1983)

DES-like functions can generate the alternating group. - Shimon Even; Oded Goldreich 001 (IEEE Trans. Inf. Theory, 1983)

RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. - Benny Chor; Oded Goldreich 001 (CRYPTO, 1984)

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

On the Number of Close-and-Equal Pairs of Bits in a String. - Oded Goldreich 001 (EUROCRYPT, 1984)

On Concurrent Identification Protocols. - Oded Goldreich 001 (EUROCRYPT, 1984)

RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure - Werner Alexi; Benny Chor; Oded Goldreich 001; Claus-Peter Schnorr (FOCS, 1984)

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

On the np-completeness of certain network testing problems. - Shimon Even; Oded Goldreich 001; Shlomo Moran; Po Tong (Networks, 1984)

Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865). - Shimon Even; Oded Goldreich 001 (IEEE Trans. Inf. Theory, 1984)

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

On the Security of Ping-Pong Protocols when Implemented using the RSA. - Shimon Even; Oded Goldreich 001; Adi Shamir (CRYPTO, 1985)

Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract) - Benny Chor; Oded Goldreich 001 (FOCS, 1985)

The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) - Benny Chor; Oded Goldreich 001; Johan Håstad; Joel Friedman; Steven Rudich; Roman Smolensky (FOCS, 1985)

A Fair Protocol for Signing Contracts (Extended Abstract). - Michael Ben-Or; Oded Goldreich 001; Silvio Micali; Ronald L. Rivest (ICALP, 1985)

A Randomized Protocol for Signing Contracts. - Shimon Even; Oded Goldreich 001; Abraham Lempel (Commun. ACM, 1985)

On the Power of Cascade Ciphers - Shimon Even; Oded Goldreich 001 (ACM Trans. Comput. Syst., 1985)

Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme. - Oded Goldreich 001 (CRYPTO, 1986)

Towards a Theory of Software Protection. - Oded Goldreich 001 (CRYPTO, 1986)

How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. - Oded Goldreich 001; Silvio Micali; Avi Wigderson (CRYPTO, 1986)

Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract) - Oded Goldreich 001; Silvio Micali; Avi Wigderson (FOCS, 1986)

Proofs that Release Minimum Knowledge. - Oded Goldreich 001; Silvio Micali; Avi Wigderson (MFCS, 1986)

The Effect of Link Failures on Computations in Asynchronous Rings. - Oded Goldreich 001; Liuba Shrira (PODC, 1986)

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

How to Solve any Protocol Problem - An Efficiency Improvement. - Oded Goldreich 001; Ronen Vainish (CRYPTO, 1987)

Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract) - Oded Goldreich 001; Yishay Mansour; Michael Sipser (FOCS, 1987)

On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization. - Reuven Bar-Yehuda; Oded Goldreich 001; Alon Itai (PODC, 1987)

Towards a Theory of Software Protection and Simulation by Oblivious RAMs - Oded Goldreich 001 (STOC, 1987)

How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority - Oded Goldreich 001; Silvio Micali; Avi Wigderson (STOC, 1987)

Electing a Leader in a Ring with Link Failures. - Oded Goldreich 001; Liuba Shrira (Acta Informatica, 1987)

A Tradeoff between Information and Communication in Broadcast Protocols. - Baruch Awerbuch; Oded Goldreich 001; David Peleg; Ronen Vainish (AWOC, 1988)

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)

A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm. - Oded Goldreich 001; Eyal Kushilevitz (CRYPTO, 1988)

On the Existence of Pseudorandom Generators (Extended Abstract) - Oded Goldreich 001; Hugo Krawczyk; Michael Luby (FOCS, 1988)

RSA and Rabin Functions: Certain Parts are as Hard as the Whole. - Werner Alexi; Benny Chor; Oded Goldreich 001; Claus-Peter Schnorr (SIAM J. Comput., 1988)

Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. - Benny Chor; Oded Goldreich 001 (SIAM J. Comput., 1988)

On the Theory of Average Case Complexity (abstract). - Shai Ben-David; Benny Chor; Oded Goldreich 001; Michael Luby (SCT, 1989)

On-Line/Off-Line Digital Schemes. - Shimon Even; Oded Goldreich 001; Silvio Micali (CRYPTO, 1989)

Source to Destination Communication in the Presence of Faults. - Oded Goldreich 001; Amir Herzberg; Yishay Mansour (PODC, 1989)

A Hard-Core Predicate for all One-Way Functions - Oded Goldreich 001; Leonid A. Levin (STOC, 1989)

On Completeness and Soundness in Interactive Proof Systems. - Martin Fürer; Oded Goldreich 001; Yishay Mansour; Michael Sipser; Stathis Zachos (Adv. Comput. Res., 1989)

On the power of two-point based sampling. - Benny Chor; Oded Goldreich 001 (J. Complex., 1989)

Simple Constructions of Almost k-Wise Independent Random Variables - Noga Alon; Oded Goldreich 001; Johan Håstad; René Peralta 001 (FOCS, 1990)

Security Preserving Amplification of Hardness - Oded Goldreich 001; Russell Impagliazzo; Leonid A. Levin; Ramarathnam Venkatesan; David Zuckerman (FOCS, 1990)

A Quantitative Approach to Dynamic Networks. - Baruch Awerbuch; Oded Goldreich 001; Amir Herzberg (PODC, 1990)

An Improved Parallel Algorithm for Integer GCD. - Benny Chor; Oded Goldreich 001 (Algorithmica, 1990)

On the number of monochromatic close pairs of beads in a rosary. - Oded Goldreich 001 (Discret. Math., 1990)

A Note on Computational Indistinguishability. - Oded Goldreich 001 (Inf. Process. Lett., 1990)

The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols. - Oded Goldreich 001; Erez Petrank (Inf. Process. Lett., 1990)

A fair protocol for signing contracts. - Michael Ben-Or; Oded Goldreich 001; Silvio Micali; Ronald L. Rivest (IEEE Trans. Inf. Theory, 1990)

A Trade-Off between Information and Communication in Broadcast Protocols - Baruch Awerbuch; Oded Goldreich 001; David Peleg; Ronen Vainish (J. ACM, 1990)

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

Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. - Reuven Bar-Yehuda; Oded Goldreich 001; Alon Itai (Distributed Comput., 1991)

On the Complexity of Computation in the Presence of Link Failures: The Case of a Ring. - Oded Goldreich 001; Liuba Shrira (Distributed Comput., 1991)

Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems. - Oded Goldreich 001; Silvio Micali; Avi Wigderson (J. ACM, 1991)

On Defining Proofs of Knowledge. - Mihir Bellare; Oded Goldreich 001 (CRYPTO, 1992)

Towards a Computational Theory of Statistical Tests (Extended Abstract) - Manuel Blum 001; Oded Goldreich 001 (FOCS, 1992)

On the Complexity of Global Computation in the Presence of Link Failures: The Case of Uni-Directional Faults. - Oded Goldreich 001; Dror Sneh (PODC, 1992)

Approximations of General Independent Distributions - Guy Even; Oded Goldreich 001; Michael Luby; Noam Nisan; Boban Velickovic (STOC, 1992)

On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization. - Reuven Bar-Yehuda; Oded Goldreich 001; Alon Itai (J. Comput. Syst. Sci., 1992)

On the Theory of Average Case Complexity. - Shai Ben-David; Benny Chor; Oded Goldreich 001; Michael Luby (J. Comput. Syst. Sci., 1992)

Simple Construction of Almost k-wise Independent Random Variables. - Noga Alon; Oded Goldreich 001; Johan Håstad; René Peralta 001 (Random Struct. Algorithms, 1992)

Sparse Pseudorandom Distributions. - Oded Goldreich 001; Hugo Krawczyk (Random Struct. Algorithms, 1992)

Critique of some trends in the TCS community in light of two controversies. - Oded Goldreich 001 (SIGACT News, 1992)

Asynchronous secure computation. - Michael Ben-Or; Ran Canetti; Oded Goldreich 001 (STOC, 1993)

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

Bounds on Tradeoffs Between Randomness and Communication Complexity. - Ran Canetti; Oded Goldreich 001 (Comput. Complex., 1993)

A Uniform-Complexity Treatment of Encryption and Zero-Knowledge. - Oded Goldreich 001 (J. Cryptol., 1993)

A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm. - Oded Goldreich 001; Eyal Kushilevitz (J. Cryptol., 1993)

Addendum to "Simple Construction of Almost k-wise Independent Random Variables". - Noga Alon; Oded Goldreich 001; Johan Håstad; René Peralta 001 (Random Struct. Algorithms, 1993)

On the Existence of Pseudorandom Generators. - Oded Goldreich 001; Hugo Krawczyk; Michael Luby (SIAM J. Comput., 1993)

A taxonomy of proof systems (part 1). - Oded Goldreich 001 (SIGACT News, 1993)

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

Computational complexity and knowledge complexity (extended abstract). - Oded Goldreich 001; Rafail Ostrovsky; Erez Petrank (STOC, 1994)

Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing. - Oded Goldreich 001; Avi Wigderson (STOC, 1994)

Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing - Oded Goldreich 001; Avi Wigderson (Electron. Colloquium Comput. Complex., 1994)

Probabilistic Proof Systems (A Survey) - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 1994)

The Random Oracle Hypothesis Is False. - Richard Chang 001; Benny Chor; Oded Goldreich 001; Juris Hartmanis; Johan Håstad; Desh Ranjan; Pankaj Rohatgi (J. Comput. Syst. Sci., 1994)

Definitions and Properties of Zero-Knowledge Proof Systems. - Oded Goldreich 001; Yair Oren (J. Cryptol., 1994)

A taxonomy of proof systems (part 2). - Oded Goldreich 001 (SIGACT News, 1994)

Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs. - Ivan Damgård; Oded Goldreich 001; Tatsuaki Okamoto; Avi Wigderson (CRYPTO, 1995)

Free Bits, PCPs and Non-Approximability - Towards Tight Results. - Mihir Bellare; Oded Goldreich 001; Madhu Sudan 001 (FOCS, 1995)

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

Free Bits, PCP and Non-Approximability - Towards Tight Results - Mihir Bellare; Oded Goldreich 001; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 1995)

On Constructing 1-1 One-Way Functions - Oded Goldreich 001; Leonid A. Levin; Noam Nisan (Electron. Colloquium Comput. Complex., 1995)

On Yao's XOR-Lemma - Oded Goldreich 001; Noam Nisan; Avi Wigderson (Electron. Colloquium Comput. Complex., 1995)

Three XOR-Lemmas - An Exposition - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 1995)

Lower Bounds for Sampling Algorithms for Estimating the Average. - Ran Canetti; Guy Even; Oded Goldreich 001 (Inf. Process. Lett., 1995)

Adaptively Secure Multi-Party Computation. - Ran Canetti; Uriel Feige; Oded Goldreich 001; Moni Naor (STOC, 1996)

Theory of Computing: A Scientific Perspective. - Oded Goldreich 001; Avi Wigderson (ACM Comput. Surv., 1996)

On the Message Complexity of Interactive Proof Systems - Oded Goldreich 001; Johan Håstad (Electron. Colloquium Comput. Complex., 1996)

On the Circuit Complexity of Perfect Hashing - Oded Goldreich 001; Avi Wigderson (Electron. Colloquium Comput. Complex., 1996)

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

A Combinatorial Consistency Lemma with application to the PCP Theorem - Oded Goldreich 001; Shmuel Safra (Electron. Colloquium Comput. Complex., 1996)

The Graph Clustering Problem has a Perfect Zero-Knowledge Proof. - Oded Goldreich 001 (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)

Software Protection and Simulation on Oblivious RAMs. - Oded Goldreich 001; Rafail Ostrovsky (J. ACM, 1996)

On-Line/Off-Line Digital Signatures. - Shimon Even; Oded Goldreich 001; Silvio Micali (J. Cryptol., 1996)

How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. - Oded Goldreich 001; Ariel Kahan (J. Cryptol., 1996)

On the Composition of Zero-Knowledge Proof Systems. - Oded Goldreich 001; Hugo Krawczyk (SIAM J. Comput., 1996)

The future of computational complexity theory: part I. - Christos H. Papadimitriou; Oded Goldreich 001; Avi Wigderson; Alexander A. Razborov; Michael Sipser (SIGACT News, 1996)

On the Foundations of Modern Cryptography. - Oded Goldreich 001 (CRYPTO, 1997)

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

A Sample of Samplers - A Computational Perspective on Sampling (survey). - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 1997)

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

Another proof that BPP subseteq PH (and more). - Oded Goldreich 001; David Zuckerman (Electron. Colloquium Comput. Complex., 1997)

Combinatorial Property Testing (a survey). - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 1997)

Notes on Levin's Theory of Average-Case Complexity. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 1997)

A Probabilistic Error-Correcting Scheme. - Scott E. Decatur; Oded Goldreich 001; Dana Ron (IACR Cryptol. ePrint Arch., 1997)

Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop. - Oded Goldreich 001; Birgit Pfitzmann; Ronald L. Rivest (IACR Cryptol. ePrint Arch., 1997)

On Universal Learning Algorithms. - Oded Goldreich 001; Dana Ron (Inf. Process. Lett., 1997)

Theory of computing: a scientific perspective (extended abstract). - Oded Goldreich 001; Avi Wigderson (SIGACT News, 1997)

Modern Cryptography, Probabilistic Proofs and Pseudorandomness. - Oded Goldreich 001 (Springer, 1998)

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

The Random Oracle Methodology, Revisited (Preliminary Version). - Ran Canetti; Oded Goldreich 001; Shai Halevi (STOC, 1998)

A Sublinear Bipartiteness Tester for Bunded Degree Graphs. - Oded Goldreich 001; Dana Ron (STOC, 1998)

Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge. - Oded Goldreich 001; Amit Sahai; Salil P. Vadhan (STOC, 1998)

The Graph Clustering Problem has a Perfect Zero-Knowledge Proof - Alfredo De Santis; Giovanni Di Crescenzo; Oded Goldreich 001; Giuseppe Persiano (Electron. Colloquium Comput. Complex., 1998)

Uniform Generation of NP-witnesses using an NP-oracle. - Mihir Bellare; Oded Goldreich 001; Erez Petrank (Electron. Colloquium Comput. Complex., 1998)

Learning Polynomials with Queries - The Highly Noisy Case. - Oded Goldreich 001; Ronitt Rubinfeld; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 1998)

Chinese Remaindering with Errors - Oded Goldreich 001; Dana Ron; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 1998)

Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK - Oded Goldreich 001; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 1998)

Deterministic Amplification of Space Bounded Probabilistic Algorithms. - Ziv Bar-Yossef; Oded Goldreich 001; Avi Wigderson (Electron. Colloquium Comput. Complex., 1998)

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

On the Complexity of Interactive Proofs with Bounded Communication. - Oded Goldreich 001; Johan Håstad (Inf. Process. Lett., 1998)

Private Information Retrieval. - Benny Chor; Eyal Kushilevitz; Oded Goldreich 001; Madhu Sudan 001 (J. ACM, 1998)

Efficient approximation of product distributions. - Guy Even; Oded Goldreich 001; Michael Luby; Noam Nisan; Boban Velickovic (Random Struct. Algorithms, 1998)

Free Bits, PCPs, and Nonapproximability-Towards Tight Results. - Mihir Bellare; Oded Goldreich 001; Madhu Sudan 001 (SIAM J. Comput., 1998)

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

Computational Complexity and Knowledge Complexity. - Oded Goldreich 001; Rafail Ostrovsky; Erez Petrank (SIAM J. Comput., 1998)

Computational Indistinguishability: Algorithms vs. Circuits. - Oded Goldreich 001; Bernd Meyer 005 (Theor. Comput. Sci., 1998)

Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier. - Mihir Bellare; Oded Goldreich 001; Hugo Krawczyk (CRYPTO, 1999)

Improved Derandomization of BPP Using a Hitting Set Generator. - Oded Goldreich 001; Avi Wigderson (RANDOM-APPROX, 1999)

Quantifying Knowledge Complexity. - Oded Goldreich 001; Erez Petrank (Comput. Complex., 1999)

A Sublinear Bipartiteness Tester for Bounded Degree Graphs. - Oded Goldreich 001; Dana Ron (Comb., 1999)

Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK - Oded Goldreich 001; Amit Sahai; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 1999)

Improved Testing Algorithms for Monotonicity. - Yevgeniy Dodis; Oded Goldreich 001; Eric Lehman; Sofya Raskhodnikova; Dana Ron; Alex Samorodnitsky (Electron. Colloquium Comput. Complex., 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)

Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors. - Oded Goldreich 001; Daniele Micciancio; Shmuel Safra; Jean-Pierre Seifert (Inf. Process. Lett., 1999)

The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof. - Alfredo De Santis; Giovanni Di Crescenzo; Oded Goldreich 001; Giuseppe Persiano (Inf. Process. Lett., 1999)

Computational Indistinguishability: A Sample Hierarchy. - Oded Goldreich 001; Madhu Sudan 001 (J. Comput. Syst. Sci., 1999)

Computational Sample Complexity. - Scott E. Decatur; Oded Goldreich 001; Dana Ron (SIAM J. Comput., 1999)

Pseudorandomness. - Oded Goldreich 001 (ICALP, 2000)

On Pseudorandomness with respect to Deterministic Observes. - Oded Goldreich 001; Avi Wigderson (ICALP Satellite Workshops, 2000)

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)

Simplified derandomization of BPP using a hitting set generator. - Oded Goldreich 001; Salil P. Vadhan; Avi Wigderson (Electron. Colloquium Comput. Complex., 2000)

On Testing Expansion in Bounded-Degree Graphs - Oded Goldreich 001; Dana Ron (Electron. Colloquium Comput. Complex., 2000)

On Pseudorandomness with respect to Deterministic Observers. - Oded Goldreich 001; Avi Wigderson (Electron. Colloquium Comput. Complex., 2000)

Candidate One-Way Functions Based on Expander Graphs - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2000)

On Security Preserving Reductions - Revised Terminology. - Oded Goldreich 001 (IACR Cryptol. ePrint Arch., 2000)

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

Preface. - Oded Goldreich 001 (J. Cryptol., 2000)

A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem. - Oded Goldreich 001; Shmuel Safra (SIAM J. Comput., 2000)

The Foundations of Cryptography - Volume 1: Basic Techniques. - Oded Goldreich 001 (Cambridge University Press, 2001)

Three Theorems regarding Testing Graph Properties. - Oded Goldreich 001; Luca Trevisan 001 (Electron. Colloquium Comput. Complex., 2001)

On the (Im)possibility of Obfuscating Programs - Boaz Barak; Oded Goldreich 001; Russell Impagliazzo; Steven Rudich; Amit Sahai; Salil P. Vadhan; Ke Yang 005 (Electron. Colloquium Comput. Complex., 2001)

Concurrent Zero-Knowledge With Timing, Revisited - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2001)

Using the FGLSS-reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2001)

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

Zero-Knowledge. - Oded Goldreich 001 (FOCS, 2002)

Property Testing in Bounded Degree Graphs. - Oded Goldreich 001; Dana Ron (Algorithmica, 2002)

On interactive proofs with a laconic prover. - Oded Goldreich 001; Salil P. Vadhan; Avi Wigderson (Comput. Complex., 2002)

Derandomization that is rarely wrong from short advice that is typically good - Oded Goldreich 001; Avi Wigderson (Electron. Colloquium Comput. Complex., 2002)

The GGM Construction does NOT yield Correlation Intractable Function Ensembles. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2002)

On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators - Oded Goldreich 001; Vered Rosen (Electron. Colloquium Comput. Complex., 2002)

Locally Testable Codes and PCPs of Almost-Linear Length - Oded Goldreich 001; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2002)

Zero-Knowledge twenty years after its invention - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2002)

On Chosen Ciphertext Security of Multiple Encryptions. - Oded Goldreich 001; Yoad Lustig; Moni Naor (IACR Cryptol. ePrint Arch., 2002)

Cryptography and cryptographic protocols. - Oded Goldreich 001 (Distributed Comput., 2003)

Bounds on 2-Query Codeword Testing. - Eli Ben-Sasson; Oded Goldreich 001; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2003)

On the random-oracle methodology as applied to length-restricted signature schemes. - Ran Canetti; Oded Goldreich 001; Shai Halevi (IACR Cryptol. ePrint Arch., 2003)

Almost k-wise independence versus k-wise independence. - Noga Alon; Oded Goldreich 001; Yishay Mansour (Inf. Process. Lett., 2003)

Preface to "Week Three: Randomness in Computation". - Oded Goldreich 001 (Computational Complexity Theory, 2004)

Pseudorandomness - Part I. - Oded Goldreich 001 (Computational Complexity Theory, 2004)

The Foundations of Cryptography - Volume 2: Basic Applications. - Oded Goldreich 001 (Cambridge University Press, 2004)

On Estimating the Average Degree of a Graph - Oded Goldreich 001; Dana Ron (Electron. Colloquium Comput. Complex., 2004)

From logarithmic advice to single-bit advice - Oded Goldreich 001; Madhu Sudan 001; Luca Trevisan 001 (Electron. Colloquium Comput. Complex., 2004)

The Power of Verification Queries in Message Authentication and Authenticated Encryption. - Mihir Bellare; Oded Goldreich 001; Anton Mityagin (IACR Cryptol. ePrint Arch., 2004)

The random oracle methodology, revisited. - Ran Canetti; Oded Goldreich 001; Shai Halevi (J. ACM, 2004)

Short PCPs Verifiable in Polylogarithmic Time. - Eli Ben-Sasson; Oded Goldreich 001; Prahladh Harsha; Madhu Sudan 001; Salil P. Vadhan (CCC, 2005)

Contemplations on Testing Graph Properties. - Oded Goldreich 001 (Sublinear Algorithms, 2005)

Short Locally Testable Codes and Proofs (Survey) - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2005)

On Promise Problems (a survey in memory of Shimon Even [1935-2004]) - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2005)

Approximating Average Parameters of Graphs. - Oded Goldreich 001; Dana Ron (Electron. Colloquium Comput. Complex., 2005)

Bravely, Moderately: A Common Theme in Four Recent Results - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2005)

Foundations of Cryptography - A Primer. - Oded Goldreich 001 (Found. Trends Theor. Comput. Sci., 2005)

On Promise Problems: A Survey. - Oded Goldreich 001 (Essays in Memory of Shimon Even, 2006)

On Teaching the Basics of Complexity Theory. - Oded Goldreich 001 (Essays in Memory of Shimon Even, 2006)

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

Lower bounds for linear locally decodable codes and private information retrieval. - Oded Goldreich 001; Howard J. Karloff; Leonard J. Schulman; Luca Trevisan 001 (Comput. Complex., 2006)

On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge. - Mihir Bellare; Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2006)

On Expected Probabilistic Polynomial-Time Adversaries – A suggestion for restricted definitions and their benefits. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2006)

On Post-Modern Cryptography. - Oded Goldreich 001 (IACR Cryptol. ePrint Arch., 2006)

Session-Key Generation Using Human Passwords Only. - Oded Goldreich 001; Yehuda Lindell (J. Cryptol., 2006)

Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. - Eli Ben-Sasson; Oded Goldreich 001; Prahladh Harsha; Madhu Sudan 001; Salil P. Vadhan (SIAM J. Comput., 2006)

Special Issue on Randomness and Complexity. - Oded Goldreich 001; Madhu Sudan 001 (SIAM J. Comput., 2006)

On Approximating the Average Distance Between Points. - Kfir Barhum; Oded Goldreich 001; Adi Shraibman (APPROX-RANDOM, 2007)

Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword. - Oded Goldreich 001; Salil P. Vadhan (Comput. Complex., 2007)

On the Average-Case Complexity of Property Testing. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2007)

Computational complexity - a conceptual perspective. - Oded Goldreich 001 (Cambridge University Press, 2008)

Preface to the Special Issue from Random'06. - Oded Goldreich 001 (Comput. Complex., 2008)

Probabilistic Proof Systems: A Primer. - Oded Goldreich 001 (Found. Trends Theor. Comput. Sci., 2008)

Universal Arguments and their Applications. - Boaz Barak; Oded Goldreich 001 (SIAM J. Comput., 2008)

Computational complexity: a conceptual perspective. - Oded Goldreich 001 (SIGACT News, 2008)

From absolute distinguishability to positive distinguishability. - Zvika Brakerski; Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2009)

A Candidate Counterexample to the Easy Cylinders Conjecture. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2009)

A Theory of Goal-Oriented Communication. - Oded Goldreich 001; Brendan Juba; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2009)

On our duties as scientists. - Oded Goldreich 001 (SIGACT News, 2009)

P, NP, and NP-Completeness: The Basics of Complexity Theory. - Oded Goldreich 001 (Cambridge University Press, 2010)

A Brief Introduction to Property Testing. - Oded Goldreich 001 (Property Testing, 2010)

The Program of the Mini-Workshop. - Oded Goldreich 001 (Property Testing, 2010)

Short Locally Testable Codes and Proofs: A Survey in Two Parts. - Oded Goldreich 001 (Property Testing, 2010)

Introduction to Testing Graph Properties. - Oded Goldreich 001 (Property Testing, 2010)

Hierarchy Theorems for Property Testing. - Oded Goldreich 001; Michael Krivelevich; Ilan Newman; Eyal Rozenberg (Property Testing, 2010)

Algorithmic Aspects of Property Testing in the Dense Graphs Model. - Oded Goldreich 001; Dana Ron (Property Testing, 2010)

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

On The Randomness Complexity of Property Testing. - Oded Goldreich 001; Or Sheffet (Comput. Complex., 2010)

On Testing Computability by Small Width OBDDs. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2010)

Introduction to Testing Graph Properties. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2010)

In a World of P=BPP. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2010)

Proximity Oblivious Testing and the Role of Invariances. - Oded Goldreich 001; Tali Kaufman (Electron. Colloquium Comput. Complex., 2010)

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

Testing Graph Blow-Up. - Lidor Avigad; Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Proving Computational Ability. - Mihir Bellare; Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge. - Mihir Bellare; Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

From Absolute Distinguishability to Positive Distinguishability. - Zvika Brakerski; Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Strong Proofs of Knowledge. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Candidate One-Way Functions Based on Expander Graphs. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

The GGM Construction Does NOT Yield Correlation Intractable Function Ensembles. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

On the Average-Case Complexity of Property Testing. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

A Candidate Counterexample to the Easy Cylinders Conjecture. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

In a World of P=BPP. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Notes on Levin's Theory of Average-Case Complexity. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Three XOR-Lemmas - An Exposition. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

A Sample of Samplers: A Computational Perspective on Sampling. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Short Locally Testable Codes and Proofs. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Bravely, Moderately: A Common Theme in Four Recent Works. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Average Case Complexity, Revisited. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Basic Facts about Expander Graphs. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

A Brief Introduction to Property Testing. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Introduction to Testing Graph Properties. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Randomness and Computation. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

On Security Preserving Reductions - Revised Terminology. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Contemplations on Testing Graph Properties. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Another Motivation for Reducing the Randomness Complexity of Algorithms. - Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

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

Proximity Oblivious Testing and the Role of Invariances. - Oded Goldreich 001; Tali Kaufman (Studies in Complexity and Cryptography, 2011)

On Constructing 1-1 One-Way Functions. - Oded Goldreich 001; Leonid A. Levin; Noam Nisan (Studies in Complexity and Cryptography, 2011)

On Yao's XOR-Lemma. - Oded Goldreich 001; Noam Nisan; Avi Wigderson (Studies in Complexity and Cryptography, 2011)

On Testing Expansion in Bounded-Degree Graphs. - Oded Goldreich 001; Dana Ron (Studies in Complexity and Cryptography, 2011)

From Logarithmic Advice to Single-Bit Advice. - Oded Goldreich 001; Madhu Sudan 001; Luca Trevisan 001 (Studies in Complexity and Cryptography, 2011)

On the Complexity of Computational Problems Regarding Distributions. - Oded Goldreich 001; Salil P. Vadhan (Studies in Complexity and Cryptography, 2011)

Simplified Derandomization of BPP Using a Hitting Set Generator. - Oded Goldreich 001; Salil P. Vadhan; Avi Wigderson (Studies in Complexity and Cryptography, 2011)

On the Circuit Complexity of Perfect Hashing. - Oded Goldreich 001; Avi Wigderson (Studies in Complexity and Cryptography, 2011)

Another Proof That BPP Í PH mathcal{BPP} subseteq mathcal{PH} (and More). - Oded Goldreich 001; David Zuckerman (Studies in Complexity and Cryptography, 2011)

Testing Graph Blow-Up. - Lidor Avigad; Oded Goldreich 001 (APPROX-RANDOM, 2011)

Two Comments on Targeted Canonical Derandomizers. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2011)

Monotone Circuits: One-Way Functions versus Pseudorandom Generators. - Oded Goldreich 001; Rani Izsak (Electron. Colloquium Comput. Complex., 2011)

Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly. - Oded Goldreich 001; Or Meir (Electron. Colloquium Comput. Complex., 2011)

Enhancements of Trapdoor Permutations. - Oded Goldreich 001; Ron Rothblum (Electron. Colloquium Comput. Complex., 2011)

On the complexity of computational problems regarding distributions (a survey). - Oded Goldreich 001; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2011)

Algorithmic Aspects of Property Testing in the Dense Graphs Model. - Oded Goldreich 001; Dana Ron (SIAM J. Comput., 2011)

On Proximity-Oblivious Testing. - Oded Goldreich 001; Dana Ron (SIAM J. Comput., 2011)

Two-Sided Error Proximity Oblivious Testing - (Extended Abstract). - Oded Goldreich 001; Igor Shinkar (APPROX-RANDOM, 2012)

Hierarchy Theorems for Property Testing. - Oded Goldreich 001; Michael Krivelevich; Ilan Newman; Eyal Rozenberg (Comput. Complex., 2012)

Special issue from RANDOM'09: Editors' Foreword. - Oded Goldreich 001; Salil P. Vadhan (Comput. Complex., 2012)

Invitation to complexity theory. - Oded Goldreich 001 (XRDS, 2012)

Finding Cycles and Trees in Sublinear Time. - Artur Czumaj; Oded Goldreich 001; Dana Ron; C. Seshadhri 001; Asaf Shapira; Christian Sohler (Electron. Colloquium Comput. Complex., 2012)

On the Effect of the Proximity Parameter on Property Testers. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2012)

Two-Sided Error Proximity Oblivious Testing. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2012)

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

The tensor product of two good codes is not necessarily robustly testable. - Oded Goldreich 001; Or Meir (Inf. Process. Lett., 2012)

On struggle and competition in scientic fields. - Oded Goldreich 001 (SIGACT News, 2012)

On intellectual and instrumental values in science. - Oded Goldreich 001 (SIGACT News, 2012)

On Multiple Input Problems in Property Testing. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2013)

On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2013)

On Sample-Based Testers. - Oded Goldreich 001; Dana Ron (Electron. Colloquium Comput. Complex., 2013)

On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions. - Oded Goldreich 001; Avi Wigderson (Electron. Colloquium Comput. Complex., 2013)

On Derandomizing Algorithms that Err Extremely Rarely. - Oded Goldreich 001; Avi Wigderson (Electron. Colloquium Comput. Complex., 2013)

More Constructions of Lossy and Correlation-Secure Trapdoor Functions. - David Mandell Freeman; Oded Goldreich 001; Eike Kiltz; Alon Rosen; Gil Segev 001 (J. Cryptol., 2013)

General Cryptographic Protocols: The Very Basics. - Oded Goldreich 001 (Secure Multi-Party Computation, 2013)

A Short Tutorial of Zero-Knowledge. - Oded Goldreich 001 (Secure Multi-Party Computation, 2013)

Strong Locally Testable Codes with Relaxed Local Decoders. - Oded Goldreich 001; Tom Gur; Ilan Komargodski (Electron. Colloquium Comput. Complex., 2014)

On Learning and Testing Dynamic Environments. - Oded Goldreich 001; Dana Ron (Electron. Colloquium Comput. Complex., 2014)

Super-Perfect Zero-Knowledge Proofs. - Oded Goldreich 001; Liav Teichner (Electron. Colloquium Comput. Complex., 2014)

Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs - (Extended Abstract). - Oded Goldreich 001; Tom Gur; Ron D. Rothblum (ICALP (1), 2015)

Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs. - Oded Goldreich 001; Tom Gur; Ron Rothblum (Electron. Colloquium Comput. Complex., 2015)

On Randomness Extraction in AC0. - Oded Goldreich 001; Emanuele Viola; Avi Wigderson (Electron. Colloquium Comput. Complex., 2015)

Special Issue on the 10th Theory of Cryptography Conference: Editor's Foreword. - Oded Goldreich 001 (Comput. Complex., 2016)

The uniform distribution is complete with respect to testing identity to a fixed distribution. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2016)

On Emulating Interactive Proofs with Public Coins. - Oded Goldreich 001; Maya Leshkowitz (Electron. Colloquium Comput. Complex., 2016)

Reducing testing affine spaces to testing linearity. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2016)

Deconstructing 1-local expanders. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2016)

Two-sided error proximity oblivious testing. - Oded Goldreich 001; Igor Shinkar (Random Struct. Algorithms, 2016)

Estimating Simple Graph Parameters in Sublinear Time. - Oded Goldreich 001; Dana Ron (Encyclopedia of Algorithms, 2016)

Testing Bipartiteness in the Dense-Graph Model. - Oded Goldreich 001; Dana Ron (Encyclopedia of Algorithms, 2016)

Testing Bipartiteness of Graphs in Sublinear Time. - Oded Goldreich 001; Dana Ron (Encyclopedia of Algorithms, 2016)

Introduction to Property Testing. - Oded Goldreich 001 (Cambridge University Press, 2017)

On the doubly-efficient interactive proof systems of GKR. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2017)

Overview of the doubly-efficient interactive proof systems of RRR. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2017)

Simple doubly-efficient interactive proof systems for locally-characterizable sets. - Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2017)

Worst-case to Average-case reductions for subclasses of P. - Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2017)

On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions. - Oded Goldreich 001; Avishay Tal (Electron. Colloquium Comput. Complex., 2017)

Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems. - Oded Goldreich 001; Guy N. Rothblum (FOCS, 2018)

Matrix rigidity of random Toeplitz matrices. - Oded Goldreich 001; Avishay Tal (Comput. Complex., 2018)

Universal Locally Testable Codes. - Oded Goldreich 001; Tom Gur (Chic. J. Theor. Comput. Sci., 2018)

Every set in P is strongly testable under a suitable encoding. - Irit Dinur; Oded Goldreich 001; Tom Gur (Electron. Colloquium Comput. Complex., 2018)

Flexible models for testing graph properties. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2018)

Testing Graphs in Vertex-Distribution-Free Models. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2018)

The Subgraph Testing Model. - Oded Goldreich 001; Dana Ron (Electron. Colloquium Comput. Complex., 2018)

Counting t-cliques: Worst-case to average-case reductions and Direct interactive proof systems. - Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2018)

Constant-round interactive proof systems for AC0[2] and NC1. - Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2018)

On Doubly-Efficient Interactive Proof Systems. - Oded Goldreich 001 (Found. Trends Theor. Comput. Sci., 2018)

Preface. - Oded Goldreich 001 (Providing Sound Foundations for Cryptography, 2019)

On the foundations of cryptography. - Oded Goldreich 001 (Providing Sound Foundations for Cryptography, 2019)

On the impact of cryptography on complexity theory. - Oded Goldreich 001 (Providing Sound Foundations for Cryptography, 2019)

On some noncryptographic works of Goldwasser and Micali. - Oded Goldreich 001 (Providing Sound Foundations for Cryptography, 2019)

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

Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. - Oded Goldreich 001; Silvio Micali; Avi Wigderson (Providing Sound Foundations for Cryptography, 2019)

How to play any mental game, or a completeness theorem for protocols with honest majority. - Oded Goldreich 001; Silvio Micali; Avi Wigderson (Providing Sound Foundations for Cryptography, 2019)

Hierarchy Theorems for Testing Properties in Size-Oblivious Query Complexity. - Oded Goldreich 001 (Comput. Complex., 2019)

Testing Bipartitness in an Augmented VDF Bounded-Degree Graph Model. - Oded Goldreich 001 (CoRR, 2019)

Randomness Extraction from Somewhat Dependent Sources. - Marshall Ball; Oded Goldreich 001; Tal Malkin (Electron. Colloquium Comput. Complex., 2019)

Pseudo-Mixing Time of Random Walks. - Itai Benjamini; Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2019)

Multi-pseudodeterministic algorithms. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2019)

On the Complexity of Estimating the Effective Support Size. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2019)

Testing Isomorphism in the Bounded-Degree Graph Model. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2019)

Improved bounds on the AN-complexity of multilinear functions. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2019)

Communication Complexity with Defective Randomness. - Marshall Ball; Oded Goldreich 001; Tal Malkin (Electron. Colloquium Comput. Complex., 2020)

On Counting $t$-Cliques Mod 2. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2020)

On Testing Hamiltonicity in the Bounded Degree Graph Model. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2020)

On Testing Asymmetry in the Bounded Degree Graph Model. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2020)

One-Sided Error Testing of Monomials and Affine Subspaces. - Oded Goldreich 001; Dana Ron (Electron. Colloquium Comput. Complex., 2020)

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. - Oded Goldreich 001; Avi Wigderson (Electron. Colloquium Comput. Complex., 2020)

Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model. - Oded Goldreich 001; Avi Wigderson (Electron. Colloquium Comput. Complex., 2020)

Constructing Large Families of Pairwise Far Permutations: Good Permutation Codes Based on the Shuffle-Exchange Network. - Oded Goldreich 001; Avi Wigderson (Electron. Colloquium Comput. Complex., 2020)

On (Valiant's) Polynomial-Size Monotone Formula for Majority. - Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

Two Comments on Targeted Canonical Derandomizers. - Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

On the Effect of the Proximity Parameter on Property Testers. - Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing. - Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed Distribution. - Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

Reducing Testing Affine Spaces to Testing Linearity of Functions. - Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

Deconstructing 1-Local Expanders. - Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

On the Optimal Analysis of the Collision Probability Tester (an Exposition). - Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

Flexible Models for Testing Graph Properties. - Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

On Constructing Expanders for Any Number of Vertices. - Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

On Emulating Interactive Proofs with Public Coins. - Oded Goldreich 001; Maya Leshkowitz (Computational Complexity and Property Testing, 2020)

Bridging a Small Gap in the Gap Amplification of Assignment Testers. - Oded Goldreich 001; Or Meir (Computational Complexity and Property Testing, 2020)

On the Relation Between the Relative Earth Mover Distance and the Variation Distance (an Exposition). - Oded Goldreich 001; Dana Ron (Computational Complexity and Property Testing, 2020)

Worst-Case to Average-Case Reductions for Subclasses of P. - Oded Goldreich 001; Guy N. Rothblum (Computational Complexity and Property Testing, 2020)

Constant-Round Interactive Proof Systems for AC0[2] and NC1. - Oded Goldreich 001; Guy N. Rothblum (Computational Complexity and Property Testing, 2020)

Super-Perfect Zero-Knowledge Proofs. - Oded Goldreich 001; Liav Teichner (Computational Complexity and Property Testing, 2020)

On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions. - Oded Goldreich 001; Avishay Tal (Computational Complexity and Property Testing, 2020)

On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions. - Oded Goldreich 001; Avi Wigderson (Computational Complexity and Property Testing, 2020)

Pseudo-mixing Time of Random Walks. - Itai Benjamini; Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy. - Scott E. Decatur; Oded Goldreich 001; Dana Ron (Computational Complexity and Property Testing, 2020)

Robust Self-Ordering versus Local Self-Ordering. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2021)

Open Problems in Property Testing of Graphs. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2021)

On the Locally Testable Code of Dinur et al. (2021). - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2021)

The KW Games as a Teaser. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2021)

Testing Distributions of Huge Objects. - Oded Goldreich 001; Dana Ron (Electron. Colloquium Comput. Complex., 2021)

Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP. - Oded Goldreich 001; Tom Gur (Theor. Comput. Sci., 2021)

Improved bounds on the AN-complexity of O(1)-linear functions. - Oded Goldreich 001 (Comput. Complex., 2022)

On Interactive Proofs of Proximity with Proof-Oblivious Queries. - Oded Goldreich 001; Guy N. Rothblum; Tal Skverer (Electron. Colloquium Comput. Complex., 2022)

Testing in the bounded-degree graph model with degree bound two. - Oded Goldreich 001; Laliv Tauber (Electron. Colloquium Comput. Complex., 2022)

On properties that are non-trivial to test. - Nader H. Bshouty; Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2022)

On teaching the approximation method for circuit lower bounds. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2023)

On the Lower Bound on the Length of Relaxed Locally Decodable Codes. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2023)

On the complexity of enumerating ordered sets. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2023)

On coarse and fine approximate counting of t-cliques. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2023)

On Testing Isomorphism to a Fixed Graph in the Bounded-Degree Graph Model. - Oded Goldreich 001; Laliv Tauber (Electron. Colloquium Comput. Complex., 2023)

On Testing Group Properties. - Oded Goldreich 001; Laliv Tauber (Electron. Colloquium Comput. Complex., 2023)

A Lower Bound on the Complexity of Testing Grained Distributions. - Oded Goldreich 001; Dana Ron (Comput. Complex., 2023)

On locally-characterized expander graphs (a survey). - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2024)

On the query complexity of testing local graph properties in the bounded-degree graph model. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2024)

On the relaxed LDC of BGHSV: A survey that corrects the record. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2024)

On the Cook-Mertz Tree Evaluation procedure. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2024)

Solving Tree Evaluation in o(log n · log log n) space. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2024)

On defining PPT-search problems. - Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2024)

Doubly Sub-linear Interactive Proofs of Proximity. - Noga Amir; Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2024)

Location-Invariant Properties of Functions versus Properties of Distributions: United in Testing but Separated in Verification. - Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2025)

Complexity theoretic implications of pseudodeterministic algorithms for PPT-search problems. - Oded Goldreich 001; Roei Tell (Electron. Colloquium Comput. Complex., 2025)

On Defining PPT-Search Problems. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

Multi-pseudodeterministic Algorithms. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On Counting t-Cliques Mod 2. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On Coarse and Fine Approximate Counting of t-Cliques. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On the Complexity of Enumerating Ordered Sets. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On the Cook-Mertz Tree Evaluation Procedure. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

Solving Tree Evaluation in o(log n · log log n) Space. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On Parallel Repetition of Interactive Proof Systems. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On Locally-Characterized Expander Graphs (A Survey). - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On the Locally Testable Code of Dinur et al. (2021). - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On the Lower Bound on the Length of Relaxed Locally Decodable Codes. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On the Relaxed LDC of BGHSV: A Survey that Corrects the Record. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On the Complexity of Estimating the Effective Support Size. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

Robust Self-ordering Versus Local Self-ordering. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On Testing Hamiltonicity in the Bounded Degree Graph Model. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

Testing Isomorphism in the Bounded-Degree Graph Model. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On Testing Asymmetry in the Bounded Degree Graph Model. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On the Query Complexity of Testing Local Graph Properties in the Bounded-Degree Graph Model. - Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

One-Sided Error Testing of Monomials and Affine Subspaces. - Oded Goldreich 001; Dana Ron (Computational Complexity and Local Algorithms, 2025)

On Testing Isomorphism to a Fixed Graph in the Bounded-Degree Graph Model. - Oded Goldreich 001; Laliv Tauber (Computational Complexity and Local Algorithms, 2025)

Testing in the Bounded-Degree Graph Model with Degree Bound Two. - Oded Goldreich 001; Laliv Tauber (Computational Complexity and Local Algorithms, 2025)

On Testing Group Properties. - Oded Goldreich 001; Laliv Tauber (Computational Complexity and Local Algorithms, 2025)

On Properties that are Non-trivial to Test. - Nader H. Bshouty; Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)