On concurrent zero-knowledge with pre-proeessing

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

Volumn 1666, Issue , 1999, Pages 485-502

  Di Crescenzo, Giovanni ^a   Ostrovsky, Rafail ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

POLYNOMIAL NUMBER; PREPROCESSING PHASE; TIMING ASSUMPTIONS; ZERO KNOWLEDGE; ZERO KNOWLEDGE PROOF; ZERO-KNOWLEDGE PROTOCOLS;

CRYPTOGRAPHY;

EID: 84957093995     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48405-1_31     Document Type: Conference Paper

References (25)

1. D. Beaver, Adaptive Zero-Knowledge and Computational Equivocation, Proc. of FOCS 96.
2. M. Ben-Or, J. Hastad, J. Kilian, O. Goldreich, S. Goldwasser, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero-Knowledge, Proc. of CRYPTO 88.
3. T. Beth and Y. Desmedt, Identification Tokens - or: Solving the Chess Grandmaster Problem, Proc. of CRYPTO 90.
4. G. Brassard, D. Chaum, and C. Crepeau, Minimum Disclosure Proofs of Knowledge, Journal of Computer and System Sciences, vol. 37, n. 2, 1988, pp. 156-189.
5. M. Blum, How to Prove a Theorem, So No One Else Can Claim, It, Proc. of the International Congress of Mathematicians, California, 1986, pp. 1444-1451.
6. A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung, On, Monotone Formula Closure of SZK, Proc. of FOCS 94.
7. A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof Systems with, Preprocessing, Proc. of CRYPTO 88.
8. G. Di Crescenzo, A Note on, Distributed Zero-Knowledge Proofs, unpublished manuscript (submitted to PODC, January 1997).
9. G. Di Crescenzo, Y. Ishai, and R. Ostrovsky, Non-Interactive and Non-Malleable Commitment, Proc. of STOC 98.
10. D. Dolev, C. Dwork, and M. Naor, Non-Malleable Cryptography, Proc. of STOC 91.
11. C. Dwork, M. Naor, and A. Sahai, Concurrent Zero-Knowledge, Proc. of STOC 98.
12. C. Dwork and A. Sahai, Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints, Proc. of CRYPTO 98.
13. U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs based on, a Single Random, String, Proc. of FOCS 90.
14. U. Feige and A. Shamir, Zero-Knowledge Proofs of Knowledge in, Two Rounds, Proc. of CRYPTO 89.
15. O. Goldreich, Foundations of Cryptography: Fragments of a Book, in Electronic Colloquium on Computational Complexity.
16. O. Goldreich and A. Kahan, How to construct constant-round zero-knowledge proof systems for NP, in Journal of Cryptology, vol. 9, n. 3, pp. 167-190.
17. 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.
18. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.
19. R. Impagliazzo and M. Yung, Direct Minimum-Knowledge Computation, Proc. of CRYPTO 87.
20. J. Kilian, E. Petrank, and C. Rackoff, Lower Bounds for Zero-Knowledge on, the Internet, Proc. of FOCS 98.
21. M. Naor, Bit Commitment from, Pseudo-Randomness, Proc. of CRYPTO 91.
22. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung, Perfect Zero-Knowledge Arguments under General Complexity Assumptions, Proc. of CRYPTO 92.
23. T. Pedersen, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, Proc. of CRYPTO 91.
24. R. Richardson and J. Kilian, On the Concurrent Composition of Zero-Knowledge Proofs, Proc. of EUROCRYPT 99.
25. M. Tompa and H. Woll, Random, Self-Reductibility and Zero-Knowledge Interactive Proofs of Possession, of Information, Proc. of FOCS 87.