International Conference on the Theory and Applications of Cryptographic Techniques

EUROCRYPT 2004: Advances in Cryptology - EUROCRYPT 2004 pp 56-73

Short Signatures Without Random Oracles

  • Dan Boneh
  • Xavier Boyen
Conference paper

DOI: 10.1007/978-3-540-24676-3_4

Volume 3027 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Boneh D., Boyen X. (2004) Short Signatures Without Random Oracles. In: Cachin C., Camenisch J.L. (eds) Advances in Cryptology - EUROCRYPT 2004. EUROCRYPT 2004. Lecture Notes in Computer Science, vol 3027. Springer, Berlin, Heidelberg

Abstract

We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Diffie-Hellman assumption. This assumption has similar properties to the Strong RSA assumption, hence the name. Strong RSA was previously used to construct signature schemes without random oracles. However, signatures generated by our scheme are much shorter and simpler than signatures from schemes based on Strong RSA. Furthermore, our scheme provides a limited form of message recovery.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Dan Boneh
    • 1
  • Xavier Boyen
    • 2
  1. 1.Computer Science DepartmentStanford UniversityStanfordUSA
  2. 2.Voltage SecurityPalo Alto