The security of the FDH variant of Chaum's undeniable signature scheme

IEEE Transactions on Information Theory

Volumn 52, Issue 5, 2006, Pages 2006-2017

  Ogata, Wakaha ^a   Kurosawa, Kaoru ^b   Heng, Swee Huay ^c  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b IBARAKI UNIVERSITY   (Japan)

^c MULTIMEDIA UNIVERSITY   (Malaysia)

Author keywords

Invisibility; Security analysis; Undeniable signature; Unforgeability; Zero knowledge (ZK)

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL METHODS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

COMPUTATIONAL DIFFIE-HELLMAN (CDH); FULL-DOMAIN HASH (FDH); NONINTERACTIVE ZERO-KNOWLEDGE (NIZK); SECURITY ANALYSIS; UNDENIABLE SIGNATURE; ZERO KNOWLEDGE (ZK);

SECURITY OF DATA;

EID: 33646031793     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.872853     Document Type: Article

References (28)

1. M. Abdalla, J. An, M. Bellare, and C. Namprempre, "From identification to signatures via the Fiat-Shamir transform: Minimizing assumptions for security and forward-security," in Advances in Cryptology - EUROCRYPT'02 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2002, vol. 2332, pp. 418-433.
2. M. Bellare and A. Palacio, "GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks," in Advances in Cryptology - CRYPTO '02 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2002, vol. 2442, pp. 162-177.
3. M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko, "The power of RSA inversion oracles and the security of Chaum's RSA-based blind signature scheme," in Financial Cryptography '01 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2002, vol. 2339, pp. 319-338.
4. M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko, "The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme," J. Cryptol., vol. 16, no. 3, pp. 185-215, 2003.
5. M. Bellare and P. Rogaway, "The exact security of digital signatures - How to sign with RSA and Rabin," in Advances in Cryptology - EUROCRYPT '96 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1996, vol. 1070, pp. 399-416.
6. J. Boyar, D. Chaum, I. Damgård, and T. Pedersen, "Convertible undeniable signatures," in Advances in Cryptology - CRYPTO '90 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1990, vol. 537, pp. 189-208.
7. S. Brands, "An Efficient Off-Line Electronic Cash System Based on the Representation Problem," CWI Tech. Rep., CS-R9323, 1993.
8. J. Camenisch and V. Shoup, "Practical verifiable encryption and decryption of discrete logarithms," in Advances in Cryptology - CRYPTO '03 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2003, vol. 2729, pp. 126-144.
9. D. Chaum, "Zero-knowledge undeniable signatures," in Advances in Cryptology - EUROCRYPT '90 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1990, vol. 473, pp. 458-464.
10. D. Chaum, "Designated confirmer signatures," in Advances in Cryptology - EUROCRYPT '94 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1995, vol. 950, pp. 86-91.
11. T. Chaum and T. P. Pedersen, "Wallet databases with observers," in Advances in Cryptology - CRYPTO '92 (Lecture Notes in computer Science). Berlin, Germany: Springer-Verlag, 1993, vol. 740, pp. 89-105.
12. D. Chaum and H. van Antwerpen, "Undeniable signatures," in Advances in Cryptology - CRYPTO '89 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1989, vol. 435, pp. 212-216.
13. D. Chaum, E. van Heijst, and B. Pfitzmann, "Cryptographically strong undeniable signatures, unconditionally secure for the signer," in Advances in Cryptology - CRYPTO '91 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1991, vol. 576, pp. 470-484.
14. J. Coron, "On the exact security of full domain hash," in Advances in Cryptology - CRYPTO '00 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2000, vol. 1880, pp. 229-235.
15. R. Cramer, I. Damgård, and B. Schoenmakers, "Proofs of partial knowledge and simplified design of witness hiding protocols," in Advances in Cryptology - CRYPTO '94 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1994, vol. 839, pp. 174-187.
16. V. Damien, private communication, 2005.
17. I. Damgård and T. Pedersen, "New convertible undeniable signature schemes," in Advances in Cryptology - EUROCRYPT '96 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1996, vol. 1070, pp. 372-386.
18. A. Fiat and A. Shamir, "How to prove yourself: Practical solutions to identification and signature problems," in Advances in Cryptology - CRYPTO '86 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1987, vol. 263, pp. 186-194.
19. S. Galbraith and W. Mao, "Invisibility and anonymity of undeniable and confirmer signatures," in Topics in Cryptology - CT-RSA '03 (Lecture Notes in Computer Science). Berlin, Germany: Sringer-Verlag, 2003, vol. 2612, pp. 80-97.
20. S. Galbraith, W. Mao, and K. G. Paterson, "RSA-based undeniable signatures for general moduli," in Topics in Cryptology - CT-RSA '02 (Lecture Notes in Computer Science). Berlin, Germany: Sringer-Verlag, 2002, vol. 2271, pp. 200-217.
21. R. Gennaro, H. Krawczyk, and T. Rabin, "RSA-based undeniable signatures," J. Cryptol., vol. 13, no. 4, pp. 397-416, 2000.
22. S. Goldwasser, S. Micali, and R. Rivest, "A digital signature scheme secure against adaptative chosen-message attacks," SIAM J. Comput., vol. 17, no. 2, pp. 281-308, 1988.
23. K. Kurosawa and S. H. Heng, "3-move undeniable signature scheme," in Advances in Cryptology - EUROCRYPT '05 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2005, vol. 3494, pp. 181-197.
24. M. Jakobsson, K. Sako, and R. Impagliazzo, "Designated verifier proofs and their applications," in Advances in Cryptology - EUROCRYPT '96 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1996, vol. 1070, pp. 143-154.
25. A. May, "Computing the RSA secret key is deterministic polynomial time equivalent to factoring," in Advances in Cryptology - CRYPTO '04 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2004, vol. 3152, pp. 213-219.
26. M. Michels and M. Stadler, "Efficient convertible undeniable signature schemes," in Selected Areas in Cryptography - SAC '97. Berlin, Germany: Springer-Verlag, 1997, pp. 231-244.
27. T. Okamoto and D. Pointcheval, "The gap-problems: A new class of problems for the security of cryptographic schemes," in Public Key Cryptography - PKC '01 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2001, vol. 1992, pp. 104-118.
28. D. Pointcheval and J. Stern, "Security proofs for signature schemes," in Advances in Cryptology - EUROCRYPT '96 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1996, vol. 1070, pp. 387-398.