Perfect non-interactive zero knowledge for NP

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

Volumn 4004 LNCS, Issue , 2006, Pages 339-358

  Groth, Jens ^a   Ostrovsky, Rafail ^a   Sahai, Amit ^a  

^a University of California   (United States)

Author keywords

Non Malleability; Non interactive zero knowledge; Universal composability

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

CRYPTOGRAPHIC PROTOCOLS; NON-INTERACTIVE ZERO-KNOWLEDGE (NIZK); UNIVERSAL COMPOSABILITY;

CRYPTOGRAPHY;

EID: 33746072569     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11761679_21     Document Type: Conference Paper

References (35)

1. William Aiello and Johan Håstad. Perfect zero-knowledge languages can be recognized in two rounds. In Proceedings of FOCS '87, pages 439-448, 1987.
2. Manuel Blum, Alfredo De Santis, Silvio Micali, and Giuseppe Persiano. Noninteractive zero-knowledge. SIAM Jornal of Computation, 20(6):1084-1118, 1991.
3. Manuel Blum, Paul Feldman, and Silvio Micali. Non-interactive zero-knowledge and its applications. In proceedings of STOC '88, pages 103-112, 1988.
4. Dan Boneh, Eu-Jin Goh, and Kobbi Nissim. Evaluating 2-dnf formulas on ciphertexts. In proceedings of TCC '05, LNCS series, volume 3378, pages 325-341, 2005.
5. Gilles Brassard, David Chaum, and Claude Crèpeau. Minimum disclosure proofs of knowledge. JCSS, 37(2):156-189, 1988.
6. Gilles Brassard and Claude Crèpeau. Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for sat and beyond. In Proceedings of FOCS '86, pages 188-195, 1986.
7. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In proceedings of FOCS '01, pages 136-145, 2001. Full paper available at http://eprint.iacr.org/2000/067.
8. Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In proceedings of STOC '02, pages 494-503, 2002. Full paper available at http://eprint.iacr.org/2002/140.
9. Ivan Damgård. Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with proprocessing. In proceedings of EUROCRYPT '92, LNCS series, volume 658, pages 341-355, 1992.
10. Ivan Damgård and Jens Groth. Non-interactive and reusable non-malleable commitment schemes. In proceedings of STOC '03, pages 426-437, 2003.
11. Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, and Amit Sahai. Robust non-interactive zero knowledge. In proceedings of CRYPTO '01, LNCS series, volume 2139, pages 566-598, 2002.
12. Alfredo De Santis, Giovanni Di Crescenzo, and Giuseppe Persiano. Non-interactive zero-knowledge: A low-randomness characterization of np. In proceedings of ICALP '99, LNCS series, volume 1644, pages 271-280, 1999.
13. Alfredo De Santis, Giovanni Di Crescenzo, and Giuseppe Persiano. Randomness-optimal characterization of two np proof systems. In proceedings of RANDOM '02, LNCS series, volume 2483, pages 179-193, 2002.
14. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, and Moti Yung. Image density is complete for non-interactive-szk. In proceedings of ICALP '98, LNCS series, volume 1443, pages 784-795, 1998.
15. Giovanni Di Crescenzo, Yvail Ishai, and Rafail Ostrovsky. Non-interactive and non-malleable commitment. In proceedings of STOC '98, pages 141-150, 1998.
16. Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, and Adam Smith. Efficient and non-interactive non-malleable commitment. In proceedings of EUROCRYPT '01, pages 40-59, 2001.
17. Danny Dolev, Cynthia Dwork, and Moni Naor. Non-malleable cryptography. SIAM J. of Computing, 30(2):391-437, 2000.
18. Earlier version at STOC '91.
19. Uriel Feige, Dror Lapidot, and Adi Shamir. Multiple non-interactive zero knowledge proofs under general assumptions. SIAM J. Comput., 29(1):1-28, 1999.
20. Earlier version entitled Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String appeared at FOCS '90.
21. Lance Fortnow. The complexity of perfect zero-knowledge. In Proceedings of STOC '87, pages 204-209, 1987.
22. Juan A. Garay, Philip D. MacKenzie, and Ke Yang. Strengthening zero-knowledge protocols using signatures. In proceedings of EUROCRYPT '03, LNCS series, volume 2656, pages 177-194, 2003. Full paper available at http://eprint.iacr.org/2003/037.
23. Oded Goldreich and Leonid A. Levin. A hard-core predicate for all one-way functions. In proceedings of STOC '89, pages 25-32, 1989.
24. Oded Goldreich, Rafail Ostrovsky, and Erez Petrank. Computational complexity and knowledge complexity. SIAM J. Comput., 27:1116-1141, 1998.
25. Oded Goldreich, Amit Sahai, and Salil P. Vadhan. Can statistical zero knowledge be made non-interactive? or on the relationship of szk and niszk. In CRYPTO '99, LNCS series, volume 1666, pages 467-484, 1999.
26. Jens Groth. Honest verifier zero-knowledge arguments applied. Dissertation Series DS-04-3, BRICS, 2004. PhD thesis, xii+119 pp.
27. Jens Groth. Cryptography in subgroups of ℤn*. In proceedings of TCC '05, LNCS series, volume 3378, pages 50-65, 2005.
28. Jens Groth, Rafail Ostrovsky, and Amit Sahai. Perfect non-interactive zero-knowledge for np. ECCC Report TR05-097, http://eccc.uni-trier.de/eccc- reports/2005/TR05-097/index.html, 2005.
29. Joe Kilian and Erez Petrank. An efficient noninteractive zero-knowledge proof system for np with general assumptions. Journal of Cryptology, 11(1):1-27, 1998.
30. Philip D. MacKenzie and Ke Yang. On simulation-sound trapdoor commitments. In proceedings of EUROCRYPT '04, LNCS series, volume 3027, pages 382-400, 2004. Full paper available at http://eprint.iacr.org/2003/252.
31. Rafail Ostrovsky. One-way functions, hard on average problems, and statistical zero-knowledge proofs. In Proceedings of Structure in Complexity Theory Conference, pages 133-138, 1991.
32. Rafael Pass. On deniability in the common reference string and random oracle model. In proceedings of CRYPTO '03, LNCS series, volume 2729, pages 316-337, 2003.
33. Rafael Pass and Abhi Shelat. Characterizing non-interactive zero-knowledge in the public and secret parameter models. In proceedings of CRYPTO '05, LNCS series, 2005.
34. Amit Sahai. Non-malleable non-interactive zero-knowledge and adaptive chosenciphertext security. In proceedings of FOCS '01, pages 543-553, 2001.
35. Amit Sahai and Salil P. Vadhan. A complete problem for statistical zero knowledge. J. ACM, 50(2):196-249, 2003.