On the knowledge complexity of NP

Combinatorica

Volumn 22, Issue 1, 2002, Pages 83-121

  Petrank, Erez ^a   Tardos, Gábor ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036436331     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930200005     Document Type: Article

References (31)

1. W. Aiello, M. Bellare and R. Venkatesan: Knowledge on the Average - Perfect, Statistical and Logarithmic, Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, ACM (1995).
2. W. Aiello and J. Håstad: Perfect Zero-Knowledge can be Recognized in Two Rounds, JCSS, Vol. 42 (1991), 327-345.
3. L. Babai: Trading Group Theory for Randomness, Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, ACM (1985).
4. L. Babai and S. Moran: Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes, JCSS, Vol. 36 (1988), 254-276.
5. R. Bar-Yehuda, B. Chor, E. Kushilevitz, and A. Orlitsky: Privacy, Additional Information, and Communication, IEEE Transactions on Information Theory, Vol. 39, No. 6, November 1993, 1930-1943.
6. M. Bellare, S. Micali and R. Ostrovsky: The (True) Complexity of Statistical Zero-Knowledge, Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, ACM (1990).
7. M. Bellare and E. Petrank: Making Zero-Knowledge Provers Efficient, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, ACM (1992).
8. M. Ben-Or, S. Goldwasser, O. Goldreich, J. Håstad, J. Kilian, S. Micali and P. Rogaway: Everything Provable is Provable in Zero-Knowledge, Advances in Cryptology-Proceedings of CRYPTO 88, (S. Goldwasser, ed), Lecture Notes in Computer Science 403, Springer-Verlag (1989).
9. R. Boppana, J. Håstad and S. Zachos: Does co-NP Have Short Interactive Proofs, Information Processing Letters, Vol 25 (1987), No. 2, 127-132.
10. L. Carter and M. Wegman: Universal Classes of Hash Functions, J. Computer and System Sciences 18 (1979), 143-154.
11. L. Fortnow: The Complexity of Perfect Zero-Knowledge, Advances in Computing Research (ed. S. Micali) Vol. 18 (1989).
12. M. Furer, O. Goldreich, Y. Mansour, M. Sipser and S. Zachos: On Completeness and Soundness in Interactive Proof Systems, Advances in Computing Research: A Research Annual, Vol. 5, Randomness and Computation (ed. S. Micali), 1989, 429-442.
13. O. Goldreich, S. Micali, and A. Wigderson: Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design, Proc. 27th FOCS 86, See also Jour. of ACM. Vol 38, No 1, July (1991), 691-729.
14. O. Goldreich, S. Micali, and A. Wigderson: How to Play any Mental Game or a Completeness Theorems for Protocols of Honest Majority, STOC87.
15. O. Goldreich and E. Petrank: Quantifying Knowledge Complexity, Proceedings of the 32nd Annual IEEE Symposium on the Foundations of Computer Science, IEEE (1991). Submitted for publication, 1995.
16. O. Goldreich and S. Vadhan: Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of this Class, in: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999.
17. S. Goldwasser, S. Micali, and C. Rackoff: The Knowledge Complexity of Interactive Proofs, Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, ACM (1985).
18. S. Goldwasser, S. Micali, and C. Rackoff: The Knowledge Complexity of Interactive Proofs, SIAM J. Comput. 18 (1) (1989), 186-208.
19. O. Goldreich, R. Ostrovsky, and E. Petrank: Computational Complexity and Knowledge Complexity, To appear in SIAM Journal on Computing. A preliminary version appeared in 26th ACM Symp. on Theory of Computation, May 1994, 534-543.
20. S. Goldwasser, and M. Sipser: Private Coins vs. Public Coins in Interactive Proof Systems, Advances in Computing Research (ed. S. Micali), Vol. 5 (1989), 73-90.
21. J. Håstad: Perfect Zero-Knowledge, in: AMco-AM. Unpublished 2-page manuscript explaining the underlying ideas behind [2], 1994.
22. W. Hoeffding: Probability Inequalities for Sums of Bounded Random Variables, Amer. Stat. Assoc. Jour., March (1963), 13-30.
23. R. Impagliazzo and M. Yung: Direct Minimum-Knowledge computations, Advances in Cryptology-Proceedings of CRYPTO 87, Lecture Notes in Computer Science 293, Springer-Verlag (1987).
24. M. Jerrum, L. Valiant and V. Vazirani: Random Generation of Combinatorial Structures from a Uniform Distribution. Theoretical Computer Science 43 (1986), 169-188.
25. C. Lund, L. Fortnow, H. Karloff and N. Nisan: Algebraic Methods for Interactive Proof Systems, Journal of the ACM, 39 (04) (1992), 859-868.
26. T. Okamoto: On relationships between statistical zero-knowledge proofs, in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 1997, 649-658.
27. E. Petrank and G. Tardos: On the knowledge complexity of NP, in: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, 494-503.
28. A. Shamir: IP = PSPACE, Journal of the ACM, 39(4), (1992), 869-877. A preliminary version appeared in Proc. 22nd ACM Symp. on Theory of Computing, 1990, 11-15.
29. A. Shamir: IP = PSPACE, Journal of the ACM, 39(4), (1992), 869-877. A preliminary version appeared in Proc. 22nd ACM Symp. on Theory of Computing, 1990, 11-15.
30. M. Sipser: A Complexity Theoretic Approach to Randomness, Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, ACM (1983).
31. L. Stockmeyer: The Complexity of Approximate Counting, Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, ACM (1983).