Time-selective convertible undeniable signatures

Lecture Notes in Computer Science

Volumn 3376, Issue , 2005, Pages 154-171

  Laguillaumie, Fabien ^a,b   Vergnaud, Damien ^b  

^a ORANGE LABS   (France)

^b UNIVERSITÉ DE CAEN   (France)

Author keywords

Anonymity; Bilinear maps; Convertible undeniable signatures; Exact security; Time selective conversion

Indexed keywords

COMPUTATIONAL METHODS; COSTS; MAPS;

ANONYMITY; BILINEAR MAPS; EXACT SECURITY; TIME-SELECTIVE CONVERSION;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 24144458509     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30574-3_12     Document Type: Conference Paper

References (34)

1. P. S. L. M. Barreto, H. Y. Kim: Fast hashing onto elliptic curves over fields of characteristic 3, Cryptology ePrint Archive, Report 2001/098 (2001)
2. M. Bellare, P. Rogaway: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. Proc. of 1st ACM Conference on Computer and Communications Security. 62-73 (1993)
3. D. Boneh, X. Boyen: Short Signatures Without Random Oracles. Proc. of Eurocrypt'04, Springer LNCS Vol. 3027, 56-73 (2004)
4. D. Boneh, M. Franklin: Identity-based Encryption from the Weil Pairing. SIAM J. Computing, 32(3), 586-615 (2003)
5. D. Boneh, B. Lynn, H. Shacham: Short signatures from the Weil pairing. Proc. of Asiacrypt'01, Springer LNCS Vol. 2248, 514-532 (2001)
6. J. Boyar, D. Chaum, I. B. Damgård, T.P. Pedersen: Convertible undeniable signatures. Proc. of Crypto'90, Springer LNCS Vol. 537, 189-205 (1991)
7. C. Boyd, E. Foo: Off-line Fair Payment Protocols using Convertible Signatures. Proc. of Asiacrypt'98, Springer LNCS Vol. 1514, 271-285 (1998)
8. E. Bresson and J. Stern: Proofs of Knowledge for Non-Monotone Discrete-Log Formulae and Applications. Proc. of ISC 2002, Springer LNCS Vol. 2433, 272-288 (2002)
9. J. Camenisch, M. Michels: Confirmer Signature Schemes Secure against Adaptative Adversaries. Proc. of Eurocrypt'00, Springer LNCS Vol. 1807, 243-258 (2000)
10. J. Camenisch, V. Shoup: Practical Verifiable Encryption and Decryption of Discrete Logarithms. Proc. of Crypto'03, Springer LNCS Vol. 2729, 126-144 (2003)
11. J. Camenisch, M. Stadler: Efficient Group Signature Schemes for Large Groups. Proc. of Crypto'97, Springer LNCS Vol. 1296, 410-424 (1997)
12. D. Chaum: Zero-Knowledge undeniable signatures. Proc. of Eurocrypt'90, Springer LNCS Vol. 473, 458-464 (1991)
13. D. Chaum: Designated Confirmer Signatures. Proc. of Eurocrypt'94, Springer LNCS Vol. 950, 86-91 (1995)
14. D. Chaum, H. van Antwerpen: Undeniable Signatures. Proc. of Crypto'89, Springer LNCS Vol. 435, 212-216 (1989)
15. D. Chaum, E. van Heijst, and B. Pfitzmann: Cryptographically strong undeniable signatures, unconditionally secure for the signer. Proc. of Crypto'91, Springer LNCS Vol. 576, 470-484 (1992)
16. D. Chaum, T.P. Pedersen: Wallet Databases with Observers. Proc. of Crypto'92, Springer LNCS Vol. 740, 89-105 (1993)
17. I. Damgard, T.P. Pedersen: New convertible undeniable signature schemes. Proc. of Eurocrypt'96, Springer LNCS Vol. 1070, 372-386 (1996)
18. S. Galbraith, W. Mao: Invisibility and anonymity of undeniable and confirmer signatures. Proc. of CT-RSA 2003, Springer LNCS Vol. 2612 80-97 (2003)
19. S. Galbraith, W. Mao, K.G. Paterson: RSA-based undeniable signatures for general moduli. Proc. of CT-RSA 2002, Springer LNCS Vol. 2271, 200-217 (2002)
20. R. Gennaro, H. Krawczyk, T. Rabin: RSA-based undeniable signatures. Proc. of Crypto'97, Springer LNCS Vol. 1294, 132-149 (1997)
21. S. Goldwasser, S. Micali, R. Rivest: A Digital Signature Scheme Secure against Adaptive Chosen-Message Attacks. SIAM J. Computing, 17 (2), 281-308 (1988)
22. M. Jakobsson, K. Sako, R. Impagliazzo: Designated Verifier Proofs and their Applications. Proc.of Eurocrypt'96, Springer LNCS Vol. 1070, 142-154 (1996)
23. H. Krawczyk, T. Rabin: Chameleon Signatures. Proc. of NDSS 2000, 143-154 (2000)
24. B. Libert, J.-J. Quisquater: Identity Based Undeniable Signatures. Proc. of CT-RSA 2004, Springer LNCS Vol. 2964, 112-125 (2004)
25. M. Michels, H. Petersen, P. Horster: Breaking and repairing a convertible undeniable signature scheme. Proc. of ACM Conference on Computer and Communications Security 1996, 148-152, ACM Press (1996)
26. M. Michels, M. Stadler: Efficient Convertible Undeniable Signature Schemes. Proc. of SAC'97, 231-244 (1997)
27. S. Mitsunary, R. Sakai, M. Kasahara: A New Traitor Tracing. IEICE Trans. Fundamentals, Vol. E85-A (2), 481-484 (2002)
28. J. Monnerat, S. Vaudenay: Undeniable Signatures Based on Characters: How to Sign with One Bit. Proc. of PKC 2004, Springer LNCS Vol. 2947, 69-85 (2004)
29. D. Pointcheval: Self-Scrambling Anonymizers. Proc. of Financial Cryptography 2000, Springer LNCS Vol. 1962, 259-275 (2000)
30. D. Pointcheval, J. Stern: Security Arguments for Digital Signatures and Blind Signatures. J. Cryptology, Vol. 13 (3), 361-396 (2000)
31. V. Shoup: Lower bounds for discrete logarithms and related problems. Proc. of Eurocrypt'97, Springer LNCS Vol. 1233, 256-266 (1997)
32. V. Shoup: OAEP reconsidered. Manuscript, November 16, 2000. Revised September 18, 2001. Full length version of the extended abstract in Proc. Crypto'01 (2001)
33. F. Zhang, R. Safavi-Naini, W. Susilo: Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings. Proc. of Indocrypt 2003, Springer LNCS Vol. 2904, 191-204 (2003) Revised version available from the authors.
34. F. Zhang, R. Safavi-Naini, W. Susilo: An efficient Signature Scheme from Bilinear Pairings and its Applications. Proc. of PKC 2004, Springer LNCS Vol. 2947, 277-290 (2004)