The Newhope scheme is one of the milestones of the study in key agreement protocol but it lacks the anti-active-attack capability. In this article, we propose a mutual authenticated key agreement scheme named INAKA scheme based on the commitment value and lattice hard problem. This scheme improves the key encapsulation mechanism in the Newhope scheme to generating the commitment values for both communication parties and thus achieves mutual authentication, key agreement and identity privacy protection at the same time. Firstly, the INAKA protocol is combinable, i.e. the common traditional and lattice-based cryptographic algorithms (encryption, decryption, hash operation) can both act as the protocol components. What's more, the INAKA protocol has been analyzed that it can resist the man-inthe-middle attack, replay attack, and other attacks. This scheme satisfies provable security under eCK and indistinguishable game models. Its anti-attack capability and security are significantly enhanced compared with the Newhope scheme. Besides, the INAKA protocol involves the identity authentication feature but keeps at the same level of computational complexity. None of the existing schemes (such as Ding's and BCNS) are able to satisfy the above feature. Lastly, the test results in this article show the INAKA protocol only needs 8.131 milliseconds to complete mutual authentication and key agreement. The outcome of our work could provide lower operation overhead, handy code implementation, and better efficiency to meet the industrial practical requirements.INDEX TERMS Mutual authentication, authenticated key agreement, lattice, Newhope, key encapsulation mechanism. I. INTRODUCTIONKey agreement (KA) protocol is designed to enable two or more participants to negotiate a common session key on an insecure channel, which allows participants to build a secure communication channel through cryptographic techniques. The shared session key can be used to encrypt and authenticate the information, which plays an important role on ensuring the security of data transmitted. The key encapsulation mechanism (KEM) enables the sender and the receiver to share session keys securely. In a KEM, the initiator encapsulates the session key firstly, and the sender runs an encapsulation algorithm to generate the session key and the cipher text, then, the sender deliveries the encapsulated session key to the receiver, finally, the receiver runs the corresponding de-capsulation algorithm to get the same session key asThe associate editor coordinating the review of this manuscript and approving it for publication was Weizhi Meng .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.