Abstract
We present a novel public key cryptosystem in which the public key of a subscriber can be chosen to be a publicly known value, such as his identity. We discuss the security of the proposed scheme, and show that this is related to the difficulty of solving the quadratic residuosity problem
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C Cocks Split Generation of RSA Parameters with Multiple Participants Proceedings of 6th IMA conference on Cryptography and Coding, Springer LNCS 1355.
H Cohen A Course in Computational Algebraic Number Theory Springer-Verlag graduate texts in mathematics 138, 1993
D Boneh, M Franklin Identity-Based Encryption from the Weil Pairing Advances in Cryptology — Crypto2001, Springer LNCS 2139
A. Shamir Identity Based Cryptosystems and Signature Schemes Advances in Cryptology — Proceedings of Crypto’ 84.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cocks, C. (2001). An Identity Based Encryption Scheme Based on Quadratic Residues. In: Honary, B. (eds) Cryptography and Coding. Cryptography and Coding 2001. Lecture Notes in Computer Science, vol 2260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45325-3_32
Download citation
DOI: https://doi.org/10.1007/3-540-45325-3_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43026-1
Online ISBN: 978-3-540-45325-3
eBook Packages: Springer Book Archive