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.
Chapter PDF
References
S. Blackburn, S. Blake-Wilson, M. Burmester and S. D. Galbraith. Shared Generation of Shared RSA Keys. University of Waterloo technical report, CORR 98-19 (1998).
D. Boneh and M. Franklin. Efficient Generation of Shared RSA Keys. In Advances in Cryptology-CRYPTO’ 97, Springer-Verlag LNCS 1294, 425–439, 1997.
D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In Advances in Cryptology-CRYPTO 2001, Springer-Verlag LNCS 2139, 213–229, 2001.
D. Boneh, B. Lynn and H. Shacham. Short signatures from the Weil pairing. In Advances in Cryptology-ASIACRYPT 2001, Springer-Verlag LNCS 2248, 514–532, 2001.
J. Cha and J. Cheon. An Identity-Based Signature from Gap Diffie-Hellman Groups IACR preprint server, submission 2002/018, 2002.
C. Cocks. Split knowledge generation of RSA parameters. In Cryptography and Coding, Springer-Verlag LNCS 1355, 89–95, 1997.
C. Cocks. An identity based encryption scheme based on quadratic residues. In Cryptography and Coding, Springer-Verlag LNCS 2260, 360–363. 2001.
S. D. Galbraith. Supersingular curves in cryptography. In Advances in Cryptology-ASIACRYPT 2001, Springer-Verlag LNCS 2248, 495–513, 2001.
A. Joux. A one round protocol for tripartite Diffie-Hellman. In Algorithmic Number Theory Symposium, ANTS-IV, Springer-Verlag LNCS 1838, 385–394, 2000.
A. J. Menezes, T. Okamoto and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Info. Th., 39, 1639–1646, 1993.
A. J. Menezes, P. C. Oorschot and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
V. Miller. Short programs for functions on curves. Unpublished manuscript, 1986.
K. Nyberg and R. A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. Designs, Codes and Cryptography, 7(1/2), 61–81, 1996.
K. G. Paterson. ID-based signatures from pairings on elliptic curves IACR preprint server, submission 2002/003, 2002.
D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13, 361–396, 2000.
K. Rubin and A. Silverberg. The best and worst of supersingular abelian varieties in cryptology. IACR preprint server, submission 2002/006, 2002.
R. Sakai, K. Ohgishi and M. Kasahara. Cryptosystems based on pairing. In SCIS 2000, 2000.
A. Shamir. Identity-based cryptosystems and signature schemes. In Advances in Cryptology-CRYPTO’ 84, Springer-Verlag LNCS 196, 47–53, 1984.
J. H. Silverman. The Arithmetic of Elliptic Curves. GTM 106, Springer-Verlag, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-36492-7_20
Download citation
DOI: https://doi.org/10.1007/3-540-36492-7_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00622-0
Online ISBN: 978-3-540-36492-4
eBook Packages: Springer Book Archive