Quantifying knowledge complexity

Computational Complexity

Volumn 8, Issue 1, 1999, Pages 50-98

  Goldreich, Oded ^a   Petrank, Erez ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

Interactive proofs; Knowledge complexity; Randomness; Zero knowledge

Indexed keywords

EID: 0033470841     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s000370050019     Document Type: Article

References (30)

1. W. AIELLO, M. BELLARE, AND R. VENKATESAN, Knowledge on the Average-Perfect, Statistical, and Logarithmic. Proc. 27th STOC, 1995, 469-478.
2. W. AIELLO AND J. HÅSTAD, Perfect Zero-Knowledge Languages can be Recognized in Two Rounds. JCSS 42 (1991), 327-345.
3. W. ALEXI, B. CHOR, O. GOLDREICH, AND C.P. SCHNORR, RSA/Rabin Functions: Certain Parts are As Hard As the Whole. SIAM J. Comp. 17:2 (1988), 194-209.
4. N. ALON, L. BABAI, AND A. ITAI, A Fast and Simple Randomized Algorithm for the Maximal Independent Set Problem. J. of Algorithms 7 (1986), 567-583.
5. L. BABAI, Trading group theory for randomness. Proc. 17th STOC, 1985, 421-429.
6. R. BAR-YEHUDA, B. CHOR, AND E. KUSHILEVITZ, Privacy, Additional Information, and Communication. 5th IEEE Structure in Complexity Theory, July 1990, 55-65.
7. M. BELLARE AND E. PETRANK, Making Zero Knowledge Provers Efficient. Proc. 24th STOC, 1992, 711-722.
8. M. BEN-OR, O. GOLDREICH, S. GOLDWASSER, J. HÅSTAD, J. KILIAN, S. MICALI, AND P. ROGAWAY, Everything Provable is Provable in Zero-Knowledge. Advances in Cryptology-Crypto88 (proceedings), Springer-Verlag, Lecture Notes in Computer Science, 403 (1990), 37-56.
9. T.M. COVER AND G.A. THOMAS, Elements of Information Theory. John Wiley & Sons, Inc., New York, 1991.
10. L. FORTNOW, The Complexity of Perfect Zero-Knowledge. Advances in Computing Research: a research annual, Vol. 5 (Randomness and Computation, S. Micali, ed.), 1989 327-343.
11. O. GOLDREICH, Foundations of Cryptography - Fragments of a Book. Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Israel, February 1995. Available from http://theory.lcs.mit.edu/~oded/frag.html and http://www.eccc.uni-trier.de/eccc/.
12. O. GOLDREICH AND H. KRAWCZYK, On the Composition of Zero-Knowledge Proof Systems. SIAM Journal on Computing 25:1 (1996), 169-192.
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. Jour, of ACM. 38 (1991), 691-729.
14. O. GOLDREICH AND Y. OREN, Definitions and Properties of Zero-Knowledge Proof Systems. Jour. of Cryptology 7 (1994), 1-32.
15. O. GOLDREICH, R. OSTROVSKY, AND E. PETRANK, Computational Complexity and Knowledge Complexity. SIAM J. on Comput., 27:4 (1998), 1116-1141. Extended Abstract in Proc. 26th ACM Symp. on Theory of Computation, May 1994, 534-543.
16. O. GOLDREICH, R. OSTROVSKY, AND E. PETRANK, Computational Complexity and Knowledge Complexity. SIAM J. on Comput., 27:4 (1998), 1116-1141. Extended Abstract in Proc. 26th ACM Symp. on Theory of Computation, May 1994, 534-543.
17. O. GOLDREICH AND E. PETRANK, Quantifying Knowledge Complexity. Proc. 32nd FOCS, 1991, 59-68.
18. S. GOLDWASSER AND S. MICALI, Probabilistic Encryption. JCSS 28:2 (1984), 270-299.
19. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The Knowledge Complexity of Interactive Proofs. PROC. 17TH STOC, 1985, 291-304.
20. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The Knowledge Complexity of Interactive Proof Systems. SIAM Jour, on Computing 18 (1989), 186-208.
21. S. GOLDWASSER, S. MICALI, AND P. TONG, Why and How to Establish a Private Code on a Public Network. Proc. 23rd FOCS, 1982, 134-144.
22. S. GOLDWASSER AND M. SIPSER, Private Coins vs. Public Coins in Interactive Proof Systems. Advances in Computing Research: a research annual, Vol. 5 (Randomness and Computation, S. Micali, ed.), 1989, Vol. 5, 73-90.
23. J. HÅSTAD, Perfect Zero-Knowledge in AM ∩ coAM. Unpublished (2-page) manuscript explaining the underlying ideas behind [2]. Available from the author, 1994.
24. R. IMPAGLIAZZO AND M. YUNG, Direct Minimum-Knowledge Computations. Advances in Cryptology - Crypto87 (proceedings), Springer-Verlag, Lectures Notes in Computer Science, Vol. 293, 1987, 40-51.
25. E. KUSHILEVITZ AND N. NISAN, Communication Complexity. Cambridge University Press, 1996.
26. G.L. MILLER, Riemann's Hypothesis and Tests for Primality. JCSS, 13 (1976), 300-317.
27. E. PETRANK AND G. TARDOS, On the Knowledge Complexity of NP. Proc. 37th FOCS, 1996, 494-503,
28. C.E. SHANNON, A mathematical theory of communication. Bell Sys. Tech. J. 27 (1948), 623-656.
29. A.C. YAO, Some complexity questions related to distributive computing. Proc. 11th STOC, 1979, 209-213,
30. A.C. YAO, Theory and Application of Trapdoor Functions. Proc. 23rd FOCS, pages 80-91, 1982.