Universal designated verifier signatures without random oracles or non-black box assumptions

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

Volumn 4116 LNCS, Issue , 2006, Pages 63-77

  Laguillaumie, Fabien ^a   Libert, Benoît ^b   Quisquater, Jean Jacques ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b Microelectronics Laboratory   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA PRIVACY; DATABASE SYSTEMS; KNOWLEDGE ENGINEERING; SECURITY OF DATA;

ALGORITHMIC ASSUMPTIONS; DIGITAL CERTIFICATES; KNOWLEDGE OF EXPONENT ASSUMPTION (KEA); UNIVERSAL DESIGNATED VERIFIER SIGNATURES (UDVS);

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

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

References (35)

1. J.-H. An, Y. Dodis, T. Rabin. On the security of joint signature and encryption. Proc. of Eurocrypt'02, Springer LNCS vol. 2332, 83-107 (2002).
2. P. S. L. M. Barreto, M. Scott. Compressed Pairings. Proc. of Crypto'04, Springer LNCS vol. 3152, 140-156 (2004).
3. P. S. L. M. Barreto, M. Naehrig. Pairing-Friendly Elliptic Curves of Prime Order. Proc. of SAC'05, Springer LNCS vol. 3897, 319-331 (2005).
4. M. Bellare, A. Palacio. The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols. Proc. of Crypto'04, Springer LNCS vol. 3152, 273-289 (2004)
5. M. Bellare, P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. Proc. of ACM CCS'93, ACM Press, 62-73 (1993)
6. A. Bender, J. Katz, R. Morselli. Ring Signatures: Stronger Definitions, and Constructions without Random Oracles. Proc. of TCC'06. Springer LNCS vol. 3876, 60-79 (2006)
7. D. Boneh, X. Boyen. Short Signatures Without Random Oracles. Proc. of Eurocrypt'04, Springer LNCS vol. 3027, 56-73 (2004)
8. D. Boneh, M. Franklin. Identity-based encryption from the Weil pairing. Proc. of Crypto'01, Springer LNCS vol. 2139, 213-229 (2001)
9. D. Boneh, E. Shen, B. Waters, Strongly Unforgeable Signatures Based on Computational Diffie-Hellman. Proc. of PKC'05, Springer LNCS vol. 3958, 229-240 (2005).
10. R. Canetti, O. Goldreich, S. Halevi. The random oracle methodology, revisited. Journal of the ACM 51(4), 557-594 (2004)
11. D. Chaum, H. van Antwerpen. Undeniable Signatures, Proc. of Crypto'89, Springer LNCS vol. 435, 212-216 (1989).
12. J. H. Cheon. Security Analysis of the Strong Diffie-Hellman Problem. Proc. of Eurocrypt'06, Springer LNCS vol. 4004, 1-11 (2006)
13. I. Damgård. Towards practical public-key cryptoSystems provably-secure against chosen-ciphertext attacks. Proc. of Crypto'91, Springer LNCS vol. 576, 445-456 (1991)
14. A. Dent. The Hardness of the DHK Problem in the Generic Group Model. Cryptology ePrint Archive: report 2006/156 (2006)
15. A. Fiat, A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. Proc. of Crypto'86. Springer LNCS vol. 263, 186-194 (1986)
16. S. Galbraith, W. Mao: Invisibility and Anonymity of Undeniable and Confirmer Signatures. Proc. of CT-RSA 2003, Springer LNCS vol. 2612, 80-97 (2003)
17. S. Goldwasser, S. Micali, R. L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. 17(2), 281-308 (1988)
18. S. Hada, T. Tanaka. On the Existence of 3-Round Zero-Knowledge Protocols. Proc. of Crypto'98. Springer LNCS vol. 1462, 408-42 (1998)
19. M. Jakobsson, K. Sako, R. Impagliazzo: Designated Verifier Proofs and their Applications. Proc. of Eurocrypt'96, Springer LNCS vol. 1070, 142-154 (1996)
20. A. Joux. A one round protocol for tripartite Diffie-Hellman. Proc. of ANTS-IV, Springer LNCS vol. 1838, 385-394 (2000)
21. W. Ogata, K. Kurosawa, S.-H. Heng. The Security of the FDH Variant of Chaum's Undeniable Signature Scheme. Proc of PKC'05, Springer LNCS vol. 3386, 328-345 (2005)
22. F. Laguillaumie, D. Vergnaud. Designated Verifiers Signature: Anonymity and Efficient Construction from any Bilinear Map. Proc. of SCN'04, Springer LNCS vol. 3352, 107-121 (2005)
23. F. Laguillaumie, D. Vergnaud. Multi-Designated Verifiers Signature Schemes. Proc. of ICICS'04, Springer LNCS vol. 3269, 495-507 (2004)
24. H. Lipmaa, G. Wang, F. Bao. Designated Verifier Signature Schemes: Attacks, New Security Notions and A New Construction. Proc. of ICALP 2005, Springer LNCS vol. 3580, 459-471 (2005)
25. D. Naccache. Secure and Practiced Identity-Based Encryption. Cryptology ePrint Archive : report 2005/369 (2005)
26. C. Y. Ng, W. Susilo, Y. Mu. Universal Designated Multi Verifier Signature Schemes. Proc. of SNDS 2005, IEEE Press, 305-309 (2005)
27. T. Okamoto, D. Pointcheval: The Gap-Problems: a New Class of Problems for the Security of Cryptographic Schemes. Proc. of PKC'01 Springer LNCS vol. 1992, 104-118 (2001)
28. S. Saeednia, S. Kremer. O. Markowitch. An Efficient Strong Designated Verifier Signature Scheme. Proc. of ICISC 2003. Springer LNCS vol. 2836, 40-54 (2003)
29. P. Sarkar, S. Chatterjee. Trading time for space: Towards an efficient IBE scheme with short(er) public parameters in the standard model. To appear in Proc. of ICISC'05 (2006)
30. C. P. Schnorr. Efficient identification and signatures for smart cards. Proc. of Crypto'89, Springer LNCS vol. 435, 239-252 (1989)
31. R. Steinfeld, L. Bull, H. Wang, J. Pieprzyk. Universal Designated Verifier Signatures. Proc. of Asiacrypt'03, Springer LNCS vol. 2894, 523-542 (2003)
32. R. Steinfeld, H. Wang, J. Pieprzyk. Efficient Extension of Standard Schnorr/RSA signatures into Universal Designated-Verifier Signatures. Proc. of PKC'04, Springer LNCS vol. 2947, 86-100 (2004)
33. D. Vergnaud. New extensions of Pairing-based Signatures into Universal Designated Verifier Signatures. To appear in Proc. of ICALP 2006.
34. B. Waters. Efficient Identity-Based Encryption Without Random Oracles. Proc. of Eurocrypt'05. Springer LNCS vol. 3494, 114-127 (2005)
35. R. Zhang, J. Furukawa, H. Imai. Short signature and Universal Designated Verifier Signature without Random Oracles. Proc. of ACNS'05, Springer LNCS vol. 3531, 483-498 (2005)