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

Jisuanji gongcheng

Key Agreement Protocol with Provable Security in Wireless Network

Yanxia Liu

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

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.

Related papers

Provably Secure Two-Party Explicit Authenticated Key Agreement Protocol

Minghui Zheng, Jing Chen

This paper considers the issue on authenticated two-party key agreement protocol over an insecure public network. Many authenticated key agreement protocols have been proposed to meet the challenges. Based on bilinear pairing, Zhou et al. proposed a two-party key agreement with implicit key authentication in 2011. Implicit key authentication can be easily achieved by encrypting the later communications using the session key. However, we can not ensure how participants using the session key protocol. This paper will transform the Zhou's implicit authenticated key agreement protocol into the explicit one with key confirmation by introducing the authenticators, and show the proposed protocol is provably secure under the random-oracle model.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Jun 1, 2012•0 citations

A group authenticated key exchange protocol in the wireless mobile environment

Hai Huang

A feasible group authenticated key exchange protocol is proposed in the wireless mobile environment.The proposed protocol has two distinguishing features.The first is the asymmetry of computation;means that protocol allows a powerful node to shoulder more computational burdens and the others can perform less.So this protocol can be better adapted to a wireless mobile environment,a computationally asymmetric one.Meanwhile,besides the basic security of the session key this protocol takes the insider attack into considerations.Finally,it is shown that the protocol is provably secure in formal model.

Journal of Natural Science of Heilongjiang University•Jan 1, 2011•0 citations

Authenticated Key Exchange Protocol and Verification SVO Logic

Liu Zhi-meng

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.

Communications technology•Jan 1, 2009•0 citations

An Enhanced Mutual Key Agreement Protocol for Mobile RFID-enabled Devices

Kambombo Mtoga, Eun‐Jun Yoon

Mobile RFID is a new application that uses a mobile phone as an RFID reader with wireless technology and provides a new valuable service to users by integrating RFID and ubiquitous sensor network infrastructures with mobile communication and wireless Internet. Whereas the mobile RFID system has many advantages, privacy violation problems on the reader side are very concerning to individuals and researchers. Unlike in regular RFID environments, where the communication channel between the server and reader is assumed to be secure, the communication channel between the backend server and the RFID reader in the mobile RFID system is not assumed to be safe. Therefore it has become necessary to devise a new communication protocol that secures the privacy of mobile RFID-enabled devices. Recently, Lo et al. proposed a mutual key agreement protocol that secures the authenticity and privacy of engaged mobile RFID readers by constructing a secure session key between the reader and server. However, this paper shows that this protocol does not meet all of the necessary security requirements. Therefore we developed an enhanced mutual key agreement protocol for mobile RFID-enabled devices that alleviates these concerns. We further show that our protocol can enhance data security and provide privacy protection for the reader in an unsecured mobile RFID environment, even in the presence of an active adversary.

IEIE Transactions on Smart Processing and Computing•Aug 1, 2012•6 citations

Provably Secure Symmetric-Key Privacy-Preserving authenticated key agreement protocol

Liang Ni, Hengsheng Zhou, Yawei Zhang +2 more

In recent years, the rapid development of Quantum Computing technology has had a huge impact on the security of traditional Public Key Cryptography. However, the security of Hash functions and Symmetric Cryptographic algorithms is relatively less impacted by this security threaten and commonly have higher execution efficiency. This two primitives can offset the security impact by appropriately increasing the output scale of a Hash function and symmetric key respectively. Therefore, the Symmetric Key Authenticated Key Agreement(SAKA) protocol which constructed mainly by Hash functions and symmetric cryptographic algorithms has gradually attracted more attention. In this paper we proposed a provably secure SAKA scheme. We extend the security model used by Ferreira et al to formally prove the security of our protocol by introducing a criterion for indistinguishability of identities and Synchronization Robustness property. Our protocol not only captures basic security properties such as Perfect Forward Secrecy, Entity Authentication and Key Indistinguishability but also achieved Privacy Preservation and Full Synchronization Robustness. Furthermore, its implementation does not need to rely on a huge and complex Public key Infrastructure(PKI), so we can easily deploy it in a coucurrent environment. Comparison results indicate that the proposal consumes the least computation resource and reasonable communication cost among nine SAKA protocols while equiping 10 security properties.

International Conference on Communication and Network Security (ICCNS)•Dec 6, 2023•0 citations

Identity-based Encryption Authenticated Key Agreement Protocol

