Provably secure and efficient identification and key agreement protocol with user anonymity. (English) Zbl 1210.68033

Summary: Many authentication and key agreement protocols were proposed for protecting communicated messages. In previous protocols, if the user’s identity is transmitted in plaintext, an adversary can tap the communications and employ it to launch some attacks. In most protocols with user anonymity, they focus on satisfaction of several security requirements. From a client’s point of view, those protocols are not admired since the cost of storage, computation and communication is high. In pervasive computing, a client usually uses a limited-resource device to access multiple servers. The storage and computation are very important issues especially in this kind of environments. Also, for a convenience of designing protocol, most protocols use timestamps to prevent the replay attack. As we know, the serious time synchronization problem exists in timestamp-based protocols. Finally, most protocols do not have formal proofs for the security. In this paper, we propose a secure and efficient identification and key agreement protocol with user anonymity based on the difficulty of cracking the elliptic curve Diffie-Hellman assumption. In addition, we also propose an augmented protocol for providing the explicit mutual authentication. Compared with the related protocols, the proposed protocols’ computation cost is lower and the key length is shorter. Therefore, our protocols are suitable even for applications in low power computing environments. Finally, we formally prove the security of the proposed protocols by employing the random oracle model.


68M12 Network protocols
94A60 Cryptography
94A62 Authentication, digital signatures and secret sharing


Full Text: DOI


[1] Oppliger, R.; Hauser, R.; Basin, D., SSL/TLS session-aware user authentication—or how to effectively thwart the man-in-the-middle, Comput. commun., 29, 12, 2238-2246, (2006)
[2] J. Kohl, C. Neuman, The kerberos network authentication service (v5), IETF RFC1510.
[3] Byun, J.W.; Lee, D.H.; Lim, J.I., EC2C-PAKA: an efficient client-to-client password-authenticated key agreement, Inform. sci., 177, 19, 3995-4013, (2007) · Zbl 1142.94366
[4] Juang, W.-S., Efficient password authenticated key agreement using smart cards, Computers & security, 23, 2, 167-173, (2004)
[5] Juang, W.-S., Efficient user authentication and key agreement in ubiquitous computing, (), 396-405 · Zbl 1209.68050
[6] Nam, J.; Lee, Y.; Kim, S.; Won, D., Security weakness in a three-party pairing-based protocol for password authenticated key exchange, Inform. sci., 177, 6, 1364-1375, (2007) · Zbl 1125.94037
[7] Peyravian, M.; Zunic, N., Methods for protecting password transmission, Computers & security, 19, 5, 466-469, (2006)
[8] Yang, C.-C.; Wang, R.-C.; Liu, W.-T., Secure authentication scheme for session initiation protocol, Computers & security, 24, 5, 381-386, (2005)
[9] Bao, F.; Deng, R.H., Privacy protection for transactions of digital goods, (), 202-213 · Zbl 1050.68537
[10] Lee, W.-B.; Chang, C.-C., User identification and key distribution maintaining anonymity for distributed computer network, Comput. syst. sci. engrg., 15, 4, 113-116, (2000)
[11] Wu, T.-S.; Hsu, C.-L., Efficient user identification protocol with key distribution preserving anonymity for distributed computer networks, Computers & security, 23, 2, 120-125, (2004)
[12] Yang, Y.; Wang, S.; Bao, F.; Wang, J.; Deng, D.H., New efficient user identification and key distribution protocol providing enhanced security, Computers & security, 23, 8, 697-704, (2005)
[13] Mangipudi, K.; Katti, R., A secure identification and key agreement protocol with user anonymity (SIKA), Computers & security, 25, 6, 420-425, (2006)
[14] W.-S. Juang, J.-L. Wu, An efficient two-factor authenticated key exchange protocol based on elliptic curve cryptosystems, in: The 11th Information Management and Implementation Conference (IMI05), Taipei, Taiwan, ROC, 2005, pp. 299-306.
[15] Lee, N.-Y.; Wu, C.-N.; Wang, C.-C., Authenticated multiple key exchange protocols based on elliptic curves and bilinear pairings, Computers & electrical engineering, 34, 1, 12-20, (2008) · Zbl 1130.68050
[16] R. Schroeppel, H. Orman, S. OʼMalley, O. Spatscheck, Fast key exchange with elliptic curve systems, in: Advances in Cryptology, CRYPTOʼ 95, 1995, pp. 43-56. · Zbl 0868.94024
[17] Diffie, W.; Hellman, M.E., New directions in cryptography, IEEE trans. inform. theory, IT-22, 6, 644-654, (1976) · Zbl 0435.94018
[18] Seo, S.-C.; Kim, H.-C.; Ramakrishna, R., A new security protocol based on elliptic curve cryptosystems for securing wireless sensor networks, (), 291-301
[19] M. Bellare, P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, in: First ACM Conference on Computer and Communications Security, 1993, pp. 62-73.
[20] M. Bellare, P. Rogaway, Provably secure session key distribution the three party case, in: Proceedings of the 27th ACM Symposium on the Theory of Computing, 1995, pp. 57-66. · Zbl 0916.94006
[21] Pointcheval, D.; Stern, J., Security arguments for digital signatures and blind signatures, J. cryptology, 13, 3, 361-369, (2000) · Zbl 1025.94015
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.