Skip to main content

Identity-Based Cryptography

  • Chapter
  • First Online:
Introduction to Cryptography with Maple
  • 3359 Accesses

Abstract

This chapter is devoted to giving a brief introduction to identity-based cryptography (IBC), which presents a nice solution for some problems that limit the wide deployment of public-key cryptography, in particular, the problem of binding public keys with user identities. The basic idea of IBC starts from the realization that there is some minimal information that a user has to learn before communicating with another party, even in unencrypted form, namely, some identity information such as, for example, an email address. In IBC, this basic informacion replaces the need for a public key or, in slightly different terms, the public key of a user is her identity string or some string easily derivable from this identity by a specified method.

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

Access this chapter

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 EPUB and 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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    Alternatively, the result given in Proposition 8.5 may be used to mount a ‘common modulus attack’ which allows any user to decrypt messages addressed to another user who shares the same RSA modulus.

  2. 2.

    This can be interpreted as the PKG creating a certificate stating that “the public key of user id is pk”.

  3. 3.

    Recall here that \(\mathcal J _n\) denotes the subset of the elements of \(\mathbb Z _n^*\) with Jacobi symbol modulo \(n\) equal to \(+1\) and \(\mathcal Q \mathcal N _n^1\) is the intersection of \(\mathcal J _n\) with the set of quadratic non-residues modulo \(n\).

  4. 4.

    The definition of IND-ID-CPA is obtained from the definition of IND-ID-CCA above by dropping the decryption queries.

  5. 5.

    Capital letters—often starting with the letter \(P\)—are commonly used to denote the elements of \(G_1\), which comes from the fact that, when \(G_1\) is an elliptic curve group, its elements are points of the curve. Elliptic curve groups are defined in Chap. 11.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to José Luis Gómez Pardo .

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gómez Pardo, J.L. (2013). Identity-Based Cryptography. In: Introduction to Cryptography with Maple. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32166-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32166-5_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32165-8

  • Online ISBN: 978-3-642-32166-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics