Perfect NIZK with adaptive soundness

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

Volumn 4392 LNCS, Issue , 2007, Pages 118-136

  Abe, Masayuki ^a   Fehr, Serge ^b  

^a NTT CORPORATION   (Japan)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; KNOWLEDGE MANAGEMENT; LOGIC CIRCUITS;

ARITHMETIC CIRCUITS; COMMON REFERENCE STRING (CRS); KNOWLEDGE-OF-EXPONENT ASSUMPTION (KEA); NIZK ARGUMENT SYSTEM;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38049027731     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_7     Document Type: Conference Paper

References (34)

1. M. Abe and S. Fehr. Perfect NIZK with adaptive soundness. Cryptology ePrint Archive, Report 2006/423, 2006. http://eprint.iacr.org.
2. L. M. Adleman. Two theorems on random polynomial time. In 19th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1978.
3. W. Aiello and J. Håstad. Perfect zero-knowledge languages can be recognized in two rounds. In 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1987.
4. D. Beaver. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology - CRYPTO '91, volume 576 of Lecture Notes in Computer Science. Springer, 1991.
5. M. Bellare and A. Palacio. The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In Advances in Cryptology - CRYPTO '04, volume 3152 of Lecture Notes in Computer Science. Springer, 2004.
6. M. Blum, A. De Santis, S. Micali, and G. Persiano. Non-interactive zero-knowledge proof systems. SIAM Journal on Computing, 20(6), 1991.
7. M. Blum, P. Feldman, and S. Micali. Non-interactive zero-knowledge and its applications. In 20th Annual ACM Symposium on Theory of Computing (STOC), 1988.
8. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Science, 37(2), 1988.
9. G. Brassard and C. Crépeau. Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond. In 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1987.
10. R. Canetti. Universally composable security: a new paradigm for cryptographic protocols. In 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2001. Full version available from http://eprint.iacr.org/2000/067.
11. R. Canetti, Y. Dodis, R. Pass, and S. Walfish. Universally composable security with global setup. In Theory of Cryptography Conference (TCC), Lecture Notes in Computer Science. Springer, 2007.
12. R. Cramer, I. B. Damgård, and Y. Ishai. Share conversion, pseudorandom secret-sharing and applications to secure computation. In Theory of Cryptography Conference (TCC), volume 3378 of Lecture Notes in Computer Science. Springer, 2005.
13. R. Cramer, I. B. Damgård, and P. MacKenzie. Efficient zero-knowledge proofs of knowledge without intractability assumptions. In Practice and Theory in Public Key Cryptography (PKC), volume 1751 of Lecture Notes in Computer Science. Springer, 2000.
14. I. B. Damgård. Towards practical public-key cryptosystems provably-secure against chosen ciphertext attacks. In Advances in Cryptology - CRYPTO '91, volume 576 of Lecture Notes in Computer Science. Springer, 1991.
15. I. B. Damgård. Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing. In Advances in Cryptology - EUROCRYPT '92, volume 658 of Lecture Notes in Computer Science. Springer, 1992.
16. I. B. Damgård and Y. Ishai. Constant-round multiparty computation using a black-box pseudorandom generator. In Advances in Cryptology - CRYPTO '05, volume 3621. of Lecture Notes in Computer Science. Springer, 2005.
17. A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust non-interactive zero knowledge. In Advances in Cryptology - CRYPTO '01, volume 2139 of Lecture Notes in Computer Science. Springer, 2001.
18. A. De Santis, S. Micali, and G. Persiano. Non-interactive zero-knowledge with preprocessing. In Advances in Cryptology - CRYPTO '88, volume 403 of Lecture Notes in Computer Science. Springer, 1988.
19. A. De Santis and G. Persiano. Zero-knowledge proofs of knowledge without interaction. In 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1992.
20. A. W. Dent. The hardness of the DHK problem in the generic group model. Cryptology ePrint Archive, Report 2006/156, 2006. http://eprint.iacr.org.
21. C. Dwork and M. Naor. Zaps and their applications. In 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2000.
22. U. Feige, D. Lapidot, and A. Shamir. Multiple non-interactive zero-knowledge proofs based on a single random string. In 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1990.
23. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology - CRYPTO '86, volume 263 of Lecture Notes in Computer Science. Springer, 1986.
24. L. Fortnow. The complexity of perfect zero-knowledge. In 19th Annual ACM Symposium on Theory of Computing (STOC), 1987.
25. 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, 38(3), 1991.
26. J. Groth, R. Ostrovsky, and A. Sahai. Perfect non-interactive zero knowledge for NP. In Advances in Cryptology - EUROCRYPT '06, volume 4004 of Lecture Notes in Computer Science. Springer, 2006.
27. S. Hada and T. Tanaka. On the existence of 3-round zero-knowledge protocols. In Advances in Cryptology-CRYPTO '98, volume 1462 of Lecture Notes in Computer Science. Springer, 1998. Full version available from http://eprint.iacr.org/1999/009.
28. J. Kilian, S. Micali, and C. Rackoff. Minimum resource zero-knowledge proofs. In Advances in Cryptology - CRYPTO '89, volume 435 of Lecture Notes in Computer Science. Springer, 1989.
29. J. Kilian and E. Petrank. An efficient noninteractive zero-knowledge proof system for NP with general assumptions. Journal of Cryptology, 11(1), 1998.
30. M. Naor. On cryptographic assumptions and challenges. In Advances in Cryptology - CRYPTO '03, volume 2729 of Lecture Notes in Computer Science. Springer, 2003.
31. V. I. Nechaev. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes, 55(2), 1994.
32. R. Pass and A. Shelat, Unconditional characterizations of non-interactive zeroknowledge. In Advances in Cryptology - CRYPTO '05, volume 3621 of Lecture Notes in Computer Science. Springer, 2005.
33. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27(4), 1980.
34. V. Shoup. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology - EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science. Springer, 1997.