Abstract
An identity-based non-interactive public key distribution system is presented that is based on a novel trapdoor one-way function allowing a trusted authority to compute the discrete logarithm of a given number modulo a publicly known composite number m while this is infeasible for an adversary not knowing the factorization of m. Without interaction with a key distribution center or with the recipient of a given message a user can generate a mutual secure cipher key based solely on the recipient’s identity and his own secret key and send the message, encrypted with the generated cipher key using a conventional cipher, over an insecure channel to the recipient. Unlike in previously proposed identity-based systems, no public keys, certificates for public keys or other information need to be exchanged and thus the system is suitable for many applications such as electronic mail that do not allow for interaction.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
A more detailed version of this paper has been submitted to the IEEE Transactions on Information Theory.
Work performed while consulting for Omnisec AG, Switzerland, prior to joining Princeton University.
Download to read the full chapter text
Chapter PDF
References
D. Coppersmith, A.M. Odlyzko and R. Schroeppel, Discrete Logarithms in GF(p), Algorithmica, vol. 1, pp. 1–15, 1986.
W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol. IT-22, pp. 664–654, Nov. 1976.
T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, vol. IT-31, pp. 469–472, July 1985.
M. Girault, Self-certified public keys, these proceedings.
C.G. Günther, An identity-based key-exchange protocol, Advances in Cryptology-EUROCRYPT’ 89, Lecture Notes in Computer Science, vol. 434, Berlin: Springer Verlag, pp. 29–37, 1990.
L. Kohnfelder, Towards a practical public-key cryptosystem, B.S. Thesis, MIT, 1979.
K. Koyama and K. Ohta, Identity-based conference key distribution systems, Advances in Cryptology-CRYPTO’ 87, Lecture Notes in Computer Science, vol. 293, Berlin: Springer Verlag, pp. 175–184, 1988.
A.K. Lenstra, personal communication, 1991.
A.K. Lenstra and M.S. Manasse, Factoring with two large primes, Advances in Cryptology-EUROCRYPT’ 90, Lecture Notes in Computer Science, vol. 473, Berlin: Springer Verlag, pp. 69–80, 1991.
H.W. Lenstra, Factoring integers with elliptic curves, Annals of Mathematics, vol. 126, pp. 649–673, 1987.
A.K. Lenstra, H.W. Lenstra, M.S. Manasse and J.M. Pollard, The number field sieve, to appear.
A.K. Lenstra and M.S. Manasse, Factoring with electronic mail, Advances in Cryptology-EUROCRYPT’ 89, Lecture Notes in Computer Science, vol. 434, Berlin: Springer Verlag, pp. 355–371, 1990.
T. Matsumoto and H. Imai, On the key predistribution system: a practical solution to the key distribution problem, Advances in Cryptology-CRYPTO’ 87, Lecture Notes in Computer Science, vol. 293, Berlin: Springer Verlag, pp. 185–193, 1988.
U.M. Maurer, Fast generation of secure RSA-moduli with almost maximal diversity, Advances in Cryptology-EUROCRYPT’ 89, Lecture Notes in Computer Science, vol. 434, Berlin: Springer Verlag, pp. 636–647, 1990.
K.S. McCurley, A key distribution system equivalent to factoring, Journal of Cryptology, vol. 1, no. 2, pp. 95–106, 1988.
G.L. Miller, Riemann’s hypothesis and tests for primality, Journal of Computer and System Sciences, vol. 13, pp. 300–317, 1976.
Y. Murakami and M. Kasahara, An ID-based key distribution system, Proc. of ISEC90, pp. 33–40, 1990 (in Japanese).
A.M. Odlyzko, personal communications, 1990–91.
T. Okamoto and K. Ohta, How to utilize the randomness of zero-knowledge proofs, presented at CRYPTO’90 (to appear in the proceedings), Santa Barbara, CA, Aug. 11–15, 1990.
E. Okamoto and K. Tanaka, Key distribution based on identification information, IEEE Journal on Selected Areas in Communications, vol. 7, no. 4, pp. 481–485, May 1989.
S.C. Pohlig and M.E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transactions on Information Theory, vol IT-24, pp. 106–110, Jan. 1978.
J.M. Pollard, Theorems on factorization and primality testing, Proc. Cambridge Philos. Society, vol. 76, pp. 521–528, 1974.
R.L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol. 21, pp. 120–126, 1978.
R.J. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Mathematics of Computation, vol. 44, pp. 483–494, 1985.
A. Shamir, Identity-based cryptosystems and signature schemes, Advances in Cryptology-CRYPTO’ 84, Lecture Notes in Computer Science, vol. 196, Berlin: Springer Verlag, pp. 47–53, 1985.
Z. Shmuely, Composite Diffie-Hellman public-key generating systems are hard to break, TR 356, CS Dept., Technion, Feb. 1985.
S. Tsujii and T. Itoh, An ID-based cryptosystem based on the discrete logarithm problem, IEEE Journal on Selected Areas in Communications, vol. 7, no. 4, pp. 467–473, May 1989.
Y. Yacobi, A key distribution “paradox”, presented at CRYPTO’90 (to appear in the proceedings), Santa Barbara, CA, Aug. 11–15, 1990.
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
Maurer, U.M., Yacobi, Y. (1991). Non-interactive Public-Key Cryptography. 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_43
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_43
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