Skip to main content
SpringerLink
Log in

Access Control Using Pairing Based Cryptography

  • Conference paper
  • First Online:
Topics in Cryptology — CT-RSA 2003 (CT-RSA 2003)

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

Included in the following conference series:

Abstract

We present a mechanism to encrypt to an arbitrary collection of identities using a variant of the Boneh-Franklin identity based encryption scheme. The decryptor is defined by a logical formulae of conjunctions and disjunctions. This enables a simple mechanism to drive access control to broadcast encrypted data using user identities as the public keys.

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

Access this chapter

Log in via an institution
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

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. In Advances in Cryptology-CRYPTO 2001, Springer-Verlag LNCS 2139, 213–229, 2001. 113, 114

    Chapter  Google Scholar 

  2. L. Chen, K. Harrison, N.P. Smart and D. Soldera. Applications of multiple trust authorities in pairing based cryptosystems. In InfraSec 2002, Springer-Verlag LNCS 2437, 260–275, 2002. 113

    Google Scholar 

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

    Google Scholar 

  4. L.H. Hacksta.. Systems of Formal Logic. D. Reidel Publishing, 1966. 115

    Google Scholar 

  5. J. Kohl, B. Neumann and T. Ts’o. The evolution of the Kerberos authentication service. In Distributed Open Systems, IEEE Computer Society Press, 1994. 111

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computer Science, University of Bristol, Merchant Venturers Building Woodland Road, BS8 1UB, Bristol, UK

    Nigel P. Smart

Authors
  1. Nigel P. Smart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Gemplus, Card Security Group, La Vigie, Avenue du Jujubier, ZI Athélia IV, 13705, La Ciotat Cedex, France

    Marc Joye

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smart, N.P. (2003). Access Control Using Pairing Based Cryptography. In: Joye, M. (eds) Topics in Cryptology — CT-RSA 2003. CT-RSA 2003. Lecture Notes in Computer Science, vol 2612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36563-X_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-36563-X_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00847-7

  • Online ISBN: 978-3-540-36563-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation