Image density is complete for non-interactive-SZK

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

Volumn 1443 LNCS, Issue , 1998, Pages 784-795

  De Santis, A ^a   Di Crescenzo, G ^b   Persiano, G ^a   Yung, M ^c  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c CertCo BTEC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

IMAGE DENSITY; PROMISE PROBLEMS; RANDOM STRING; STATISTICAL ZERO KNOWLEDGE; ZERO KNOWLEDGE;

STRUCTURAL PROPERTIES;

EID: 84878587775     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055102     Document Type: Conference Paper

References (25)

1. W. Aiello and J. Hástad, Statistical Zero Knowledge Can Be Recognized in Two Rounds, Journal of Computer and System Sciences, 42, 1991, pp. 327-345.
2. W. Aiello, M. Bellare and R. Venkatesan, Knowledge on the average - Perfect, Statistical and Logarithmic, in Proc. of STOC 95.
3. L. Babai and S. Moran, Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes, Journal of Computer and System Sciences, Vol. 36, 1988, pp. 254-276.
4. M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hástad, J. Kilian, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero Knowledge, in CRYPTO 88.
5. M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge, SIAM Journal of Computing, Vol. 20, No. 6, Dec 1991, pp. 1084-1118.
6. M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, in STOC 88.
7. L. Carter and M. Wegman, Universal Classes of Hash Functions, Journal of Computer and System Sciences, Vol. 18, 1979, pp. 143-154.
8. A. De Santis, G. Di Crescenzo, G. Persiano, The Knowledge Complexity of Quadratic Residuosity Languages, Theoretical Computer Science, Vol. 132, (1994), pag. 291-317.
9. A. De Santis, G. Di Crescenzo, G. Persiano, Randomness-Efficient Non-Interactive Zero-Knowledge, in Proc. of ICALP 97.
10. A. De Santis, G. Di Crescenzo, P. Persiano, and M. Yung, On Monotone Formula Closure of SZK, in FOCS 94.
11. L. Fortnow, The Complexity of Perfect Zero Knowledge, in STOC 87.
12. M. Garey e D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979.
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, Journal of the ACM, vol. 38, n. 1, 1991, pp. 691-729.
14. O. Goldreich and Y. Oren, Definitions and Properties of Zero-Knowledge Proof Systems, Journal of Cryptology, v. 7, n. 1, 1994.
15. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.
16. S. Goldwasser and M. Sipser, Private Coins versus Public Coins in Interactive Proof-Systems, in STOC 1986.
17. J. Hástad, R. Impagliazzo, L. Levin, and M. Luby, Construction of a Pseudo-Random Generator from One - Way Function, to appear in SIAM J. on Computing.
18. R. Impagliazzo and M. Yung, Direct Minimum Knowledge Computations, in CRYPTO 87.
19. R. Impagliazzo and D. Zuckerman, How to recycle random bits, in FOCS 89.
20. M. Naor and M. Yung, Public-Key Crypto systems Provably Secure against Chosen Ciphertext Attack, in STOC 90.
21. T. Okamoto, On Relationships Between Statistical Zero-Knowledge Proofs, in STOC 96.
22. R. Ostrovsky and A. Wigderson, One-way Functions are Essential for Non-Trivial Zero-Knowledge, in ISTCS 93.
23. A. Sahai and S. Vadhan, A Complete Promise Problem for Statistical Zero-Knowledge, in FOCS 97.
24. M. Sipser, A Complexity Theoretic Approach to Randomness, in STOC 83.
25. A. Shamir, IP=PSPACE, in FOCS 90.