On relationships between statistical zero-knowledge proofs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 649-658

  Okamoto, Tatsuaki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; INTERACTIVE COMPUTER SYSTEMS; PROBLEM SOLVING; STATISTICAL METHODS;

AUXILIARY INPUTS; BLACK-BOX SIMULATION; INTERACTIVE PROOFS; STATISTICAL ZERO KNOWLEDGE; ZERO KNOWLEDGE PROOF;

STATISTICS; THEOREM PROVING;

BLACK BOX SIMULATION; ZERO KNOWLEDGE INTERACTIVE PROOFS;

EID: 0029702972     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.238016     Document Type: Conference Paper

References (24)

1. Aiello, W. and Hastad, J.: Perfect Zero-Knowledge Languages can be Recognized in Two Rounds. Proc. of FOCS (1987) 439-448
2. Babai, L.: Trading Group Theory for Randomness. Proc. of STOC (1985) 421-429
3. Brassard, G., Chaum, D., and Crépeau, C: Minimum Disclosure Proofs of Knowledge. J. Computer and System Sciences, 37 (1988) 156-189
4. Bellare, M., Micali, S. and Ostrovsky, R.: The (True) Complexity of Statistical Zero-Knowledge. Proc. of STOC (1990) 494-502
5. Ben-Or, M., Goldwasser, S., Goldreich, O., Hastad, J., Kilian, J., M., Micali, S. and Rogaway, P.: Everything Provable is Provable in Zero-Knowledge. Proc. of Crypto'88, LNCS, 403, Springer-Verlag, (1989)
6. Damgard, I.: Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions. Proc. of Crypto'93, LNCS, Springer-Verlag, (1994) 100-109
7. Damgard, I., Goldreich, O., Okamoto, T. and Wigderson, A.: Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledg Proofs. Proc. of Crypto'95, LNCS, Springer-Verlag (1995)
8. Fortnow, L.: The Complexity of Perfect Zero-Knowledge. Advances in Computing Research (ed. S. Micali) Vol. 18 (1989)
9. Goldreich, O.: Foundation of Cryptography. Class Notes, Computer Science Dept., Technion, Haifa, Israel (1989)
10. Goldreich, O., Ostrovsky, R. and Petrank, E.: Computational Complexity and Knowledge Complexity. Proc. of STOC'94 (1994) 534-543
11. Goldreich, O., Levin, L.: A Hard-Core Predicate for any One-way Function. Proc. of STOC'89 (1989) 25-32
12. Goldreich, O., Mansour, Y. and Sipser, M.: Interactive Proof Systems: Provers that never Fail and Random Selection. Proc. FOCS (1987) 449-461
13. Goldwasser, S., Micali, S., Rackoff, C: The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput., 18, 1 (1989) 186-208
14. Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design. Proc. FOCS (1986) 174-187
15. Goldwasser, S. and Sipser, M, Private-Coin vs. Public Coins in Interactive Proof Systems. The Complexity of Perfect Zero-Knowledge. Advances in Computing Research (ed. S. Micali) Vol. 5 (1989) 73-90
16. Håstad, J.: Pseudo-Random Generators under Uniform Assumptions. Proc. of STOC (1990) 395-404
17. Hoeffding, W.: Probability Inequalities for Sums of Bounded Random Variables. American Statistical Association Journal (1963) 13-30
18. Impagliazzo, R., Levin, L., Luby, L.: Pseudo-Random Number Generation from One-Way Functions. Proc. of STOC (1989) 12-24
19. Impagliazzo, R., Yung, M.: Direct Minimum-Knowledge Computations. Proc. of Crypto'87, LNCS 293, Springer-Verlag (1988) 40-51
20. Naor, M.: Bit Commitment Using Pseudo-Randomness. Proc. of Crypto'89, LNCS 435, Springer-Verlag, (1990) 128-136
21. Oren, Y.: On the Cunning Power of Cheating Verifiers. Proc. of FOCS'87 (1987) 472-482
22. Ostrovsky, R., Venkatesan, R. and Yung, M.: Interactive Hashing Simplifies Zero-Knowledge Protocol Design. Proc. of Eurocrypt'93, LNCS, Springer-Verlag (1994)
23. Ostrovsky, R. and Wigderson, M.: One-Way Functions are Essential for Non-Trivail Zero-Knowledge. Proc. of Israeli Symposium on Theory of Computing and Systems (1993) 3-17
24. Sipser, M.: A Complexity Theoretical Approach to Randomness. STOC (1983) 330-335