On relationships between statistical zero-knowledge proofs

Journal of Computer and System Sciences

Volumn 60, Issue 1, 2000, Pages 47-108

  Okamoto, Tatsuaki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CHEBYSHEV APPROXIMATION; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; MATHEMATICAL TRANSFORMATIONS; NETWORK PROTOCOLS; PIECEWISE LINEAR TECHNIQUES; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES; STATISTICAL METHODS;

BLACK BOX SIMULATION; PUBLIC COIN; STATISTICAL ZERO KNOWLEDGE INTERACTIVE PROOFS;

THEOREM PROVING;

EID: 0034140357     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1664     Document Type: Article

References (31)

1. [AH91] W. Aiello and J. Håstad, Statistical zero-knowledge languages can be recognized in two rounds, J. Comput. System Sci. 42 (1991), 327-345.
2. [Bab85] L. Babai, Trading group theory for randomness, in "Proc. of STOC, 1985," pp. 421-429.
3. [BCC88] G. Brassard, D. Chaum, and C. Crépeau, Minimum disclosure proofs of knowledge, J. Comput. System Sci. 37 (1988), 156-189.
4. [BHZ87] R. Boppana, J. Håstad, and S. Zachos, Does Co-NP have short interactive proofs?. IPL, 25 (1987), 127-132.
5. [BMO90] M. Bellare, S. Micali, and R. Ostrovsky, The (true) complexity of statistical zero-knowledge, in "Proc. of STOC, 1990," pp. 494-502.
6. [B + 88] M. Ben-Or, S. Goldwasser, O. Goldreich, J. Hastad, J. M. Kilian, S. Micali, and P. Rogaway, Everything provable is provable in zero-knowledge, in "Proc. of Crypto'88," Lecture Notes in Computer Science, Vol. 403, Springer-Verlag, Berlin, 1989.
7. [Dam93] I. Damgård, Interactive hashing can simplify zero-knowledge protocol design without computational assumptions, in "Proc. of Crypto'93," Lecture Notes in Computer Science, pp. 100-109, Springer-Verlag, Berlin, 1994.
8. [DGOW95] I. Damgård, O. Goldreich, T. Okamoto, and A. Wigderson, Honest verifier vs dishonest verifier in public coin zero-knowledge proofs, in "Proc. of Crypto'95," Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1995.
9. [For89] L. Fortnow, The complexity of perfect zero-knowledge, in "Advances in Computing Research" (S. Micali, Ed.), Vol. 18, 1989.
10. [Gol95] O. Goldreich, "Foundation of Cryptography - Fragments of a Book," 1995. [Available from the Electronic Colloquium on Computational Complexity (ECCC), http://www.eccc.uni-trier.de/eccc/.]
11. [GOP94] O. Goldreich, R. Ostrovsky, and E. Petrank, Computational complexity and knowledge complexity, in "Proc. of STOC'94," pp. 534-543, 1994.
12. [GL89] O. Goldreich and L. Levin, A hard-core predicate for any one-way function, in "Proc. of STOC'89, 1989," pp. 25-32.
13. [GMR89] S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM J. Comput. 18 (1989), 186-208.
14. [GMS87] O. Goldreich, Y. Mansour, and M. Sipser, Interactive proof systems: Provers that never fail and random selection, in "Proc. FOCS, 1987," pp. 449-461.
15. [GMW86] O. Goldreich, S. Micali, and A. Wigderson, Proofs that yield nothing but their validity and a methodology of cryptographic protocol design, in "Proc. FOCS, 1986," pp. 174-187.
16. [GP91] O. Goldreich and E. Petrank, Quantifying knowledge complexity, in "Proc. of FOCS, 1991," pp. 59-68.
17. [GS89] S. Goldwasser and M. Sipser, Private-coin vs. public coins in interactive proof systems. The complexity of perfect zero-knowledge, in "Advances in Computing Research" (S. Micali, Ed.), Vol. 5, pp. 79-90, 1989.
18. [GSV98] O. Goldreich, A. Sahai, and S. Vadhan, Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge, in "Proc. of STOC, 1998," pp. 409-418.
19. [Has90] J. Håstad, Pseudo-random generators under uniform assumptions, in "Proc. of STOC, 1990," pp. 395-404.
20. [Hoe63] W. Hoeffding, Probability inequalities for sums of bounded random variables, Amer. Statist. Assoc. J. (1963), 13-30.
21. [ILL89] R. Impagliazzo, L. Levin, and L. Luby, Pseudo-random number generation from one-way functions, in "Proc. of STOC, 1989," pp. 12-24.
22. [IY87] R. Impagliazzo and M. Yung, Direct minimum-knowledge computations, in "Proc. of Crypto'87," Lecture Notes in Computer Science, Vol. 293, pp. 40-51, Springer-Verlag, Berlin, 1988.
23. [LFKN90] C. Lund, L. Fortnow, H. Karloff, and N. Nisan, Algebraic methods for interactive proof systems, in "Proc. of FOCS, 1990," pp. 2-10.
24. [Nao90] M. Naor, Bit commitment using pseudo-randomness, in "Proc. of Crypto'89," Lecture Notes in Computer Science, Vol. 435, pp. 128-136, Springer-Verlag, Berlin, 1990.
25. [Oka96] T. Okamoto, On relationships between statistical zero-knowledge proofs, in "Proc. of STOC'96, 1986," pp. 649-658.
26. [Ore87] Y. Oren, On the cunning power of cheating verifiers, in "Proc. of FOCS'87, 1987," pp. 472-482.
27. [OVY93] R. Ostrovsky, R. Venkatesan, and M. Yung, Interactive hashing simplifies zero-knowledge protocol design, in "Proc. of Eurocrypt'93," Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1994.
28. [OW93] R. Ostrovsky and M. Wigderson, One-way functions are essential for non-trivial zero-knowledge, in "Proc. of Israeli Symposium on Theory of Computing and Systems, 1993," pp. 3-17.
29. [Sha92] A. Shamir, IP = PSPACE, Assoc. Comput. Mach. 39 (1992), 869-877.
30. [Sip83] M. Sipser, A complexity theoretical approach to randomness, in "STOC, 1983," pp. 330-335.
31. [SV97] A. Sahai and S. Vadhan, A complete promise problem for statistical zero-knowledge, in "Proc. of FOCS, 1997," pp. 448-457.