Abstract
We introduce the notion, and give two examples, of self-certified public keys, i.e. public keys which need not be accompanied with a separate certificate to be authenticated by other users. The trick is that the public key is computed by both the authority and the user, so that the certificate is “embedded” in the public key itself, and therefore does not take the form of a separate value.
Self-certified public keys contribute to reduce the amount of storage and computations in public key schemes, while secret keys are still chosen by the user himself and remain unknown to the authority. This makes the difference with identity-based schemes, in which there are no more certificates at all, but at the cost that secret keys are computed (and therefore known to) the authority.
Chapter PDF
Similar content being viewed by others
References
T. Beth, “A Fiat-Shamir-like authentication protocol for the ElGamal scheme”, Advances in Cryptology, Proc. of EUROCRYPT’88, LNCS 330, Springer-Verlag, 1988, pp. 77–86.
“The Directory-Authentication Framework”, CCITT Recommendation X509.
W. Diffie and M. Hellman, “New directions in cryptography”, IEEE Transactions on Information Theory, Vol.IT-22, Nov.1976, pp. 644–654.
T. El Gamal, “A public key cryptosystem and a signature scheme based on discrete logarithms”, Advances in Cryptology, Proc. of CRYPTO’84, LNCS 196, Springer-Verlag, 1985, pp.10–18.
A. Fiat and A. Shamir, “How to prove yourself: Practical solutions to identification and signature problems”, Advances in Cryptology, Proc. of CRYPTO’86, LNCS 263, Springer-Verlag, 1987, pp. 186–194.
M. Girault, “An identity-based identification scheme based on discrete logarithms modulo a composite number”, Proc. of EUROCRYPT’90, LNCS 473, Springer-Verlag, 1991, pp.481–486.
M. Girault and JC. Paillès, “An identity-based identification scheme providing zero-knowledge authentication and authenticated key exchange”, Proc. of ESORICS’90, pp.173–184.
L.C. Guillou and J.J. Quisquater, “A practical zero-knowledge protocol fitted to security microprocessors minimizing both transmission and memory”, Advances in Cryptology, Proc. of EUROCRYPT’88, LNCS 330, Springer-Verlag, 1988, pp.123–128.
P. Horster and H.J. Knobloch, “Discrete logarithm based protocols”, these Proceedings.
T. Okamoto and K. Ohta, “How to utilize the randomness of zero-knowledge proofs”, Proc. of CRYPTO’90, to appear.
J.C. Paillès and M. Girault, “CRIPT: A public-key based solution for secure data communications”, Proc. of SECURICOM’89, pp.171–185.
M.O Rabin, “Digitalized signatures and public-key functions as intractable as factorization”, MIT, Lab. for Computer Science, MIT/LCS/TR-212, Jan.1979.
R.L. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems”, CACM, Vol.21, no2, Feb.1978, pp.120–126.
C.P. Schnorr, “Efficient identification and signatures for smart cards”, Advances in Cryptology, Proc. of CRYPTO’89, LNCS 435, Springer-Verlag, pp.239–252.
A. Shamir, “Identity-based cryptosystems and signature schemes”, Advances in Cryptology, Proc. of CRYPTO’84, LNCS 196, Springer-Verlag, 1985, pp.47–53.
K. Tanaka and E. Okamoto, “Key distribution system using ID-related information directory suitable for mail systems”, Proc. of SECURICOM’90, pp.115–122.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Girault, M. (1991). Self-certified public keys. In: Davies, D.W. (eds) Advances in Cryptology — EUROCRYPT ’91. EUROCRYPT 1991. Lecture Notes in Computer Science, vol 547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46416-6_42
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54620-7
Online ISBN: 978-3-540-46416-7
eBook Packages: Springer Book Archive