Short signatures without random oracles

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

Volumn 3027, Issue , 2004, Pages 56-73

  Boneh, Dan ^a   Boyen, Xavier ^b  

^a Stanford University   (United States)

^b Voltage Security   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION;

CHOSEN MESSAGE ATTACKS; COMPLEXITY ASSUMPTIONS; MESSAGE RECOVERY; SHORT SIGNATURES; SIGNATURE SCHEME; STRONG DIFFIE-HELLMAN; STRONG RSA ASSUMPTION; WITHOUT RANDOM ORACLES;

NETWORK SECURITY;

EID: 35048848152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_4     Document Type: Article

References (24)

1. [ADR02]J.H. An, Y. Dodis, and T. Rabin. On the security of joint signature and encryption. Proceedings of Eurocrypt 2002, volume 2332 LNCS. Springer-Verlag, 2002.
2. [BB04a]Dan Boneh and Xavier Boyen. Efficient selective-ID secure identity based encryption without random oracles. Proceedings of Eurocrypt '04, 2004.
3. [BB04b]Dan Boneh and Xavier Boyen. Short signatures without random oracles. Proceedings of Eurocrypt 2004, 2004. Full version at: http://crypto.stanford.edu/~dabo/abstracts/sigssdh.html.
4. [BBS04]Dan Boneh, Xavier Boyen, and Hovav Shacham. Short group signatures using strong Diffie-Hellman. Manuscript, 2004.
5. [BLS01]Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the Weil pairing. Proceedings of Asiacrypt 2001, volume 2248 LNCS, 514-32. Springer-Verlag, 2001.
6. [CDF03]Nicolas Courtois, Magnus Daum, and Patrick Felke. On the security of HFE, HFEv- and Quartz. Proceedings of PKC 2003, volume 2567 LNCS, 337-50. Springer-Verlag, 2003.
7. [CHK04]Ran Canetti, Shai Halevi, and Jonathan Katz. Chosen-ciphertext security from identity-based encryption. Proceeings of Eurocrypt 2004, LNCS. Springer-Verlag, 2004. http://eprint.iacr.org/2003/182J.
8. [CN00]J. Coron and D. Naccache. Security analysis of the Gennaro-Halevi-Rabin signature scheme. Proceedings of Eurocrypt 2000, 91-101, 2000.
9. [Cor00]Jean-Sébastien Coron. On the exact security of full domain hash. Proceedings of Crypto 2000, volume 1880 LNCS, 229-35. Springer-Verlag, 2000.
10. [CS00]Ronald Cramer and Victor Shoup. Signature schemes based on the strong RSA assumption. ACM TISSEC, 3(3): 161-185, 2000. Extended abstract in Proc. 6th ACM CCS, 1999.
11. [GHR99]Rosario Gennaro, Shai Halevi, and Tal Rabin. Secure hash-and-sign signatures without the random oracle. Proceedings of Eurocrypt 1999, LNCS, 123-139. Springer-Verlag, 1999.
12. [GMR88]Shafi Goldwasser, Silvio Micali, and Ron Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2): 281-308, 1988.
13. [JN01]Antoine Joux and Kim Nguyen. Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. Cryptology ePrint Archive, Report 2001/003, 2001. http://eprint.iacr.org/2001/003J.
14. [KR00]Hugo Krawczyk and Tal Rabin. Chameleon signatures. Proceedings of NDSS 2000. Internet Society, 2000. http://eprint.iacr.org/1998/010J.
15. [KW03]Jonathan Katz and Nan Wang. Efficiency improvements for signature schemes with tight security reductions. Proceedings of ACM CCS, 2003.
16. [MSK02]Shigeo Mitsunari, Ryuichi Sakai, and Masao Kasahara. A new traitor tracing. IEICE Trans. Fundamentals, E85-A(2): 481-484, 2002.
17. [MW97]Alfred J. Menezes, Paul C. Van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
18. [NS00]David Naccache and Jacques Stern. Signing on a postcard. Proceedings of Financial Cryptography 2000, 2000.
19. [PCG01]Jacques Patarin, Nicolas Courtois, and Louis Goubin. QUARTZ, 128-bit long digital signatures. Proceedings of RSA 2001, volume 2020 LNCS, 282-97. Springer-Verlag, 2001.
20. [PV00]Leon Pintsov and Scott Vanstone. Postal revenue collection in the digital age. Proceedings of Financial Cryptography 2000, 2000.
21. [Sah99]Amit Sahai. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. Proceeings 40 IEEE Symp. on Foundations of Computer Science, 1999.
22. [Sho97]Victor Shoup. Lower bounds for discrete logarithms and related problems. Proceedings of Eurocrypt 1997. Springer-Verlag, 1997.
23. [TSNZ03]V. To, R. Safavi-Naini, and F. Zhang. New traitor tracing schemes using bilinear map. Proceedings of 2003 DRM Workshop, 2003.
24. [ZSNS04]Fangguo Zhang, Reihaneh Safavi-Naini, and Willy Susilo. An efficient signature scheme from bilinear pairings and its applications. Proceedings of PKC 2004, 2004.