Robust non-interactive zero knowledge

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

Volumn 2139 LNCS, Issue , 2001, Pages 566-598

  De Santis, Alfredo ^a   Di Crescenzo, Giovanni ^b   Ostrovsky, Rafail ^b   Persiano, Giuseppe ^a   Sahai, Amit ^c  

^a UNIVERSITY OF SALERNO   (Italy)

^b TELCORDIA TECHNOLOGIES   (United States)

^c Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS; SECURITY OF DATA; PUBLIC KEY CRYPTOGRAPHY;

ARBITRARY POLYNOMIAL; CHOSEN CIPHERTEXT ATTACK; CRYPTOGRAPHIC PRIMITIVES; FIRST CONSTRUCTIONS; NON-INTERACTIVE ZERO KNOWLEDGE; PROVABLY SECURE; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC-KEY ENCRYPTION SCHEME; CIPHER TEXT ATTACKS; IN-BUILDINGS; NON-MALLEABLE; RANDOM STRING; ZERO KNOWLEDGE;

PUBLIC KEY CRYPTOGRAPHY; CRYPTOGRAPHY;

EID: 84880875026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44647-8_33     Document Type: Conference Paper

References (39)

1. M. Blum, A. De Santis, S. Micali and G. Persiano, Non-Interactive Zero-Knowledge Proofs. SIAM Journal on Computing, vol. 6, December 1991, pp. 1084-1118.
2. M. Blum, P. Feldman and S. Micali, Non-interactive zero-knowledge and its applications. Proceedings of the 20th Annual Symposium on Theory of Computing, ACM, 1988.
3. G. Brassard, D. Chaum and C. Crépeau, Minimum Disclosure Proofs of Knowledge. JCSS, v. 37, pp 156-189.
4. M. Bellare, S. Goldwasser, New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs. Advances in Cryptology - Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989.
5. R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali. Resettable Zero-Knowledge. ECCC Report TR99-042, revised June 2000. Available from http://www.eccc.uni-trier.de/eccc/.Preliminary version appeared in ACM STOC 2000.
6. R. Canetti, J. Kilian, E. Petrank, and A. Rosen Black-Box Concurrent Zero-Knowledge Requires Ω̃(log n) Rounds. Proceedings of the - 67th Annual Symposium on Theory of Computing, ACM, 1901.
7. R. Cramer and V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. Advances in Cryptology - Crypto 98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998.
8. A. De Santis and G. Persiano, Zero-knowledge proofs of knowledge without interaction. Proceedings of the 33rd Symposium on Foundations of Computer Science, IEEE, 1992.
9. A. De Santis, G. Di Crescenzo and G. Persiano, Randomness-efficient Non-Interactive Zero-Knowledge. Proceedings of 1997 International Colloquium on Automata, Languagues and Applications (ICALP 1997).
10. A. De Santis, G. Di Crescenzo and G. Persiano, Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP. Proceedings of 1999 International Colloquium on Automata, Languagues and Applications (ICALP 1999).
11. A. De Santis, G. Di Crescenzo and G. Persiano, Necessary and Sufficient Assumptions for Non-Interactive Zero-Knowledge Proofs of Knowledge for all NP Relations. Proceedings of 2000 International Colloquium on Automata, Languagues and Applications (ICALP 2000).
12. G. Di Crescenzo, Y. Ishai, and R. Ostrovsky, Non-Interactive and Non-Malleable Commitment. Proceedings of the 30th Annual Symposium on Theory of Computing, ACM, 1998.
13. D. Dolev, C. Dwork, and M. Naor, Non-Malleable Cryptography. Proceedings of the - 45th Annual Symposium on Theory of Computing, ACM, 1923
14. and SIAM Journal on Computing, 2000.
15. C. Dwork, M. Naor, and A. Sahai, Concurrent Zero-Knowledge. Proceedings of the 30th Annual Symposium on Theory of Computing, ACM, 1998.
16. U. Feige, D. Lapidot, and A. Shamir, Multiple non-interactive zero knowledge proofs based on a single random string. In 31st Annual Symposium on Foundations of Computer Science, volume I, pages 308-317, St. Louis, Missouri, 22-24 October 1990. IEEE.
17. O. Goldreich, Secure Multi-Party Computation, 1998. First draft available at http://theory.lcs.mit.edu/~oded
18. O. Goldreich and L. Levin, A Hard Predicate for All One-way Functions. Proceedings of the 21st Annual Symposium on Theory of Computing, ACM, 1989.
19. O. Goldreich, S. Goldwasser and S. Micali, How to construct random functions. Journal of the ACM, Vol. 33, No. 4, 1986, pp. 210-217.
20. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. Proceedings of the 19th Annual Symposium on Theory of Computing, ACM, 1987.
21. 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 ACM 38(3): 691-729 (1991).
22. S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186-208, February 1989.
23. S. Goldwasser, R. Ostrovsky Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent. Advances in Cryptology - Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740, E. Brickell ed., Springer-Verlag, 1992.
24. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby, Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing.
25. Preliminary versions by Impagliazzo et. al. in 21st STOC (1989)
26. and Håstad in 22nd STOC (1990).
27. J. Kilian, E. Petrank An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions, Journal of Cryptology, vol. 11, n. 1, 1998.
28. J. Kilian, E. Petrank Concurrent and Resettable Zero-Knowledge in Polylogarithmic Rounds. Proceedings of the - 67th Annual Symposium on Theory of Computing, ACM, 1901
29. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP can be based on general complexity assumptions. Advances in Cryptology - Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740, E. Brickell ed., Springer-Verlag, 1992
30. and J. Cryptology, 11(2):87-108, 1998.
31. M. Naor, Bit Commitment Using Pseudo-Randomness, Journal of Cryptology, vol 4, 1991, pp. 151-158.
32. M. Naor and M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks. Proceedings of the 22nd Annual Symposium on Theory of Computing, ACM, 1990.
33. M. Naor and M. Yung, "Universal One-Way Hash Functions and their Cryptographic Applications", Proceedings of the 21st Annual Symposium on Theory of Computing, ACM, 1989.
34. R. Ostrovsky One-way Functions, Hard on Average Problems and Statistical Zero-knowledge Proofs. In Proceedings of 6th Annual Structure in Complexity Theory Conference (STRUCTURES-91) June 30 - July 3, 1991, Chicago. pp. 51-59
35. R. Ostrovsky, and A. Wigderson One-Way Functions are Essential for NonTrivial Zero-Knowledge. Appeared In Proceedings of the second Israel Symposium on Theory of Computing and Systems (ISTCS-93) Netanya, Israel, June 7th-9th, 1993.
36. C. Rackoff and D. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. Advances in Cryptology - Crypto 91 Proceedings, Lecture Notes in Computer Science Vol. 576, J. Feigenbaum ed., Springer-Verlag, 1991.
37. A. Sahai Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. Proceedings of the 40th Symposium on Foundations of Computer Science, IEEE, 1999
38. A. Sahai and S. Vadhan A Complete Problem for Statistical Zero Knowledge.
39. Preliminary version appeared in Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997. Newer version may be obtained from authors' homepages.