Identity-based cryptography is a type of public-key cryptography in which a publicly known string representing an individual or organization is used as a public key. The public string could include an email address, domain name, or a physical IP address.
The first implementation of identity-based signatures and an email-address based public-key infrastructure (PKI) was developed by Adi Shamir in 1984,[1] which allowed users to verify digital signatures using only public information such as the user's identifier. Under Shamir's scheme, a trusted third party would deliver the private key to the user after verification of the user's identity, with verification essentially the same as that required for issuing a certificate in a typical PKI.
Shamir similarly proposed identity-based encryption, which appeared particularly attractive since there was no need to acquire an identity's public key prior to encryption. However, he was unable to come up with a concrete solution, and identity-based encryption remained an open problem for many years. The first practical implementations were finally devised by Sakai in 2000,[2] and Boneh and Franklin in 2001.[3] These solutions were based on bilinear pairings. Also in 2001, a solution was developed independently by Clifford Cocks.[4][5]
Closely related to various identity-based encryption schemes are identity based key agreement schemes. One of the first identity based key agreement algorithms was published in 1986, just two years after Shamir's identity based signature. The author was E. Okamoto.[6] Identity based key agreement schemes also allow for "escrow free" identity based cryptography. A notable example of such an escrow free identity based key agreement is the McCullagh-Barreto's "Authenticated Key Agreement without Escrow" found in section 4 of their 2004 paper, "A New Two-Party Identity-Based Authenticated Key Agreement".[7] A variant of this escrow free key exchange is standardized as the identity based key agreement in the Chinese identity based standard SM9.
Usage
editIdentity-based systems allow any party to generate a public key from a known identity value, such as an ASCII string. A trusted third party, called the private key generator (PKG), generates the corresponding private keys. To operate, the PKG first publishes a master public key, and retains the corresponding master private key (referred to as master key). Given the master public key, any party can compute a public key corresponding to the identity ID by combining the master public key with the identity value. To obtain a corresponding private key, the party authorized to use the identity ID contacts the PKG, which uses the master private key to generate the private key for the identity ID.
Limitation
editIdentity-based systems have a characteristic problem in operation. Suppose Alice and Bob are users of such a system. Since the information needed to find Alice's public key is completely determined by Alice's ID and the master public key, it is not possible to revoke Alice's credentials and issue new credentials without either (a) changing Alice's ID (usually a phone number or an email address which will appear in a corporate directory); or (b) changing the master public key and re-issuing private keys to all users, including Bob.[8]
This limitation may be overcome by including a time component (e.g. the current month) in the identity.[8]
See also
editReferences
edit- ^ Shamir, Adi (1985). "Identity-Based Cryptosystems and Signature Schemes" (PDF). In Blakley, George Robert; Chaum, David (eds.). Advances in Cryptology Proceedings of CRYPTO '84. Lecture Notes in Computer Science. Vol. 196 (1 ed.). Springer Berlin Heidelberg. pp. 47–53. doi:10.1007/3-540-39568-7_5. ISBN 978-3-540-39568-3. Archived (PDF) from the original on 26 July 2018. Retrieved 30 October 2024.
- ^ Sakai, R; Ohgishi, K; Kasahara, M (2000). "Cryptosystems based on pairings". SICS. Symposium on cryptography and information security.
- ^ Dan, Boneh; Matt, Franklin (2001). "Identity-based encryption from the Weil pairing". Advances in Cryptology – CRYPTO 2001. Lecture Notes in Computer Science. Vol. 2139/2001. Springer. pp. 213–229. CiteSeerX 10.1.1.66.1131.
- ^ Cocks, Cliff (2001). "An Identity Based Encryption Scheme Based on Quadratic Residues". Cryptography and Coding (PDF). Lecture Notes in Computer Science. Vol. 2260/2001. Springer. pp. 360–363. CiteSeerX 10.1.1.116.5477. doi:10.1007/3-540-45325-3_32. ISBN 978-3-540-43026-1. Archived from the original (PDF) on 2007-02-06.
- ^ "Dr Clifford Cocks CB, Honorary Doctor of Science". University of Bristol. Archived from the original on 2015-06-27.
- ^ Okamoto, E. (1986). "Proposal for identity-based key distribution systems". Electronics Letters. 22 (24): 1283–1284. Bibcode:1986ElL....22.1283O. doi:10.1049/el:19860880. ISSN 0013-5194.
- ^ McCullagh, Noel; Barreto, Paulo S. L. M. (2004). "A New Two-Party Identity-Based Authenticated Key Agreement". Topics in Cryptology – CT-RSA 2005. Lecture Notes in Computer Science. Vol. 3376.
- ^ a b Green, Matthew; Miers, Ian (17 May 2015). "Forward Secure Asynchronous Messaging from Puncturable Encryption". 2015 IEEE Symposium on Security and Privacy. ACM (published 20 July 2015). pp. 305–320. doi:10.1109/SP.2015.26. ISBN 978-1-4673-6949-7. S2CID 9171925. Archived from the original on 8 June 2021. Retrieved 8 June 2021.