A new identity-based key exchange protocol minimizing computation and communication
We propose a new identity-based key exchange protocol that minimizes the computation and communication required by participants in the protocol, and show that its security is closely related to some wellknown difficult problems. More specifically, we will argue that forging a key linked to a given identity is related to the difficulty of RSA inversion while finding the key established by the protocol is equivalent to breaking the Diffie-Hellman problem with composite modulus.
Unable to display preview. Download preview PDF.
- 1.M. Burmester and Y. Desmedt, “A secure and efficient conference key distribution system”, Advances in Cryptology (Proceedings of Eurocrypt '94), Lecture Notes in Computer Science, vol. 950, Springer-Verlag, 1994, pp. 275–286Google Scholar
- 2.W. Diffie and M. Hellman, “New directions in cryptography”, IEEE Trans. Inform. Theory, vol. 22, 1976, pp. 644–654Google Scholar
- 3.U. Feige, A. Fiat and A. Shamir, “Zero-knowledge proofs of identity”, Journal of Cryptology, vol. 1, no. 2, 1988, pp. 77–94Google Scholar
- 4.S. Goldwasser, S. Micah and C. Rackoff, “The knowledge complexity of interactive proof systems”, SIAM J. Comp., vol. 18, 1989, pp. 186–208Google Scholar
- 5.K. McCurley, “A key distribution system equivalent to factorin”, Journal of Cryptology, vol. 1, no. 2, 1988, pp. 95–105Google Scholar
- 6.E. Okamoto, “Key distribution systems based on identification information”, Advances in Cryptology (Proceedings of Crypto '87), Lecture Notes in Computer Science, vol. 293, Springer-Verlag, 1988, pp. 194–202Google Scholar
- 7.S. Saeednia, “Identity-based and self-certified key-exchange protocols”, Information Security and Privacy (Proceedings of ACISP'97), Lecture Notes in Computer Science, vol. 1270, Springer-Verlag, 1997, pp. 303–313Google Scholar
- 8.A. Shamir, “Identity-based cryptosystems and signature schemes”, Advances in Cryptology (Proceedings of Crypto '84), Lecture Notes in Computer Science, vol. 196, Springer-Verlag, 1985, pp. 47–53Google Scholar
- 9.Z. Shmuley, “Composite Diffie-Hellman public-key generating systems are hard to break”, Technical Report 356, Computer Science Department, Technion, Feb. 1985Google Scholar