Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications technology

Authenticated Key Exchange Protocol and Verification SVO Logic

Liu Zhi-meng

Published Jan 1, 2009• 0 citations
OpenAlex

Abstract

In a distributed wireless communication network,authenticated key agreement protocol is critical to the secure sessions between communication parties,and much attention is paid to formal theories of cryptographic protocol analysis. A Mutually-Authenticated Key Establish Protocol(AKEP) based on entity authentication with elliptic curve cryptography is proposed,which could provide data confidentiality of exchanged information between Server and client via symmetric cryptography. The security of the protocol is verified by SVO logic.

Related papers

Privacy-Enhancing Authenticated Key Agreement Protocols Based on Elliptic Curve Cryptosystem

Hong Lei

Authenticated key agreement protocol is designed to provide pair of parties communicating over an insecure network with a secure session key.However,most of the existing authenticated key agreement protocols are not designed for protecting privacy.We emphasize user's privacy properties in network services,in particular we stress anonymity and deniability.We specify the desired security properties of privacy-enhancing authentication key agreement protocols,i.e.mutual authentication,key control,key confirmation,session-key confidentiality,known-key security,forward secrecy,anonymity of user,forward anonymity of user,unlinkability,deniability.Based on elliptic curve cryptosystem we also propose a protocol which satisfies all the desired security properties.

Dianzi xuebao•Jan 1, 2008•4 citations

On the Design of Key Exchange Protocol and its Variants

Susmita Mandal

With the advancement in Internet-based technologies, network applications are no longer just limited to one-to-one communication; instead, it has become a publicly accessible resource. Regardless of this growth, such applications bring specific challenges concerning authentication, integrity, and privacy. Cryptography stands as an ideal solution to overcome these issues through an interactive method of secure communication called Key Exchange. Key exchange protocols allow two or more entities to agree upon a shared secret transmitted over a public channel without revealing any information to an eavesdropper. This thesis contributes to the design and analysis of the variants of key exchange protocols along with their applications. As per the security requirements, the proposed schemes are either designed in an interactive model or a non-interactive model. Each scheme undergoes a series of formal and informal security analysis. The formal analysis provides simulation result using cryptographic models. Whereas, an informal analysis showcases the theoretical proves on known attacks where an adversary controls the network. The performance analysis maps the protocol’s efficiency based on the computation cost and communication size. The first contribution introduces an interactive two-party authenticated key exchange protocol. We begin by investigating the security flaws in an existing system such as, lack of user anonymity, trace attack, clogging attack, and failure to resist replay attack. Then proposed an authenticated self-certified key exchange protocol that overcomes the addressed issues. Also, it eliminates the requirements of a trusted certificate authority to authorize the entities. The scheme achieves anonymity during session execution, mutual authentication and enables session key agreement.Based on the ideology, an application is designed, forsecure communication between ad-hoc nodes in a mobile ad-hoc network. The second contribution contributes to the design of an Identity-based authenticated three-party key exchange protocol that overcomes the incapability of managing huge peer-to-peer communication and high computation cost faced by two-party authenticated key exchange protocols. The proposed scheme preserves user privacy by enabling the property of anonymity and ensures non-repudiation. Based on the ideology, an application is designed to establish a secure session key between two users with the help of a trusted server for an electronic payment system. The third contribution proposes an interactive pairing-free certificateless authenticated group key agreement scheme suitable for a resource constrained mobile network. The scheme allows any user to join or leave the group dynamically. The key agreement protocol devised in this scheme ensures un-deniability property by incorporating the signcryption, and unsigncryption algorithm. The final contribution presents a non-interactive Identity-based deniable authentication protocol that allows an intended receiver to identify the origin of a given message without being able to prove sender’s identity to a third party.

•Jan 1, 2018•0 citations

An Improvement on A Three-Party Authentication Key Exchange Protocol Using Elliptic Curve Cryptography

Zuowen Tan

The authentication key exchange protocol enables communication participants to authenticate each other and agree on the session key over an insecure public network. Recently, a three-party authentication key exchange protocol based on Elliptic curve cryptograph is proposed. In this paper, we improve the three-party encrypted key exchange protocol by bilinear maps. The proposed threeparty authentication key exchange protocol is provable secure under Computational Diffie-Hellman assumptions in the standard model. Furthermore, the novel protocol is more efficient.

