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

Lecture Notes in Computer Science

Volumn 3386, Issue , 2005, Pages 328-345

  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

Security analysis; Undeniable signature

Indexed keywords

NETWORK PROTOCOLS; PROBLEM SOLVING; SECURITY OF DATA;

SECURITY ANALYSIS; SIGNATURE SCHEMES; UNDENIABLE SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 24144448778     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30580-4_23     Document Type: Conference Paper

References (26)

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. Advances in Cryptology - EUROCRYPT '02, LNCS 2332, pp. 418-433, Springer-Verlag, 2002.
2. M. Bellare and A. Palacio. GQ and Schnorr identification schemes: proofs of security against impersonation under active and concurrent attacks. Advances in Cryptology - CRYPTO '02, LNCS 2442, pp. 162-177, Springer-Verlag, 2002.
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. Financial Cryptography '01, LNCS 2339, pp. 319-338, Springer-Verlag, 2002.
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. Journal of Cryptology, vol. 16, no. 3, pp. 185-215, Springer-Verlag, 2003.
5. M. Bellare and P. Rogaway. The exact security of digital signatures - how to sign with RSA and Rabin. Advances in Cryptology - EUROCRYPT '96, LNCS 1070, pp. 399-416, Springer-Verlag, 1996.
6. J. Boyar, D. Chaum, I. Damgård and T. Pedersen. Convertible undeniable signatures. Advances in Cryptology - CRYPTO '90, LNCS 537, pp. 189-208, Springer-Verlag, 1990.
7. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. Advances in Cryptology - CRYPTO '03, LNCS 2729, pp. 126-144, Springer-Verlag, 2003.
8. D. Chaum. Zero-knowledge undeniable signatures. Advances in Cryptology - EUROCRYPT '90, LNCS 473, pp. 458-464, Springer-Verlag, 1990.
9. D. Chaum. Designated confirmer signatures. Advances in Cryptology - EUROCRYPT '94, LNCS 950, pp. 86-91, Springer-Verlag, 1995.
10. T. Chaum and T. P. Pedersen. Wallet databases with observers. Advances in Cryptology - CRYPTO '92, LNCS 740, pp. 89-105, Springer-Verlag, 1993.
11. D. Chaum and H. van Antwerpen. Undeniable signatures. Advances in Cryptology - CRYPTO '89, LNCS 435, pp. 212-216, Springer-Verlag, 1989.
12. D. Chaum, E. van Heijst and B. Pfitzmann. Cryptographically strong undeniable signatures, unconditionally secure for the signer. Advances in Cryptology - CRYPTO '91, LNCS 576, pp. 470-484, Springer-Verlag, 1991.
13. J. Coron. On the exact security of full domain hash. Advances in Cryptology - CRYPTO '00, LNCS 1880, pp. 229-235, Springer-Verlag, 2000.
14. R. Cramer, I. Damgård and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. Advances in Cryptology - CRYPTO '94, LNCS 839, pp. 174-187, Springer-Verlag, 1994.
15. I. Damgård and T. Pedersen. New convertible undeniable signature schemes. Advances in Cryptology - EUROCRYPT '96, LNCS 1070, pp. 372-386, Springer-Verlag, 1996.
16. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. Advances in Cryptology - CRYPTO '86, LNCS 263, pp. 186-194, Springer-Verlag, 1987.
17. S. Galbraith and W. Mao. Invisibility and anonymity of undeniable and confirmer signatures. Topics in Cryptology - CT-RSA '03, LNCS 2612, pp. 80-97, Springer Verlag, 2003.
18. S. Galbraith, W. Mao and K. G. Paterson. RSA-based undeniable signatures for general moduli. Topics in Cryptology - CT-RSA '02, LNCS 2271, pp. 200-217, Springer Verlag, 2002.
19. R. Gennaro, H. Krawczyk and T. Rabin. RSA-based undeniable signatures. Advances in Cryptology - CRYPTO '97, LNCS 1294, pp. 132-149, Springer-Verlag, 1997.
20. S. Goldwasser, S. Micali and R. Rivest. A digital signature scheme secure against adaptative chosen-message attacks. SIAM Journal of Computing, vol. 17, no. 2, pp. 281-308, 1988.
21. M. Jakobsson, K. Sako and R. Impagliazzo. Designated verifier proofs and their applications. Advances in Cryptology - EUROCRYPT '96, LNCS 1070, pp. 143-154, Springer-Verlag, 1996.
22. A. May. Computing the RSA secret key is deterministic polynomial time equivalent to factoring. Advances in Cryptology - CRYPTO '04, LNCS 3152, pp. 213-219, Springer-Verlag, 2004.
23. M. Michels and M. Stadler. Efficient convertible undeniable signature schemes. Selected Areas in Cryptography - SAC '97, pp. 231-244, Springer-Verlag, 1997.
24. W. Ogata, K. Kurosawa and S.-H. Heng. The security of the FDH variant of Chaum's undeniable signature scheme. The full version of this paper. Available from the Cryptology ePrint Archive, http://www.iacr.org/.
25. T. Okamoto and D. Pointcheval. The gap-problems: a new class of problems for the security of cryptographic schemes. Public Key Cryptography - PKC '01, LNCS 1992, pp. 104-118, Springer-Verlag, 2001.
26. D. Pointcheval and J. Stern. Security proofs for signature schemes. Advances in Cryptology - EUROCRYPT '96, LNCS 1070, pp. 387-398, Springer-Verlag, 1996.