Goldreich, Oded - Department of Computer Science and Applied Mathematics, Weizmann Institute of Science

Advanced Search

Goldreich, Oded - Department of Computer Science and Applied Mathematics, Weizmann Institute of Science

Testing Graph Blow-Up Lidor Avigad and Oded Goldreich
Using the FGLSSreduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs
Texts in Computational Complexity: A Brief Overview
Quantitative Analysis of Dynamic Network Protocols \Lambda
The Random Oracle Hypothesis is False Richard Chang 1;2 Benny Chor 3;4 Oded Goldreich 3;5
Faulttolerant Computation in the Full Information Model \Lambda Oded Goldreich y Shafi Goldwasser z Nathan Linial x
Foundations of Cryptography Class Notes
Randomness and Counting I owe this almost atrocious variety to an institution which other
Lecture Series I Things that should have been taught
Three Theorems regarding Testing Graph Properties \Lambda Oded Goldreich y
Average Case Complexity, Revisited Oded Goldreich
On constant time approximation of parameters of bounded degree graphs
Strong Proofs of Knowledge Oded Goldreich
The Bright Side of Hardness: Relating Computational Complexity and Cryptography
ON THE POWER OF TWOPOINTS BASED SAMPLING Benny Chor \Lambda Oded Goldreich \Lambda\Lambda
Proximity Oblivious Testing and the Role of Invariances Oded Goldreich
P, NP, and NP-Completeness: The Basics of Computational Complexity
Foundations of Cryptography errors and comments on the Fragments
Texts in Computational Complexity: Randomized Complexity Classes
Can Statistical Zero Knowledge be made NonInteractive? On the Relationship of SZK and NISZK \Lambda
Foundations of Cryptography (Fragments of a Book)
A Candidate Counterexample to the Easy Cylinders Conjecture Oded Goldreich
The Random Oracle Methodology, Revisited (preliminary version)
Locally Testable Codes and PCPs of AlmostLinear Length \Lambda Oded Goldreich y
Introduction to Complexity Theory \Lambda Lecture 11: Interactive Proof Systems
Universal Arguments and their Applications \Lambda Department of Computer Science
Introduction to Complexity Theory \Lambda Lecture 24: Average Case Complexity
Simplified derandomization of BPP using a hitting set generator \Lambda Oded Goldreich y Salil Vadhan z Avi Wigderson x
On the Circuit Complexity of Perfect Hashing Oded Goldreich \Lambda
On the (Im)possibility of Obfuscating Programs (Extended Abstract)
Randomized Methods in Computation \Lambda Lecture 8: Small Bias Sample Spaces
Property Testing is the study of super-fast (randomized) algorithms for approx-imate decision making. These algorithms are given direct access to items of a
P, NP, and NP-Completeness: The Basics of Computational Complexity
Algorithmic Aspects of Property Testing in the Dense Graphs Model Oded Goldreich
On Proximity Oblivious Testing Oded Goldreich
Efficient Approximation of General Product Distributions \Lambda Guy Even y Oded Goldreich z Michael Luby x Noam Nisan --Boban Velickovi'c k
On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge
HonestVerifier Statistical ZeroKnowledge Equals General Statistical ZeroKnowledge
Computational Sample Complexity \Lambda Scott E. Decatur y Oded Goldreich z Dana Ron x
Universal Arguments and their Applications Department of Computer Science
Introduction to Complexity Theory \Lambda Lecture 5: NonDeterministic Space
A Sample of Samplers: A Computational Perspective on Sampling
1 Introduction 11 1.1 Cryptography --Main Topics : : : : : : : : : : : : : : : : : : : : : : : : : : 11
Cryptographic Protocols Author's Note: This chapter is a serious obstacle to any future attempt of
On the Implementation of Huge Random Objects Oded Goldreich \Lambday Shafi Goldwasser \Lambdayz Asaf Nussboim \Lambda
Randomized Methods in Computation \Lambda Lecture 3: Small PairwiseIndependent Sample Spaces
Artur Czumaj Department of Computer Science &
A Candidate Counterexample to the Easy Cylinders Conjecture
Computational Complexity: A Conceptual Perspective
Randomized Methods in Computation \Lambda Lecture 9: Expanders and Eigenvalues
A Tradeoff Between Information and Communication in Broadcast Protocols
Private Information Retrieval Benny Chor \Lambda . Oded Goldreich y . Eyal Kushilevitz z . Madhu Sudan x .
Introduction to Complexity Theory \Lambda Lecture 8: NonUniform Polynomial Time P/Poly
ZeroKnowledge Proof Systems In this chapter we discuss zeroknowledge proof systems. Loosely speaking, such proof
Texts in Computational Complexity: On Error Correcting Codes
A Theory of Goal-Oriented Communication Oded Goldreich Brendan Juba Madhu Sudan
Texts in Computational Complexity: Four Advanced Topics Related to NP and NPC
On Interactive Proofs with a Laconic Prover Preliminary Version
Draft of an Appendix Corrections and Additions
Testing (Subclasses of) Halfspaces Kevin Matulef
-Sparse Pseudorandom Distributions Oded Goldreich* and Hugo Krawczykt
Errata to the paper Three Theorems regarding Testing Graph Properties
Introduction to Complexity Theory \Lambda Lecture 14: Pseudorandomness and Computational Difficulty
Reproduced without access to the TeX macros. Adhoc macro definitions were used instead. \Lambda \Lambda\Lambda \Lambda\Lambda\Lambda
Draft of a chapter on General Protocols
Notes on Levin's Theory of AverageCase Complexity Oded Goldreich \Lambda
Computational Complexity: A Conceptual Perspective
On Distributed Smooth Scheduling Dedicated to the memory of Professor Shimon Even for his inspiration and encouragement
Introduction to Complexity Theory \Lambda Lecture 15: Derandomization of BPP
Randomized Methods in Computation \Lambda Lecture 13: Randomized Rounding
ZeroKnowledge Proof Systems In this chapter we discuss zeroknowledge proof systems. Loosely speaking, such proof
On the Implementation of Huge Random Objects (Preliminary Version)
Pseudorandom Generators In this chapter we discuss pseudorandom generators. Loosely speaking, these are efficient
Introduction to Complexity Theory \Lambda Lecture 13: Pseudorandom Generators
Introduction to Complexity Theory \Lambda Lecture 11: Square roots in Z \Lambda
A UniformComplexity Treatment of Encryption and ZeroKnowledge \Lambda
Sublinear-time algorithms Artur Czumaj
(l-r) Profs. Omri Sarig, Gideon Schechtman and Oded Goldreich The question
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Introduction to Complexity Theory \Lambda Lecture 2: NPcompleteness and Self Reducibility
PublicKey Cryptosystems from Lattice Reduction Problems
Concurrent ZeroKnowledge With Timing, Revisited \Lambda Oded Goldreich
A NOTE ON COMPUTATIONAL INDISTINGUISHABILITY 1 Oded Goldreich
Extracted from a working draft of Goldreich's FOUNDATIONS OF CRYPTOGRAPHY. See copyright notice. Extracted from a working draft of Goldreich's FOUNDATIONS OF CRYPTOGRAPHY. See copyright notice.
From absolute distinguishability to positive distinguishability Zvika Brakerski and Oded Goldreich
Computational Complexity Oded Goldreich
On Proximity Oblivious Testing Oded Goldreich \Lambda
Foundations of Cryptography Notes of lecture No. 14 & 15
On Basing OneWay Functions on NPHardness Adi Akavia # Oded Goldreich + Shafi Goldwasser # Dana Moshkovitz
Foundations of Cryptography (Fragments of a Book --Version 2.03)
On the Theory of Average Case Complexity \Lambda Shai BenDavid y
MATHEMATISCHES FORSCHUNGSINSTITUT OBERWOLFACH T a g u n g s b e r i c h t 43/1996
On approximating the average distance between points Kfir Barhum Oded Goldreich \Lambda Adi Shraibman
Introduction to Complexity Theory \Lambda Lecture 21: Communication Complexity
On teaching fast adder designs: revisiting Ladner & Fischer February 1, 2006
Algorithmic and Analysis Techniques in Property Testing School of EE
On PostModern Cryptography \Lambda Oded Goldreich y
Probabilistic Proof Systems: A Primer Oded Goldreich
Cryptography and Cryptographic Protocols Oded Goldreich
On Teaching the Basics of Complexity Theory \Lambda Oded Goldreich
Short PCPs Verifiable in Polylogarithmic Time # Eli BenSasson + Oded Goldreich # Prahladh Harsha Madhu Sudan
Introduction to Complexity Theory \Lambda Lecture 10: The counting class #P
Two Lectures on Advanced Topics in Computability Oded Goldreich
Foundations of Cryptography Notes of lecture No. 10A (given on June 11, 1989)
Three XORLemmas ---An Exposition Oded Goldreich
KNOWLEDGE COMPLEXITY VERSUS COMPUTATIONAL COMPLEXITY
Introduction to Complexity Theory \Lambda Lecture 6: Inside NonDeterministic Logarithmic Space
Computational Complexity: A Conceptual Perspective
Approximating Average Parameters of Graphs \Lambda In Memory of Shimon Even (1935--2004)
Errata regarding On the TimeComplexity of Broadcast in Radio Networks
Locally Testable Codes and PCPs of AlmostLinear Length (Preliminary Version)
Randomized Methods in Computation \Lambda Lecture 6: Uniform Generation
Probabilistic Proof Systems --Lecture Notes Oded Goldreich \Lambda
Glossary of Complexity Summary: This glossary includes selfcontained definitions of most
ZeroKnowledge twenty years after its invention Oded Goldreich
On Expected Probabilistic PolynomialTime Adversaries: A suggestion for restricted definitions and their benefits \Lambda
Demystifying the Master Thesis and Research in General: The Story of Some Master Theses
Property Testing in Bounded Degree Graphs \Lambda Oded Goldreich
Probabilistic Proof Systems --A Survey \Lambda Oded Goldreich
Towards a Computational Theory of Statistical Tests Manuel Blum \Lambda
Concurrent ZeroKnowledge With Timing, Revisited \Lambda Oded Goldreich
In a World of P=BPP Oded Goldreich
Composition of low-error 2-query PCPs using decodable PCPs Prahladh Harsha
Lecture Series III The less traditional material
Mathematisches Forschungsinstitut Oberwolfach Report No. 19/2003
Randomness and Counting I owe this almost atrocious variety to an institution which other
Probabilistic Proof Systems (A Survey) \Lambda
Introduction to Complexity Theory Lecture Notes for Second Semester
On Universal Learning Algorithms \Lambda Oded Goldreich y Dana Ron z
A Short Tutorial of Zero-Knowledge Oded Goldreich
Derandomization that is rarely wrong from short advice that is typically good
Texts in Computational Complexity: Probabilistic Preliminaries and Advanced Topics in Randomization
On Interactive Proofs with a Laconic Prover \Lambda Oded Goldreich y Salil Vadhan z Avi Wigderson x
Preface to Special Issue on Encryption in the Bounded Storage Model
Hashing Functions can Simplify ZeroKnowledge Protocol Design
Another proof that BPP ` PH (and more) Oded Goldreich \Lambda
Testing Monotone Continuous Distributions on High-dimensional Real Cubes
CS 810: Introduction to Complexity Theory 9/18/2003 Lecture 11: P/poly, Sparse Sets, and Mahaney's Theorem
Algorithmic Aspects of Property Testing in the Dense Graphs Model Oded Goldreich
In a World of P=BPP Oded Goldreich
Probabilistic Proof Systems: A Primer Oded Goldreich
Introduction to Complexity Theory { Lecture Notes Oded Goldreich
Texts in Computational Complexity: P, NP and NPCompleteness
Adaptively Secure Multiparty Computation Ran Canetti \Lambda Uri Feige y Oded Goldreich y Moni Naor yz
On the Composition of Secure MultiParty Protocols
On the Randomness Complexity of Property Testing Oded Goldreich y
DEFINITIONS AND PROPERTIES OF ZEROKNOWLEDGE PROOF SYSTEMS
Concurrent ZeroKnowledge With Timing, Revisited Oded Goldreich \Lambda
Randomized Methods in Computation --Lecture Notes Oded Goldreich
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval \Lambda
Comparing Entropies in Statistical ZeroKnowledge with Applications to the Structure of SZK
Another motivation for reducing the randomness complexity of algorithms Oded Goldreich
Theory of Computing: A Scientific Perspective 1 (preliminary version)
On the Circuit Complexity of Perfect Hashing Oded Goldreich and Avi Wigderson
Introduction to Complexity Theory \Lambda Lecture 26: Relativization
Texts in Computational Complexity: A proof of the #Pcompleteness of the permanent
Computational Complexity: A Conceptual Perspective
On the AverageCase Complexity of Property Testing Oded Goldreich
On the Implementation of Huge Random Objects Oded Goldreich y Sha Goldwasser z Asaf Nussboim x
Testing Monotonicity \Lambda Oded Goldreich y
Universal Arguments and their Applications \Lambda Boaz Barak y Oded Goldreich z
64 CHAPTER 6. APPLICATION OF NETWORK FLOW TECHNIQUES idle. It follows that whenever a process which corresponds to u ! v, is executable (since all the
Free Bits, PCPs and NonApproximability---Towards Tight Results
Introduction to Complexity Theory \Lambda Lecture 17: ZeroKnowledge Proof Systems
Foundations of Cryptography Notes of lecture No. 7 (given on Apr. 16th)
On Security Preserving Reductions Revised Terminology
Draft of a chapter on Signature Schemes
Appeared in Crypto87, Springer Verlag, Lecture Note in Computer Science (293), pages 73--86. Reproduced (in June 1997) from an old troff file.
Combinatorial Property Testing (a survey) \Lambda Oded Goldreich y
Computational Complexity: A Conceptual Perspective
Introduction to Complexity Theory Lecture Notes for First Semester
SessionKey Generation using Human Passwords Only \Lambda Oded Goldreich y
On the Randomness Complexity of Property Testing \Lambda Oded Goldreich y
SessionKey Generation using Human Passwords Oded Goldreich ? and Yehuda Lindell
On Constructing 11 OneWay Functions Oded Goldreich \Lambda Leonid A Levin y Noam Nisan z
Mathematisches Forschungsinstitut Oberwolfach Tagungsbericht 44/1998
Randomized Methods in Computation \Lambda Lecture 4: Small PairwiseIndependent Sample Spaces (cont.) and
Texts in Computational Complexity: AverageCase Complexity
Randomized Methods in Computation \Lambda Lecture 1: Probability and the Probabilistic Method
On the Implementation of Huge Random Objects Oded Goldreich y Sha Goldwasser yz Asaf Nussboim
Work and Publications Oded Goldreich
Improved derandomization of BPP using a hitting set generator Oded Goldreich
Short PCPs Verifiable in Polylogarithmic Time Eli BenSasson # Oded Goldreich + Prahladh Harsha # Madhu Sudan
On our duties as scientists Oded Goldreich \Lambda
Proving Computational Ability Mihir Bellare \Lambda Oded Goldreich y
A Generic Hardcore Predicate for any OneWay Function Extracts from Foundations of Cryptography 1
Introduction to Complexity Theory \Lambda Lecture 20: Circuit Depth and Space Complexity
Computational Complexity: A Conceptual Perspective
Demystifying the Master Thesis and Research in General: The Story of Some Master Theses
Texts in Computational Complexity: The preliminaries --computational tasks and models
Appears in Advances in Cryptology --Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, SpringerVerlag, Y. Desmedt, ed., 1994.
Randomized Methods in Computation \Lambda Lecture 5: Approximate Counting and Uniform Generation
How to use my 1989 Lecture Notes on Encryption, Signatures and CryptoProtocols
Introduction to Complexity Theory \Lambda Lecture 18: NP in PCP[poly,O(1)]
Comparing the strength of query types in property testing: The case of testing k-colorability
Introduction to Complexity Theory \Lambda Lecture 22: Monotone Circuit Depth and Communication
Implementing oblivious transfer using collection of dense trapdoor
200 CHAPTER 4. ZEROKNOWLEDGE PROOF SYSTEMS to be witnesshiding (see Section 4.6). Hence the resulting identification scheme has con
Algorithmic Aspects of Property Testing in the Dense Graphs Model Oded Goldreich \Lambda
Randomized Methods in Computation \Lambda Lecture 7: Small Bias Sample Spaces
Texts in Computational Complexity: Proving Yao's XOR Lemma via the Direct Product Lemma
Preface to Yehuda Lindell's PhD Thesis Oded Goldreich
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding
Mathematisches Forschungsinstitut Oberwolfach Report No. 44 / 2000
List of Publications Oded Goldreich
Hierarchy Theorems for Property Testing Oded Goldreich y Michael Krivelevich z Ilan Newman x Eyal Rozenberg {
From absolute distinguishability to positive distinguishability Zvika Brakerski and Oded Goldreich
Almost kwise independence versus kwise independence Noga Alon \Lambda
The Foundations of Modern Cryptography \Lambda (Version Nr. 3.2)
Texts in Computational Complexity: Approximation Problems
Computational Complexity: A Conceptual Perspective
Appears in Proceedings of CRYPTO 92. On Defining Proofs of Knowledge
Fragments of a chapter on Encryption Schemes (Extracts from Foundations of Cryptography --in preparation)
Introduction to Testing Graph Properties Oded Goldreich
Draft of a chapter on Signature Schemes
How to Construct ConstantRound ZeroKnowledge Proof Systems for NP \Lambda
On Teaching the Basics of Complexity Theory (In Memory of Shimon Even [1935--2004])
On the Implementation of Huge Random Objects \Lambda Oded Goldreich y Shafi Goldwasser yz Asaf Nussboim y
Reproduced from an old troff file (dating 1987/88). COMPUTATIONAL RANDOMNESS
Testing of `massively parametrized problems' -
Concurrent ZeroKnowledge With Timing, Revisited \Lambda Oded Goldreich
On Testing Expansion in BoundedDegree Graphs Oded Goldreich \Lambda
On Proximity Oblivious Testing Oded Goldreich
A Sublinear Bipartiteness Tester for Bounded Degree Graphs
Pseudorandom Generators Indistinguishable things are identical. 1
Mathematisches Forschungsinstitut Oberwolfach Report No. 31/2007
The Best of Both Worlds: Guaranteeing Termination in Fast Randomized
On Interactive Proofs with a Laconic Prover (Extended Abstract)
How NOT to write a paper \Lambda Oded Goldreich
Finding Cycles and Trees in Sublinear Time Artur Czumaj Oded Goldreich Dana Ron C. Seshadhri Asaf Shapira
Computational Complexity Oded Goldreich
Randomized Methods in Computation \Lambda Lecture 10: Random Walks on Expanders
Candidate OneWay Functions Based on Expander Graphs Oded Goldreich \Lambda
SPECIAL ISSUE ON WORST-CASE VERSUS
In a World of P=BPP Oded Goldreich
How to write a paper Oded Goldreich
Introduction to Complexity Theory \Lambda Lecture 1: The P vs NP Question
Algorithmic Aspects of Property Testing in the Dense Graphs Model Oded Goldreich
Introduction to Complexity Theory Notes for a One--Semester Course
Foundations of Cryptography Notes of lecture No. 5B (given on Apr. 2nd)
Texts in Computational Complexity: Pseudorandom Generators
Reproduced without access to the TeX macros. Adhoc macro definitions were used instead. Unbiased Bits from Sources of Weak Randomness
SessionKey Generation using Human Passwords Only \Lambda Oded Goldreich y
Fragments of a chapter on Encryption Schemes (Extracts from Foundations of Cryptography --in preparation)
On the Complexity of Interactive Proofs with Bounded Communication
Preface to SICOMP's Special Issue on Randomness and Complexity
On Promise Problems in memory of Shimon Even (1935--2004) \Lambda
SessionKey Generation using Human Passwords Only Oded Goldreich \Lambda
Computational Complexity and Knowledge Complexity \Lambda
Comments on Eight TCC'09 Talks Oded Goldreich
Secure MultiParty Computation (Final (incomplete) Draft, Version 1.4)
On the Randomness Complexity of Property Testing \Lambda Oded Goldreich y
Extracts from Modern Cryptography, Probabilistic Proofs and
Incremental Cryptography and Application to Virus Protection Mihir Bellare \Lambda Oded Goldreich y Shafi Goldwasser z
Resettable ZeroKnowledge \Lambda Ran Canetti y Oded Goldreich z Shafi Goldwasser x Silvio Micali --
Resettable ZeroKnowledge \Lambda Ran Canetti y Oded Goldreich z Shafi Goldwasser x Silvio Micali --
Foundations of Cryptography --A Primer Oded Goldreich
Testing by implicit learning: a brief survey Rocco A. Servedio
Property Testing: A Learning Theory Perspective School of EE
Private Information Retrieval \Lambda Benny Chor y Oded Goldreich z Eyal Kushilevitz x Madhu Sudan --
Computational Indistinguishability: A Sample Hierarchy
The Random Oracle Methodology, Revisited \Lambda Ran Canetti y Oded Goldreich z Shai Halevi x
On Basing OneWay Functions on NPHardness Adi Akavia \Lambda Oded Goldreich y Shafi Goldwasser z Dana Moshkovitz x
OnLine/OffLine Digital Signatures \Lambda Shimon Even y Oded Goldreich z Silvio Micali x
Introduction to Complexity Theory --Lecture Notes Oded Goldreich
Increasing the Expansion of Pseudorandom Generators (Extracts from a book on Cryptography) 1
Approximating Average Parameters of Graphs In Memory of Shimon Even (1935--2004)
Introduction to Complexity Theory \Lambda Lecture 4: Space Complexity
On the Limits of NonApproximability of Lattice Problems \Lambda Oded Goldreich y
Bounds on 2Query Codeword Testing Eli BenSasson \Lambda Oded Goldreich y Madhu Sudan z
Short Locally Testable Codes and Proofs: A Survey in Two Parts
Comments on the paper ``Three Theorems regarding Testing Graph Properties''
Local Property Reconstruction and Monotonicity Michael Saks
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly
On Approximating the Average Distance Between Points Kfir Barhum Oded Goldreich \Lambda Adi Shraibman
Algorithmic Aspects of Property Testing in the Dense Graphs Model Oded Goldreich
Work and Publications Oded Goldreich
Introduction to Complexity Theory Notes for a One--Semester Course
Chinese Remaindering with Errors Oded Goldreich \Lambda Dana Ron y Madhu Sudan z
Variations on P and NP Cast a cold eye
On Teaching the Basics of Complexity Theory (In Memory of Shimon Even [1935--2004]) \Lambda
Locally Testable Codes and PCPs of AlmostLinear Length \Lambda Oded Goldreich y
Bibliography [1] L. Adleman. Two theorems on random polynomialtime. In 19th FOCS, pages 75--83, 1978.
A Note on Testing Monotonicity Oded Goldreich \Lambda Shafi Goldwasser y Dana Ron z
Fragments of a chapter on Signature Schemes
102 CHAPTER 2. P, NP AND NPCOMPLETENESS Exercise 2.29 (NPcomplete promise problems in coNP (following [68]))
On the Merits of Theory of Computing Oded Goldreich \Lambda Avi Wigderson y
Candidate One-Way Functions Based on Expander Graphs
SIAM J. COMPUT. c 2010 Society for Industrial and Applied Mathematics Vol. 39, No. 7, pp. 27612822
Property Testing in Bounded Degree Graphs Oded Goldreich \Lambda Dana Ron y
Efficient Approximation of Product Distributions \Lambda Guy Even y Oded Goldreich z Michael Luby x Noam Nisan --Boban Velickovi'c k
ZeroKnowledge twenty years after its invention Oded Goldreich
Pseudorandomness Oded Goldreich
A Preliminary version of this paper appeared in Proceedings of the 31st Annual IEEE Symposium on the Foundations of Computer Science, IEEE (1990).
On Pseudorandomness with respect to Deterministic Observers Oded Goldreich \Lambda
Introduction to Complexity Theory \Lambda Lecture 23: The FORK Game
Texts in Computational Complexity: Probabilistic Proof Systems
Hierarchy Theorems for Property Testing Oded Goldreich y Michael Krivelevich z Ilan Newman x Eyal Rozenberg {
Cryptography and Cryptographic Protocols Oded Goldreich
Relaxing the Requirements The philosophers have only interpreted the world, in
On Testing Computability by Small Width OBDDs Oded Goldreich
Honest Verifier vs Dishonest Verifier in Public Coin ZeroKnowledge Proofs
On Testing Computability by Small Width OBDDs Oded Goldreich
On the Randomness Complexity of Property Testing \Lambda Oded Goldreich y
Free Bits, PCPs and NonApproximability---Towards Tight Results \Lambda
Resettable ZeroKnowledge \Lambda Ran Canetti y Oded Goldreich z Shafi Goldwasser x Silvio Micali --
Randomness, Interactive Proofs and ZeroKnowledge Oded Goldreich
Foundations of Cryptography Notes of lecture No. 8A (given on Apr. 30th by Oded GOLDREICH)
Texts in Computational Complexity: Counting Problems
Fragments of a chapter on Encryption Schemes
SelfDelegation with Controlled Propagation --or --What If You Lose Your Laptop
The Current Bibliography List (first posted version)
Contemplations on Testing Graph Properties Oded Goldreich
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding \Lambda
On Estimating the Average Degree of a Graph Oded Goldreich
Free Bits, PCPs and NonApproximability --Towards Tight Results MIHIR BELLARE \Lambda ODED GOLDREICH y MADHU SUDAN z
Annotated List of References (compiled Feb. 1989)
Computational Difficulty In this chapter we present several variants of the definition of oneway functions. In par
Tiny Families of Functions with Random Properties: A Quality--Size Trade--off for Hashing \Lambda
A Combinatorial Consistency Lemma with application to proving the PCP Theorem
On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted De nitions and Their Bene ts
ZeroKnowledge Proof Systems In this chapter we discuss zeroknowledge proof systems. Loosely speaking, such proof
A Taste of Randomized Computations \Lambda Oded Goldreich
A Taxonomy of Proof Systems \Lambda Oded Goldreich
Lecture Series II The most traditional material
Randomized Methods in Computation \Lambda Lecture 12: Hitters and Samplers
Basic Tools Extracted from a working draft of Goldreich's FOUNDATIONS OF CRYPTOGRAPHY. See copyright notice.
A combinatorial consistency lemma with application to proving the PCP Theorem
A Sample of Samplers: A Computational Perspective on Sampling
On Yao's XOR-Lemma Oded Goldreich, Noam Nisan, and Avi Wigderson
A Theory of Goal-Oriented Communication Oded Goldreich Brendan Juba Madhu Sudan
On Completeness and Soundness in Interactive Proof Systems Martin Furer, Computer Science Dept., Pennsylvania state Univ., University Park, PA 16802.
On Chosen Ciphertext Security of Multiple Encryptions (Preliminary Version) \Lambda
Pseudorandom Generators In this chapter we discuss pseudorandom generators. Loosely speaking, these are efficient
Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
Probabilistic Proof Systems --Part I 1 Lecture 1. Interactive Proofs 1
On Smooth Sets of Integers Dedicated to the memory of Professor Shimon Even for his inspiration and encouragement
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly
Computational Complexity: A Conceptual Perspective
Texts in Computational Complexity: IP, AM and round speedup
Interleaved ZeroKnowledge (A Preliminary Version)
The Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable #
An extended abstract of this paper appears in Advances in Cryptology --Crypto 99 Proceedings, Lecture Notes in Computer Science Vol. ??, M. Wiener ed., SpringerVerlag, 1999. This is the full
Foundations of Cryptography --Teaching Notes Oded Goldreich
Testing Linear-Invariant Non-Linear Properties Arnab Bhattacharyya
Hierarchy Theorems for Property Testing Oded Goldreich
Pseudorandom Generators: A Primer Oded Goldreich
Introduction to Testing Graph Properties Oded Goldreich
A Brief Introduction to Property Testing Oded Goldreich
Three XOR-Lemmas --An Exposition Oded Goldreich
On Approximating the Average Distance Between Points Kfir Barhum Oded Goldreich \Lambda Adi Shraibman
Feature Review for Mathematical Reviews Oded Goldreich
Draft of a chapter on Encryption Schemes
Draft of a chapter on Encryption Schemes
Critique of some trends in the TCS community in light of two controversies \Lambda
Zero-Knowledge twenty years after its invention Oded Goldreich
Pseudorandomness (Notes for an overview talk)
Bibliography [1] W. Aiello, M. Bellare and R. Venkatesan. Knowledge on the Average --
Foundations of Cryptography Notes of lecture No. 6 (given on Apr. 9th)
Lecture Notes on Pseudorandomness --Part I Oded Goldreich
Property Testing and its connection to Learning and Approximation \Lambda Oded Goldreich y Shafi Goldwasser z Dana Ron x
Texts in Computational Complexity: A proof of Toda's Theorem
ZeroKnowledge twenty years after its invention Oded Goldreich
A Brief Introduction to Property Testing Oded Goldreich
The Theory of Computing: A Scientific Perspective Oded Goldreich \Lambda Avi Wigderson y
Free Bits, PCPs and NonApproximability---Towards Tight Results
Institute for Theoretical Computer Science, Tsinghua University ITCS Mini-workshop on Property Testing
Green's Conjecture and Testing Linear Invariant Properties Asaf Shapira
Hierarchy Theorems for Property Testing Oded Goldreich
Hierarchy Theorems for Property Testing Oded Goldreich \Lambda Michael Krivelevich y Ilan Newman z Eyal Rozenberg x
Pseudorandomness Oded Goldreich
Introduction to Complexity Theory \Lambda Lecture 12: Probabilistically Checkable Proof Systems
Testing Graph Blow-Up Lidor Avigad y
Addendum to the paper ``Simple Constructions of Almost kwise Independent Random Variables''
Hierarchy Theorems for Property Testing Oded Goldreich y Michael Krivelevich z Ilan Newman x Eyal Rozenberg {
Preface to Special Issue on General Secure MultiParty Computation
Introduction to Complexity Theory \Lambda Lecture 25: Computational Learning Theory
On the Implementation of Huge Random Objects Oded Goldreich \Lambday Shafi Goldwasser \Lambdayz Asaf Nussboim \Lambda
P, NP, and NPCompleteness: The Basics of Computational Complexity
How to Construct Pseudorandom Functions Extracts from Foundations of Cryptography 1
An Experimental Evaluation of Goldreich's OneWay Function Saurabh Kumar Panjwani \Lambda ,
On the randomoracle methodology as applied to lengthrestricted signature schemes
Introduction to Complexity Theory \Lambda Lecture 19: Dtime vs Dspace
Pseudorandom Generators: A Primer Oded Goldreich
CollisionFree Hashing from Lattice Problems Oded Goldreich \Lambda Shafi Goldwasser y Shai Halevi
Learning polynomials with queries: The highly noisy case \Lambda
Appeared in Advances in Cryptology --Crypto `86 (Proceedings), (A.M. Odlyzko ed.), Lecture Note in Computer Science (263) Springer Verlag, pages 104--110, 1987.
Computational Complexity: A Conceptual Perspective
On Proximity Oblivious Testing Oded Goldreich y
Theory of Computing: A Scientific Perspective (Extended Abstract) \Lambda
Texts in Computational Complexity: Space Complexity
The GGM Construction does NOT yield Correlation Intractable Function Ensembles
Introduction to Complexity Theory \Lambda Lecture 3: More on NP and some on DTIME
Security Preserving Amplification of Hardness Oded Goldreich \Lambda , Technion
Secure Multiparty Computation and Applications
Probabilistic Proof Systems A proof is whatever convinces me.
On the (Im)possibility of Obfuscating Programs \Lambda Boaz Barak y Oded Goldreich y Russell Impagliazzo z Steven Rudich x
Software Protection and Simulation on Oblivious RAMs \Lambda
On the Security of MultiParty PingPong Protocols (fragments of a revised version dating to July 1985)
On the Foundations of Modern Cryptography
Strong Proofs of Knowledge (preliminary version)
Draft of a chapter on General Protocols
Private Information Retrieval \Lambda Benny Chor y Oded Goldreich z Eyal Kushilevitz x Madhu Sudan --
Algorithmic Aspects of Property Testing in the Dense Graphs Model Oded Goldreich \Lambda
Texts in Computational Complexity: Amplification of Hardness
A brief overview of Complexity Theory The following brief overview is intended as a teaser for students in an introductory
Texts in Computational Complexity: More Resources, More Power?
On Expected Probabilistic PolynomialTime Adversaries: A suggestion for restricted definitions and their benefits
Approximations of General Independent Distributions 1 Guy Even 2 Oded Goldreich 3 Michael Luby 4 Noam Nisan 5
Locally Testable Codes and PCPs of AlmostLinear Length \Lambda Oded Goldreich y
Pseudorandomness --Part II 1 Introduction 1
General Cryptographic Protocols: The Very Basics Oded Goldreich
Eliminating Decryption Errors in the AjtaiDwork Cryptosystem
Notes on Ten TCC'10 Talks Oded Goldreich
Lower Bounds for Sampling Algorithms for Estimating the Average \Lambda
Computational Complexity: A Conceptual Perspective
Three Theorems regarding Testing Graph Properties \Lambda Oded Goldreich y
Probabilistic Proof Systems --Part II 1 Lecture 1. Introduction to PCPs 1
Foundations of Cryptography --A Primer Oded Goldreich
Property Testing in Massive Graphs Oded Goldreich
On Testing Computability by Small Width OBDDs Oded Goldreich
Bravely, Moderately: A Common Theme in Four Recent Works
Introduction to Complexity Theory \Lambda Lecture 16: Derandomizing SpaceBounded Computations
How to write a paper Oded Goldreich
Testing Euclidean Spanners Frank Hellweg Melanie Schmidt Christian Sohler
A Brief Introduction to Property Testing Oded Goldreich
Thesis for the degree Doctor of Philosophy
Randomized Methods in Computation -Lecture Notes Oded Goldreich
Introduction to Complexity Theory -Lecture Notes Oded Goldreich
Randomness and Computation Oded Goldreich
The Graph Clustering Problem has a Perfect ZeroKnowledge Proof Oded Goldreich
Foundations of Cryptography an Additional Fragment (Nr. 1)
Algorithmic Aspects of Property Testing in the Dense Graphs Model Oded Goldreich
Basic Utilities Extracted from a working draft of Goldreich's FOUNDATIONS OF CRYPTOGRAPHY. See copyright notice.
NonBlackBox Techniques in Cryptography
Texts in Computational Complexity: P/poly and PH
On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators \Lambda
On Security Preserving Reductions --Revised Terminology Oded Goldreich
On the Implementation of Huge Random Objects Oded Goldreich \Lambday Shafi Goldwasser \Lambdayz Asaf Nussboim \Lambda
Randomized Methods in Computation \Lambda Lecture 2: Laws of large numbers
Uniform Generation of NPwitnesses using an NPoracle
Foundations of Cryptography Notes of lecture No. 10B & 11 (given on June 11 & 18, 1989)
On Proximity Oblivious Testing Oded Goldreich \Lambda
Property Testing and Its Connection to Learning and Approximation
The Bright Side of Hardness So saying she donned her beautiful, glittering golden--Ambrosial
Bounds on Tradeoffs between Randomness and Communication Ran Canetti \Lambda Oded Goldreich y
Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the art
Draft of an Appendix Corrections and Additions
Texts in Computational Complexity: Proving that Undirected Connectivity is in L
Fragments of a chapter on Signature Schemes (Extracts from Foundations of Cryptography --in preparation)
A Sample of Samplers: A Computational Perspective on Sampling
Algorithmica (1990) 5:1-10 Algorithmica
Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle is NP-Hard
Proving Computational Ability Mihir Bellare and Oded Goldreich
On Constructing 1-1 One-Way Functions Oded Goldreich, Leonid A Levin, and Noam Nisan
Collision-Free Hashing from Lattice Problems Oded Goldreich, Shafi Goldwasser, and Shai Halevi
Another proof that BPP PH (and more) Oded Goldreich and David Zuckerman
Simplified Derandomization of BPP Using a Hitting Set Generator
On Testing Expansion in Bounded-Degree Oded Goldreich and Dana Ron
Using the FGLSS-reduction to Prove Inapproximability Results for Minimum Vertex
The GGM Construction does NOT yield Correlation Intractable Function Ensembles
From Logarithmic advice to Single-bit Advice Oded Goldreich, Madhu Sudan, and Luca Trevisan
On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge
On the Average-Case Complexity of Property Oded Goldreich
From Absolute Distinguishability to Positive Distinguishability
Proximity Oblivious Testing and the Role of Invariances
Notes on Levin's Theory of Average-Case Oded Goldreich
Short Locally Testable Codes and Proofs: A Survey in Two Parts
Bravely, Moderately: A Common Theme in Four Recent Works
Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State
On the complexity of computational problems regarding distributions (a survey)
Basic Facts about Expander Graphs Oded Goldreich
Another Motivation for Reducing the Randomness Complexity of Algorithms
On the (Im)possibility of Obfuscating Programs Oded Goldreich
On the (Im)possibility of Obfuscating Programs Oded Goldreich
Finding Cycles and Trees in Sublinear Time Artur Czumaj Oded Goldreich Dana Ron C. Seshadhri
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
In a World of P=BPP Oded Goldreich
Two Comments on Targeted Canonical Derandomizers Oded Goldreich
A Theory of Goal-Oriented Communication Oded Goldreich Brendan Juba Madhu Sudan
Complete Fairness in Secure Two-Party Computation S. Dov Gordon
Valiant's Polynomial-Size Monotone Formula for Majority Oded Goldreich
Randomized Methods in Computation: Tentative Collection of Reading Material
Testing Juntas (draft) Carnegie Mellon University
Property Testing of Massively Parametrized problems -A Ilan Newman
Transitive-Closure Spanners: A Survey Sofya Raskhodnikova
A Hypergraph Dictatorship Test with Perfect Completeness Victor Chen
Symmetric LDPC codes and local testing Tali Kaufman
Optimal Testing of Reed-Muller Codes Arnab Bhattacharyya
Sublinear Algorithms in the External Memory Model Alexandr Andoni
Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
Dynamic Approximate Vertex Cover and Maximum Matching Krzysztof Onak
Some recent results on local testing of sparse linear codes Swastik Kopparty
Basics of Probability Theory (for Theory of Computation courses)
Fanica Gavril Yehoshia Perl
ICS 2010 Call for Papers The First Symposium on Innovations in Computer Science (ICS 2010) will
A Male's Experience of Being a Gender Minority Oded Goldreich
Mathematisches Forschungsinstitut Oberwolfach Report No. 52/2009
FoC: The Computational Model Oded Goldreich
Contemplations on Testing Graph Properties Oded Goldreich
On Basing OneWay Functions on NPHardness Adi Akavia \Lambda Oded Goldreich y Shafi Goldwasser z Dana Moshkovitz x
A Kind of Preface Oded Goldreich
Mathematisches Forschungsinstitut Oberwolfach Report No. 26/2005
Addendum to the paper ``Randomness in Interactive Proofs'' \Lambda
On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted De nitions and Their Bene ts
Computational Complexity: A Conceptual Perspective
A Study of Statistical Zero-Knowledge Proofs Salil Pravin Vadhan
The RoundComplexity of BlackBox Concurrent ZeroKnowledge
From logarithmic advice to singlebit advice Oded Goldreich \Lambda Madhu Sudan y Luca Trevisan z
Reproduced without access to the TeX macros. Adhoc macro definitions were used instead. ON THE POWER OF TWOPOINTS BASED SAMPLING
Information Theory versus Complexity Theory: Another Test Case
On Centralized Smooth Scheduling Dedicated to the memory of Professor Shimon Even for his inspiration and encouragement
Computational Indistinguishability: Algorithms vs. Circuits Oded Goldreich
Theory of Computing: A Scientific Perspective 1 (preliminary version)
Free Bits, PCPs and NonApproximability---Towards Tight Results
Universal Arguments and their Applications \Lambda Department of Computer Science
On the Foundations of Modern Cryptography Oded Goldreich
Quantifying Knowledge Complexity \Lambda Oded Goldreich y Erez Petrank z
Draft of a chapter on General Protocols
Foundations of Cryptography Oded Goldreich
Introduction to Complexity Theory \Lambda Lecture 7: Randomized Computations
Monotone Circuits: One-Way Functions versus Pseudorandom Oded Goldreich
" ,"? : " ,1784-2
A Primer on Pseudorandom Generators Oded Goldreich
Thesis for the degree Doctor of Philosophy
MaxWeber,"ScienceasaVocation" 'WissenschaftalsBeruf,'fromGesammlteAufsaetzezurWissenschaftslehre(Tubingen,
Combinatorial Construction of Locally Testable Codes or@meir-family.com
On the status of intellectual values in TOC Oded Goldreich
On the status of intellectual values in TOC Oded Goldreich
On the Use of Complexity in Cryptography Oded Goldreich
Invitation to Complexity Theory Oded Goldreich
Introduction to Testing Graph Properties Oded Goldreich
On Post-Modern Cryptography Oded Goldreich
List of Publications Oded Goldreich
On Struggle and Competition in Scientific Fields Oded Goldreich
Lower bounds and structural results in property testing of
Work and Publications Oded Goldreich
Work and Publications Oded Goldreich