Low communication 2-prover zero-knowledge proofs for NP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 740 LNCS, Issue , 1993, Pages 215-227

  Dwork, Cynthia ^a   Feige, Uri ^b   Kilian, Joe ^c   Naor, Moni ^a   Safra, Muli ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c NEC Research   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MAX-SAT; PERFECT ZERO-KNOWLEDGE; UNSATISFIABLE FORMULAS; ZERO KNOWLEDGE PROOF;

CRYPTOGRAPHY;

EID: 84957719173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48071-4_15     Document Type: Conference Paper

References (19)

1. N. Alon, J. H. Spencer, The Probabilistic Method, John Wiley & Sons, New- York, 1992.
2. S. Arora, C. Lund, R. Motwani, M. Szegedy and M. Sudan, Proof Verification and the Hardness of Approximations, Proc. 33rd IEEE Symp. on Foundation of Computer Science, 1992, to appear.
3. S. Arora and M. Safra Probabilistic Checking of Proofs Proc. 33rd IEEE Symp. on Foundation of Computer Science, 1992, to appear.
4. L. Babai, L. Fortnow, L. Levin and M. Szegedy Checking Computations in Poly- logarithmic Time Ptoc. 23rd ACM Symposium on Theory of Computing, 1991, pp. 21-31.
5. L. Babai, L. Fortnow, C. Lund, Non-Deterministic. Exponential Time has Two- Prover Interactive Protocols, Proc. 313t IEEE Symp. on Foundation of Computer Science, 1990, pp. 16-25.
6. 1, JCSS (38), 1989, pp. 150-164.
7. M. Ben-or, S. Goldwasser, J. Kilian, A. Wigderson, Multi Prover Interactive Proofs: How to Remove Intractability, Proc. 20f/l ACM Symposium on Theory of Computing, 1988, pp. 113-131.
8. J. Cai, A. Condon, R. Lipton, On Bounded Round Multi-Prover Interactive Proof Systems, Proc. of Structure in Complexity, 1990, pp. 45-54.
9. J. Cai, A. Condon, R. Lipton, Playing Games of Incomplete Information, STACS 1990.
10. J. Cai, A. Condon, R. Lipton, PSPACE is Provable by Two Provers in One Round, Proc. Structure in Complexity, 1991, pp. 110-115.
11. U. Feige, On the Success Probability of the Two Provers in One Round Proof Systems, Proc. Structure in Complexity, 1991, pp. 116-123.
12. U. Feige, S. Goldwasser, L. Lovasz, M. Safra, M. Szegedy, "Approximating Clique is Almost NP-Complete”, Proc. 32nd IEEE Symp. on Foundation of Computer Science, 1991, pp. 2-12.
13. U. Feige and L. Lovasz, Two-Provers One Round Proof Systems: Their Power and Their Problems, Proc. 24fft ACM Symposium on Theory of Computing, 1992
14. L. Fortnow, J. Rompel, M. Sipser, On the Power of Multi-Prover Interactive Protocols, Proc. of Structure in Complexity 1988, pp. 156-161. Erratum in Proc. Structure in Complexity, 1990, pp. 318-319.
15. J. Kilian, Use of Randomness in Algorithms and Protocols, MIT Press, 1990.
16. J. Kilian, Sirong Separation Models of Multi Prover Interactive Proofs, DIMACS Workshop on Cryptography, October 1990.
17. J. Kilian, A Note on Efficient Zero-Knowledge Proofs and Arguments, Proc. 24th ACM Symposium on Theory of Computing, 1992
18. D. Lapidot, A. Shamir, A One-Round, Two-Prover, Zero-Knowledge Protocol for NP, Crypto’91 abstracts.
19. D. Lapidot, A. Shajnir, Fully Parallelized Multi Prover Protocols for NEXP-time Proc. 32nd IEEE Symp. on Foundation of Computer Science, 1991, pp. 13-18.