Probabilistically checkable proofs the easy way

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 337-352

  Zimand, Marius ^a,b  

^a TOWSON UNIVERSITY   (United States)

^b UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

Communication complexity; PCP theorem; Sampling

Indexed keywords

BOOLEAN ALGEBRA; POLYNOMIAL APPROXIMATION; SAMPLING;

BOOLEAN FORMULAE; COMMUNICATION COMPLEXITY; ONE-WAY PERMUTATION; PCP THEOREM; POLYNOMIAL-TIME; PROBABILISTICALLY CHECKABLE PROOF; PSEUDORANDOM GENERATORS; TECHNICAL TOOLS;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 34748829711     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_28     Document Type: Article

References (20)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pages 14-23, 1992.
2. S. Arora and S. Safra. Probabilistic checkable proofs: A new characterization of NP. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pages 1-13, 1992.
3. G. Brassard, D. Chaum, and C. Crépeau. Minumum disclosure proofs of knowledge. Journal of Computer System Sciences, 37:156-189, 1988.
4. O. Goldreich, S. Goldwasser, and S. Micali. How to construct a random functions. Journal of the ACM, 33(4):792-807, 1986.
5. O. Goldreich and J. Hástad. On the complexity of interactive proofs with bounded communication. Information Processing Letters, 67(4):205-214, 1998.
6. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proceedings of Khe 21st ACM Symposium on Theory of Computing, pages 25-32, 1989.
7. O. Goldreich. Foundations of cryptography (fragments of a book), February 1993. ECCC Technical report, available at http://www.eccc.uni-trier.de/local/ECCC-Books/eccc-books.html.
8. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer Verlag, 1999.
9. R. Gennaro and L. Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 2000.
10. O Goldreich, S. Vadhan, and A. Wigderson. On interactive proofs with a laconic prover, July 2001. ECCC Technical report TR01-046, available at http://www.eccc.uni-trier.de/eccc.
11. J. Hastad, R. Impagliazzo, L. Levin, and M. Luby. Construction of a pseudo-random generator from any one-way function. SI AM Journal on Computing, 28(4), 1999.
12. R. Impagliazzo. Very strong one-way functions and pseudo-random generators exist relative to a random oracle, (manuscript), January 1996.
13. J. Kilian. A note on efficient zero-knowledge proofs and arguments. In Proceedings of the 24th ACM Symposium on Theory of Computing, pages 723-732. ACM Press, 1992.
14. R. C. Merkle. A certified digital signature scheme. In Gilíes Brassard, editor, Advances in Cryptology-CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 218-238, Berlin, Germany/Heidelberg, Germany/London, UK/etc., 1990. Springer-Verlag.
15. S. Micali. Computationally sound proofs. SI AM Journal on Computing, 30(4):1253-1298, 2000.
16. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
17. M. Sudan. List decoding: Algorithms and applications (a survey). Sigact News, 31(l):16-27, 2000.
18. M. Sudan. Probabilistically checkable proofs, July-August 2000. Lecture notes available at http://www.toc.lcs.mit.edu/madhu/pcp/course.html.
19. L. Trevisan. Interactive and probabilistic proof-checking. Annals of Pure and Applied Logic, 2000. (to appear; available at http://www.cs.berkeley.edu/luca).
20. M. Zimand. Sampling under adverse conditions with applications to distributed computing. In Workshop on Parallel Algorithms, May 1999, Atlanta (satélite workshop of FCRC'99), 1999.