Efficient Identity based Signature Schemes based on Pairings.

F Hess

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

715 Citations (Scopus)


We develop an e cient identity based signature scheme based on pairings whose security relies on the hardness of the Di e-Hellman problem in the random oracle model.We describe how this scheme is ob- tained 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 signa- ture schemes.We further discuss issues of key escrow and the distribution of keys to multiple trust authorities.The appendix contains a brief de- scription of the relevant properties of supersingular elliptic curves and the Weil and Tate pairings.
Translated title of the contributionEfficient Identity based Signature Schemes based on Pairings.
Original languageEnglish
Title of host publicationSelected Areas in Cryptography -- SAC 2002
PublisherSpringer Berlin Heidelberg
Pages310 - 324
Number of pages14
Publication statusPublished - Feb 2003

Bibliographical note

Editors: K. Nyberg and H. Heys
Publisher: Springer-Verlag


Dive into the research topics of 'Efficient Identity based Signature Schemes based on Pairings.'. Together they form a unique fingerprint.

Cite this