Efficient Identity Based Signature Schemes Based on Pairings

  • Florian Hess
Conference paper

DOI: 10.1007/3-540-36492-7_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2595)
Cite this paper as:
Hess F. (2003) Efficient Identity Based Signature Schemes Based on Pairings. In: Nyberg K., Heys H. (eds) Selected Areas in Cryptography. SAC 2002. Lecture Notes in Computer Science, vol 2595. Springer, Berlin, Heidelberg

Abstract

We develop an efficient identity based signature scheme based on pairings whose security relies on the hardness of the Diffie-Hellman problem in the random oracle model. We describe how this scheme is obtained as a special version of a more general generic scheme which yields further new provably secure identity based signature schemes if pairings are used. The generic scheme also includes traditional public key signature schemes.We further discuss issues of key escrow and the distribution of keys to multiple trust authorities. The appendix contains a brief description of the relevant properties of supersingular elliptic curves and the Weil and Tate pairings.

Keywords

Identity based signatures Weil pairing Tate pairing key escrow 

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Florian Hess
    • 1
  1. 1.Dept. Computer ScienceUniversity of BristolBristol

Personalised recommendations