Removing complexity assumptions from concurrent zero-knowledge proofs

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

Volumn 1858, Issue , 2000, Pages 426-435

  Di Crescenzo, Giovanni ^a  

^a TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLEXITY ASSUMPTIONS; CRYPTOGRAPHIC PROTOCOLS; DISTRIBUTED MODELING; PERFECT ZERO-KNOWLEDGE; PROOF SYSTEM; ZERO KNOWLEDGE; ZERO KNOWLEDGE PROOF; ZERO-KNOWLEDGE PROTOCOLS;

COMBINATORIAL MATHEMATICS;

EID: 84957006178     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44968-x_42     Document Type: Conference Paper

References (17)

1. M. Ben-Or, J. Hastad, J. Kilian, O. Goldreich, S. Goldwasser, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero-Knowledge, CRYPTO 88.
2. T. Beth and Y. Desmedt, Identification Tokens - or: Solving the Chess Grandmaster Problem, in Proc. of CRYPTO 90.
3. M. Blum, How to Prove a Theorem So No One Else Can Claim It, in Proc. of the International Congress of Mathematicians, 1986.
4. R. Boppana, J. Håstad, and S. Zachos, Does co-NP have Short Interactive Proofs?, in Inf. Proc. Lett., vol. 25, May 1987.
5. I. Damgaard, Interactive Hashing Simplifies Zero-Knowledge Protocol Design Without Complexity Assumptions, in Proc. of CRYPTO 93.
6. A. De Santis, G. Di Crescenzo, G. Persiano and M. Yung, On Monotone Formula Closure of SZK, in Proc. of FOCS 94.
7. G. Di Crescenzo and R. Ostrovsky, On Concurrent Zero-Knowledge with Pre-Processing, in Proc. of CRYPTO 99.
8. G. Di Crescenzo, K. Sakurai and M. Yung, On Zero-Knowledge Proofs: "From Membership to Decision", in Proc. of STOC 2000.
9. C. Dwork, M. Naor, and A. Sahai, Concurrent Zero-Knowledge, STOC 98.
10. C. Dwork and A. Sahai, Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints, in Proc. of CRYPTO 98.
11. L. Fortnow, The Complexity of Perfect Zero-Knowledge, in Proc. of STOC 87.
12. O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems, in Journal of the ACM, vol. 38, n. 1, 1991.
13. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, in SIAM Journal on Computing, vol. 18, n. 1, February 1989.
14. R. Impagliazzo and M. Yung, Direct Minimum-Knowledge Computation, in Proc. of CRYPTO 87.
15. J. Kilian, E. Petrank, and C. Rackoff, Lower Bounds for Zero-Knowledge on the Internet, in Proc. of FOCS 98.
16. R. Richardson and J. Kilian, On the Concurrent Composition of Zero-Knowledge Proofs, in Proc. of EUROCRYPT 99.
17. M. Tompa and H. Woll, Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information, in Proc. of FOCS 87.