Next:
Property Testing and its
Up:
Work and Publications
Previous:
Adaptively Secure Multi-party Computation
Sabbatical at MIT (1996-1998)
Property Testing and its connection to Learning and Approximation
On the Complexity of Interactive Proofs with Bounded Communication
On the Circuit Complexity of Perfect Hashing
On Universal Learning Algorithms
Collision-Free Hashing from Lattice Problems
Property Testing in Bounded Degree Graphs
The Graph Clustering Problem has a Perfect Zero-Knowledge Proof
Public-Key Cryptosystems from Lattice Reduction Problems
Computational Indistinguishability - Algorithms vs. Circuits
Computational Sample Complexity
Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop
Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem
Uniform Generation of NP-witnesses using an NP-oracle
Another proof that BPP subseteq PH (and more)
Computational Indistinguishability: A Sample Hierarchy
On the Limits of Non-Approximability of Lattice Problems
A Sublinear Bipartitness Tester for Bounded Degree Graphs
The Random Oracle Methodology, Revisited
Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge
Testing Monotinicity
Deterministic Amplification of Space Bounded Probabilistic Algorithms
Can Statistical Zero-Knowledge be Made Non-Interactive? or On the Relationship of SZK and NISZK
Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK
Beyond the Birthday Barrier, Without Counters
Chinese Remaindering with Errors
Oded Goldreich
2003-07-30
