On transformation of interactive proofs that preserve the prover's complexity

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 200-207

  Vadhan, Salil ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Arthur Merlin games; interactive proof systems; pseudorandom permutations; zero knowledge proofs

Indexed keywords

ARTHUR-MERLIN GAMES; BLACK BOXES; INTERACTIVE PROOF SYSTEM; INTERACTIVE PROOFS; PERFECT ZERO-KNOWLEDGE; PROOF SYSTEM; PSEUDORANDOM PERMUTATION; ZERO KNOWLEDGE PROOF;

COMPUTATIONAL COMPLEXITY; MATHEMATICAL TRANSFORMATIONS; POLES AND ZEROS;

PROGRAMMABLE LOGIC CONTROLLERS; THEOREM PROVING;

BLACK-BOX TRANSFORMATIONS; INTERACTIVE PROOFS;

EID: 0033705070     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335330     Document Type: Conference Paper

References (32)

1. V. Arvind and J. Köbler. On resource-bounded measure and pseudorandomness. In Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 235-249. LNCS 1346, Springer-Verlag, 1997.
2. L. Babai and S. Moran. Arthur-Merlin games: A randomized proof system and a hierarchy of complexity classes. J. Comput. Syst. Sci., 36:254-276, 1988. (Pubitemid 18623335)
3. M. Bellare and S. Goldwasser. The complexity of decision versus search. SIAM J. Comput., 23(1):97-119, Feb. 1994.
4. M. Bellare, S. Micali, and R. Ostrovsky. The (true) complexity of statistical zero knowledge. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 494-502, Baltimore, Maryland, 14-16 May 1990.
5. M. Ben-Or, O. Goldreich, S. Goldwasser, J. Håstad, J. Kilian, S. Micali, and P. Rogaway. Everything provable is provable in zero-knowledge. In S. Goldwasser, editor, Advances in Cryptology - CRYPTO '88, volume 403 of Lecture Notes in Computer Science, pages 37-56. Springer-Verlag, 1990, 21-25 Aug. 1988.
6. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 113-131, Chicago, Illinois, 2-4 May 1988.
7. R. B. Boppana, J. Håstad, and S. Zachos. Does co-NP have short interactive proofs? Information Processing Letters, 25:127-132, 1987. (Pubitemid 17623580)
8. P. Bro Miltersen and N. Vinodchandran. Derandomizing Arthur-Merlin games using hitting sets. In 40th Annual Symposium on Foundations of Computer Science, New York, NY, 17-19 Oct. 1999. IEEE.
9. I. Damgård, O. Goldreich, T. Okamoto, and A. Wigderson. Honest verifier vs. dishonest verifier in public coin zero-knowledge proofs. In Proceedings of Crypto '95, Lecture Notes in Computer Science, volume 403. Springer-Verlag, 1995.
10. S. Even, A. L. Selman, and Y. Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control, 61(2):159-173, May 1984. (Pubitemid 15436618)
11. M. Fürer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos. On completeness and soundness in interactive proof systems. In S. Micali, editor, Advances in Computing Research, volume 5, pages 429--442. JAC Press, Inc., 1989.
12. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792-807, Oct. 1986.
13. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM, 38(1):691-729, 1991.
14. O. Goldreich, A. Sahal, and S. Vadhan. Honest verifier statistical zero-knowledge equals general statistical zero-knowledge. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 399-408, Dallas, 23-26 May 1998.
15. O. Goldreich and S. Vadhan. Comparing entropies in statistical zero-knowledge with applications to the structure of SZK. In Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, pages 54-73, Atlanta, GA, May 1999. IEEE Computer Society Press.
16. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Comput., 18(1):186-208, February 1989.
17. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In S. Micali, editor, Advances in Computing Research, volume 5, pages 73-90. JAC Press, Inc., 1989.
18. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, August 1999.
19. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 44-61, Seattle, Washington, 15-17 May 1989.
20. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 220-229, El Paso, Texas, 4-6 May 1997.
21. R. Impagliazzo and M. Yung. Direct minimum-knowledge computations (extended abstract). In C. Pomerance, editor, Advances in Cryptology - CRYPTO '87, volume 293 of Lecture Notes in Computer Science, pages 40-51. Springer-Verlag, 1988, 16-20 Aug. 1987.
22. J. Kilian. Achieving zero-knowledge robustly. In A. J. Menezes and S. A. Vanstone, editors, Advances in Cryptology - CRYPTO '90, volume 537 of Lecture Notes in Computer Science, pages 313-325. Springer-Verlag, 1991, 11-15 Aug. 1990.
23. A. R. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. In Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, pages 659-667, Atlanta, 1--4 May 1999.
24. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput., 17(2):373-386, Apr. 1988.
25. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. J. ACM, 39(4):859-868, Oct. 1992. (Pubitemid 23600385)
26. M. Naor and O. Reingold. On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract). In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 189-199, El Paso, Texas, 4-6 May 1997.
27. N. Nisan and A. Wigderson. Hardness vs randomness. J. Comput. Syst. Sci., 49(2):149-167, Oct. 1994. (Pubitemid 124013312)
28. T. Okamoto. On relationships between statistical zero-knowledge proofs. In Proceedings of the Twenty-Eighth Annual A CM Symposium on the Theory of Computing, pages 649-658, Philadelphia, Pennsylvania, 22-24 May 1996. See also preprint of full version, Oct. 1997.
29. R. Ostrovsky, R. Venkatesan, and M. Yung. Interactive hashing simplifies zero-knowledge protocol design. In Proceedings of Eurocrypt '93, Lecture Notes in Computer Science. Springer-Verlag, 1993.
30. A. Sahai and S. P. Vadhan. A complete promise problem for statistical zero-knowledge. In 38th Annual Symposium on Foundations of Computer Science, pages 448-457, Miami Beach, Florida, 20-22 Oct. 1997. IEEE.
31. A. Shamir. IP = PSPACE. J. ACM, 39(4):869-877, Oct. 1992. (Pubitemid 23600384)
32. S. Vadhan. A Study of Statistical Zero-Knowledge Proofs. PhD thesis, Massachusetts Institute of Technology, August 1999.