Yuan Yan-xian

The key agreement is an important part of the secure communication. By the key agreement protocol. the shared session key is established between communication nodes in order to achieve secure communications in network. In the context of the Internet of Things, the authenticated key agreement protocol proposed in this paper is based on identity-based authenticated key agreement protocol without the bilinear pairing. The protocol mainly includes three parts: initialization, parameter extraction and key agreement. Comparing with the key agreement protocol using bilinear pairings, the protocol not only provides the same level of security and scalability, but also has obvious advantages in terms of energy overhead, time overhead and computational complexity.

Xinxi wangluo anquan•Jan 1, 2014•0 citations
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.
This paper considers the issue on authenticated two-party key agreement protocol over an insecure public network. Many authenticated key agreement protocols have been proposed to meet the challenges. Based on bilinear pairing, Zhou et al. proposed a two-party key agreement with implicit key authentication in 2011. Implicit key authentication can be easily achieved by encrypting the later communications using the session key. However, we can not ensure how participants using the session key protocol. This paper will transform the Zhou's implicit authenticated key agreement protocol into the explicit one with key confirmation by introducing the authenticators, and show the proposed protocol is provably secure under the random-oracle model.
A feasible group authenticated key exchange protocol is proposed in the wireless mobile environment.The proposed protocol has two distinguishing features.The first is the asymmetry of computation;means that protocol allows a powerful node to shoulder more computational burdens and the others can perform less.So this protocol can be better adapted to a wireless mobile environment,a computationally asymmetric one.Meanwhile,besides the basic security of the session key this protocol takes the insider attack into considerations.Finally,it is shown that the protocol is provably secure in formal model.
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.
Mobile RFID is a new application that uses a mobile phone as an RFID reader with wireless technology and provides a new valuable service to users by integrating RFID and ubiquitous sensor network infrastructures with mobile communication and wireless Internet. Whereas the mobile RFID system has many advantages, privacy violation problems on the reader side are very concerning to individuals and researchers. Unlike in regular RFID environments, where the communication channel between the server and reader is assumed to be secure, the communication channel between the backend server and the RFID reader in the mobile RFID system is not assumed to be safe. Therefore it has become necessary to devise a new communication protocol that secures the privacy of mobile RFID-enabled devices. Recently, Lo et al. proposed a mutual key agreement protocol that secures the authenticity and privacy of engaged mobile RFID readers by constructing a secure session key between the reader and server. However, this paper shows that this protocol does not meet all of the necessary security requirements. Therefore we developed an enhanced mutual key agreement protocol for mobile RFID-enabled devices that alleviates these concerns. We further show that our protocol can enhance data security and provide privacy protection for the reader in an unsecured mobile RFID environment, even in the presence of an active adversary.
In recent years, the rapid development of Quantum Computing technology has had a huge impact on the security of traditional Public Key Cryptography. However, the security of Hash functions and Symmetric Cryptographic algorithms is relatively less impacted by this security threaten and commonly have higher execution efficiency. This two primitives can offset the security impact by appropriately increasing the output scale of a Hash function and symmetric key respectively. Therefore, the Symmetric Key Authenticated Key Agreement(SAKA) protocol which constructed mainly by Hash functions and symmetric cryptographic algorithms has gradually attracted more attention. In this paper we proposed a provably secure SAKA scheme. We extend the security model used by Ferreira et al to formally prove the security of our protocol by introducing a criterion for indistinguishability of identities and Synchronization Robustness property. Our protocol not only captures basic security properties such as Perfect Forward Secrecy, Entity Authentication and Key Indistinguishability but also achieved Privacy Preservation and Full Synchronization Robustness. Furthermore, its implementation does not need to rely on a huge and complex Public key Infrastructure(PKI), so we can easily deploy it in a coucurrent environment. Comparison results indicate that the proposal consumes the least computation resource and reasonable communication cost among nine SAKA protocols while equiping 10 security properties.
The key agreement is an important part of the secure communication. By the key agreement protocol. the shared session key is established between communication nodes in order to achieve secure communications in network. In the context of the Internet of Things, the authenticated key agreement protocol proposed in this paper is based on identity-based authenticated key agreement protocol without the bilinear pairing. The protocol mainly includes three parts: initialization, parameter extraction and key agreement. Comparing with the key agreement protocol using bilinear pairings, the protocol not only provides the same level of security and scalability, but also has obvious advantages in terms of energy overhead, time overhead and computational complexity.