Skip to main content

Applications of Multiple Trust Authorities in Pairing Based Cryptosystems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2437))

Abstract

We investigate a number of issues related to the use of multiple trust authorities and multiple identities in the type of identifier based cryptography enabled by the Weil and Tate pairings. An example of such a system is the Boneh and Franklin encryption scheme. We present various applications of multiple trust authorities. In particular we focus on how one can equate a trust authority with a way to add contextual information to an identity.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Boneh and M. Franklin. Identity based encryption from the Weil pairing. Advanced in Cryptology-CRYPTO 2001, Springer-Verlag LNCS 2139, 213–229, 2001.

    Chapter  Google Scholar 

  2. D. Boneh, B. Lynn and H. Shacham. Short signatures from the Weil pairing. Advances in Cryptology-ASIACRYPT 2001, Springer-Verlag LNCS 2248, 514–532, 2001.

    Chapter  Google Scholar 

  3. C. Boyd. Some applications of multiple key ciphers. Advances in Cryptology-EUROCRYPT’ 88, Springer-Verlag LNCS 330, 455–467, 1988.

    Chapter  Google Scholar 

  4. C. Boyd. A new multiple key cipher and an improved voting scheme. Advances in Cryptology-EUROCRYPT’ 89, Springer-Verlag LNCS 434, 617–625, 1989.

    Google Scholar 

  5. J. C. Cha and J. H. Cheon. An Identity-Based Signature from Gap Diffie-Hellman Groups. Preprint 2002.

    Google Scholar 

  6. C. Cocks. An identity based encryption scheme based on quadratic residues. Cryptography and Coding, Springer-Verlag LNCS 2260, 360–363, 2001.

    Chapter  Google Scholar 

  7. Y. Desmedt. Society and group oriented cryptography: A new concept. Advances in Cryptology-CRYPTO’ 87, Springer-Verlag LNCS 293, 120–127, 1987.

    Google Scholar 

  8. E. Fujisaki and T. Okamoto. Secure integration of asymmetric and symmetric encryption schemes. Advances in Cryptology-CRYPTO’ 99, Springer-Verlag LNCS 1666, 537–554, 1999.

    Google Scholar 

  9. F. Hess. Efficient identity based signature schemes based on pairings. To appear Selected Areas in Cryptography-2002.

    Google Scholar 

  10. K. Paterson. ID-based Signatures from Pairings on Elliptic Curves. Preprint 2002.

    Google Scholar 

  11. A. Shamir. Identity based cryptosystems and signature schemes. Advanced in Cryptology-CRYPTO’ 84, Springer-Verlag LNCS 196, 47–53, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, L., Harrison, K., Soldera, D., Smart, N.P. (2002). Applications of Multiple Trust Authorities in Pairing Based Cryptosystems. In: Davida, G., Frankel, Y., Rees, O. (eds) Infrastructure Security. InfraSec 2002. Lecture Notes in Computer Science, vol 2437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45831-X_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-45831-X_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44309-4

  • Online ISBN: 978-3-540-45831-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics