ON INTERACTIVE PROOFS WITH A LACONIC PROVER Oded Goldreich, Salil Vadhan, and Avi Wigderson Abstract. We continue the investigation of interactive proofs with bounded communication, as initiated by Goldreich and Hastad

Source URL: www.math.ias.edu

• Complexity classes
• Randomized algorithms
• Computational complexity theory
• Interactive proof system
• Theoretical computer science
• Mathematics
• Zero-knowledge proof
• Probabilistically checkable proof
• Computer science
• IP
• ArthurMerlin protocol
• NP

Lecture Notes on Pseudorandomness { Part I Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. email:

Source URL: www.wisdom.weizmann.ac.il

On the philosophical basis of computational theories Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel.

Source URL: www.wisdom.weizmann.ac.il

Resettable Zero-Knowledge Ran Canettiy Oded Goldreichz

Source URL: www.wisdom.weizmann.ac.il

Robust PCPs of Proximity, Shorter PCPs and Applications to Coding Eli Ben-Sasson y Oded Goldreich z Prahladh Harsha x Salil Vadhan k

Source URL: www.wisdom.weizmann.ac.il

Ecient Approximation of Product Distributions Guy Eveny Oded Goldreichz Michael Lubyx Noam Nisan{

Source URL: www.wisdom.weizmann.ac.il

The Random Oracle Hypothesis is False Richard Chang1 2 Benny Chor3 4 Oded Goldreich3 5 Juris Hartmanis1 Johan Hastad6 Desh Ranjan1 7 Pankaj Rohatgi1 ;

Source URL: www.wisdom.weizmann.ac.il

On Basing One-Way Functions on NP-Hardness Adi Akavia Oded Goldreich MIT

Source URL: people.csail.mit.edu

Resettably-Sound Zero-Knowledge and its Applications (preliminary version) Boaz Barak Oded Goldreich

Source URL: www.wisdom.weizmann.ac.il

Pseudorandomness Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Rehovot, Israel. March 27, 2000

Source URL: www.wisdom.weizmann.ac.il