Journal of Convergence Information Technology•Jun 30, 2010•13 citations

A secure two-factor mutual authentication and session key agreement protocol using Elliptic curve cryptography

Preeti Chandrakar, Hari Om

In this paper, we propose a secure two-factor remote user authentication protocol using Elliptic curve cryptography. The proposed protocol provides the mutual authentication of participants, session key agreement and user anonymity. The security of our proposed protocol is based on one way hash function and elliptic curve cryptosystem and it is secure against all relevant security attacks. Compared with other relevant protocol, the security analysis and performance evaluation show that our proposed protocol can provide high level of security with less communication and computation cost. In addition, the BAN logic is applied to demonstrate the validity of the proposed protocol.

IEEE International Conference on Computer Graphics, Vision and Information Security (CGVIS)•Nov 1, 2015•7 citations

Design of Mutually Authenticated Key Agreement Protocol Resistant to Impersonation Attacks for Multi-Server Environment

Alavalapati Goutham Reddy, Eun‐Jun Yoon, Ashok Kumar Das +2 more

Three-factor mutually authenticated key agreement protocols for multi-server environments have gained momentum in recent times due to advancements in wireless technologies and associated constraints. Several authors have put forward various authentication protocols for multi-server environment during the past decade. Wang et al. recently proposed a biometric-based authentication with key agreement protocol for multi-server environment and claimed that their protocol is efficient and resistant to prominent security attacks. The careful investigation of this paper shows that Wang et al. protocol's users are sharing personal identifiable information with the application servers during the registration and authentication process. This nature of disclosing credentials leads to severe threats particularly insider attacks, user impersonation attacks, and server impersonation attacks. As a remedy of the aforementioned problems, this paper proposes a novel biometric-based mutually authenticated key agreement protocols for multi-server architecture based on elliptic curve cryptography. We prove that the proposed protocol achieves secure mutual authentication property using the broadly used Burrows-Abadi-Needham logic. The formal security of the proposed protocol is verified using the widely accepted automated validation of Internet security protocols and applications tool to show that our protocol can withstand active and passive attacks including the replay and man-in-the-middle attacks. The proposed protocol is robust and efficient compared with the existing related protocols.

IEEE Access•Jan 1, 2017•88 citations

Key Agreement Protocol with Provable Security in Wireless Network

Yanxia Liu

In the distributed computing environments such as wireless network, it is critical to establish a secure session between communicators. A mutual key agreement protocol, namely Symmetrical Authenticated Key Agreement Protocol(SAKAP), is proposed to authenticate identities and establish secure session key between symmetrical users. The security of the protocol is proved in Random Oracle(RO) model, and its performances are analyzed. SAKAP has the advantages of provable security and considerable feasibility over other protocols.

