An efficient compiler from ∑-protocol to 2-move deniable zero-knowledge

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

Volumn 4052 LNCS, Issue , 2006, Pages 46-57

  Furukawa, Jun ^a   Kurosawa, Kaoru ^b   Imai, Hideki ^c  

^a NEC CORPORATION   (Japan)

^b IBARAKI UNIVERSITY   (Japan)

^c NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

Author keywords

Constant round; Deniable; Efficient; Resettable zero knowledge; Resettably sound argument of knowledge; The random oracle model; protocol

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; EFFICIENCY; MATHEMATICAL MODELS; NETWORK PROTOCOLS;

CONSTANT-ROUND; DENIABLE; EFFICIENT; RESETTABLE ZERO-KNOWLEDGE; RESETTABLY-SOUND ARGUMENT OF KNOWLEDGE; THE RANDOM ORACLE MODEL; ∑-PROTOCOL;

KNOWLEDGE BASED SYSTEMS;

EID: 33746326494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_5     Document Type: Conference Paper

References (37)

1. An Efficient Compiler from ∑-Protocol to 2-move Deniable Zero-Knowledge (full version with examples and proofs). Manuscript.
2. Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell: Resettably-Sound Zero-Knowledge and its Applications. FOCS 2001: 116-125
3. Mihir Bellare, Adriana Palacio: GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks. CRYPTO 2002: 162-177
4. Jan Camenisch, Victor Shoup: Practical Verifiable Encryption and Decryption of Discrete Logarithms. CRYPTO 2003: 126-144 2002
5. Ran Canetti: Universally Composable Security: A New Paradigm for Cryptographic Protocols. FOGS 2001, pp. 136-145
6. R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali: Resettable Zero-Knowledge. Proc. of STOC 2000.
7. R. Canetti, J. Kilian, E. Petrank, and A. Rosen: Black-box concurrent zero-knowledge requires Omega (log n) rounds. ACM Symposium on Theory of Computing, pp. 570-579, 2001.
8. David Chaum, Hans Van Antwerpen: Undeniable Signatures. CRYPTO 1989: 212-216
9. Ronald Cramer, Ivan Damgård, Berry Schoenmakers: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. CRYPTO 1994: 174-187
10. Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti: Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model. CRYPTO 2004: 237-253
11. I. Damgård: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. LNCS 1807, Proc. Eurocrypt 2000, pp.419-430
12. Vergnaud Damien: Private communication.
13. C. Dwork, M. Naor, and A. Sahai: Concurrent zero-knowledge: Proc. of STOC 30, pp. 409-428, 1998
14. Cynthia Dwork, Moni Naor: Zaps and Their Applications. Electronic Colloquium on Computational Complexity (ECCC)(001): (2002)
15. C. Dwork, A. Sahai: Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. LNCS 1462, pp.442-1998.
16. U. Feige and A. Shamir: Zero Knowledge Proofs of Knowledge in Two Rounds. Crypto 89, pp.526-544, 1990
17. Amos Fiat, Adi Shamir: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. CRYPTO 1986: 186-194.
18. Marc Fischlin: Communication-Efficient Non-Interactive Proofs of Knowledge with Online Extractors. CRYPTO 2005:
19. S. Goldwasser, S. Micali, and C. Rackoff: The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. Vol. 18, No. 1, pp. 186-208 1989.
20. Oded Goldreich, Ariel Kahan: How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. J. Cryptology 9(3): 167-190 (1996)
21. O. Goldreich and H. Krawczyk: On the Composition of Zero Knowledge Proof Systems. SIAM J. on Computing, Vol.25, No.1, pp.169-192,1996
22. O. Goldreich, S. Micali, and A. Wigderson: A Proof that Yields Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof System. ACM, 38, 1, pp. 691-729 1991.
23. O. Goldreich and Y. Oren: Definitions and properties of Zero-Knowledge proof systems. Journal of Cryptology, Vol. 7, No. 1 pp. 1-32 1994.
24. R. Impagliazzo, L.Levin and M.Luby: Pseudo-random Generation from one-way functions. STOC 1989, pp.12-24 (1989)
25. J. Kilian and E. Petrank: Concurrent zero-knowledge in poly-logarithmic rounds. STOC 2001.
26. J. Kilian, E. Petrank, and C. Rackoff: Lower Bounds for Zero Knowledge on the Internet. FOGS 1998: 484-492.
27. J. Kilian, E. Petrank, R. Richardson: On Concurrent and Resettable Zero-Knowledge Proofs for NP.
28. Kaoru Kurosawa, Swee-Huay Heng: 3-Move Undeniable Signature Scheme. EUROCRYPT 2005: 181-197
29. S. Micalil and L. Reyzin: Min-Round Resettable Zero-Knowledge in the Public-Key Model. Eurocrypt 2001, LNCS 2045, pp.373-393, 2001
30. Silvio Micali, Leonid Reyzin: Soundness in the Public-Key Model. CRYPTO 2001: 542-565
31. M. Michels and M. Stadler: Efficient Convertible Undeniable Signature Schemes. Proc. SAC 1997 pp. 231-244 1997.
32. M. Naor: Bit Commitment Using Pseudo-Randomness. Journal of Cryptology, vol.4, 1991,pp.151-158
33. W. Ogata, K. Kurosawa and S.H. Heng, The Security of the FDH Variant of Chaum's Undeniable Signature Scheme, Accepted by IEEE Trans. on IT.
34. R. Pass: On Deniability in the Common Reference String and Random Oracle Model. CRYPTO 2003, pp. 316-337.
35. R. Richardson and J. Kilian: On the Concurrent Composition of Zero-Knowledge Proofs. EUROCRYPT 1999, pp. 415-431, 1999.
36. Amit Sahai: Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. FOCS 1999: 543-553
37. Yunlei ZHAO: Concurrent/Resettable Zero-Knowledge With Concurrent Soundness in the Bare Public-Key Model and Its Applications. Cryptology ePrint Archive, Report 2003/265.