Jisuanji gongcheng•Jan 1, 2008•0 citations
In a distributed wireless communication network,authenticated key agreement protocol is critical to the secure sessions between communication parties,and much attention is paid to formal theories of cryptographic protocol analysis. A Mutually-Authenticated Key Establish Protocol(AKEP) based on entity authentication with elliptic curve cryptography is proposed,which could provide data confidentiality of exchanged information between Server and client via symmetric cryptography. The security of the protocol is verified by SVO logic.
Authenticated key agreement protocol is designed to provide pair of parties communicating over an insecure network with a secure session key.However,most of the existing authenticated key agreement protocols are not designed for protecting privacy.We emphasize user's privacy properties in network services,in particular we stress anonymity and deniability.We specify the desired security properties of privacy-enhancing authentication key agreement protocols,i.e.mutual authentication,key control,key confirmation,session-key confidentiality,known-key security,forward secrecy,anonymity of user,forward anonymity of user,unlinkability,deniability.Based on elliptic curve cryptosystem we also propose a protocol which satisfies all the desired security properties.
With the advancement in Internet-based technologies, network applications are no longer just limited to one-to-one communication; instead, it has become a publicly accessible resource. Regardless of this growth, such applications bring specific challenges concerning authentication, integrity, and privacy. Cryptography stands as an ideal solution to overcome these issues through an interactive method of secure communication called Key Exchange. Key exchange protocols allow two or more entities to agree upon a shared secret transmitted over a public channel without revealing any information to an eavesdropper. This thesis contributes to the design and analysis of the variants of key exchange protocols along with their applications. As per the security requirements, the proposed schemes are either designed in an interactive model or a non-interactive model. Each scheme undergoes a series of formal and informal security analysis. The formal analysis provides simulation result using cryptographic models. Whereas, an informal analysis showcases the theoretical proves on known attacks where an adversary controls the network. The performance analysis maps the protocol’s efficiency based on the computation cost and communication size. The first contribution introduces an interactive two-party authenticated key exchange protocol. We begin by investigating the security flaws in an existing system such as, lack of user anonymity, trace attack, clogging attack, and failure to resist replay attack. Then proposed an authenticated self-certified key exchange protocol that overcomes the addressed issues. Also, it eliminates the requirements of a trusted certificate authority to authorize the entities. The scheme achieves anonymity during session execution, mutual authentication and enables session key agreement.Based on the ideology, an application is designed, forsecure communication between ad-hoc nodes in a mobile ad-hoc network. The second contribution contributes to the design of an Identity-based authenticated three-party key exchange protocol that overcomes the incapability of managing huge peer-to-peer communication and high computation cost faced by two-party authenticated key exchange protocols. The proposed scheme preserves user privacy by enabling the property of anonymity and ensures non-repudiation. Based on the ideology, an application is designed to establish a secure session key between two users with the help of a trusted server for an electronic payment system. The third contribution proposes an interactive pairing-free certificateless authenticated group key agreement scheme suitable for a resource constrained mobile network. The scheme allows any user to join or leave the group dynamically. The key agreement protocol devised in this scheme ensures un-deniability property by incorporating the signcryption, and unsigncryption algorithm. The final contribution presents a non-interactive Identity-based deniable authentication protocol that allows an intended receiver to identify the origin of a given message without being able to prove sender’s identity to a third party.
The authentication key exchange protocol enables communication participants to authenticate each other and agree on the session key over an insecure public network. Recently, a three-party authentication key exchange protocol based on Elliptic curve cryptograph is proposed. In this paper, we improve the three-party encrypted key exchange protocol by bilinear maps. The proposed threeparty authentication key exchange protocol is provable secure under Computational Diffie-Hellman assumptions in the standard model. Furthermore, the novel protocol is more efficient.
In this paper, we propose a secure two-factor remote user authentication protocol using Elliptic curve cryptography. The proposed protocol provides the mutual authentication of participants, session key agreement and user anonymity. The security of our proposed protocol is based on one way hash function and elliptic curve cryptosystem and it is secure against all relevant security attacks. Compared with other relevant protocol, the security analysis and performance evaluation show that our proposed protocol can provide high level of security with less communication and computation cost. In addition, the BAN logic is applied to demonstrate the validity of the proposed protocol.
Three-factor mutually authenticated key agreement protocols for multi-server environments have gained momentum in recent times due to advancements in wireless technologies and associated constraints. Several authors have put forward various authentication protocols for multi-server environment during the past decade. Wang et al. recently proposed a biometric-based authentication with key agreement protocol for multi-server environment and claimed that their protocol is efficient and resistant to prominent security attacks. The careful investigation of this paper shows that Wang et al. protocol's users are sharing personal identifiable information with the application servers during the registration and authentication process. This nature of disclosing credentials leads to severe threats particularly insider attacks, user impersonation attacks, and server impersonation attacks. As a remedy of the aforementioned problems, this paper proposes a novel biometric-based mutually authenticated key agreement protocols for multi-server architecture based on elliptic curve cryptography. We prove that the proposed protocol achieves secure mutual authentication property using the broadly used Burrows-Abadi-Needham logic. The formal security of the proposed protocol is verified using the widely accepted automated validation of Internet security protocols and applications tool to show that our protocol can withstand active and passive attacks including the replay and man-in-the-middle attacks. The proposed protocol is robust and efficient compared with the existing related protocols.
In the distributed computing environments such as wireless network, it is critical to establish a secure session between communicators. A mutual key agreement protocol, namely Symmetrical Authenticated Key Agreement Protocol(SAKAP), is proposed to authenticate identities and establish secure session key between symmetrical users. The security of the protocol is proved in Random Oracle(RO) model, and its performances are analyzed. SAKAP has the advantages of provable security and considerable feasibility over other protocols.