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

International Journal of Communication Systems

An efficient certificateless key exchange protocol for heterogeneous networks in human‐centered IoT systems

Li Chen, Ke Zhang, Saru Kumari, Muhammad Khurram Khan, Zhiying Kong, Pradeep Chaudhary

Published Aug 5, 2019• 3 citations
Publisher

Abstract

Summary Human‐centered Internet of things (IoT) systems enable human beings to enjoy the ubiquitous services and play more and more important roles in our life. A common application scenario in human‐centered IoT systems is that two distributed wireless devices from heterogeneous networks want to communicate with each other. However, key generation centers (KGCs) from different networks usually use independent security parameters. It is difficult for two users with different security parameters to establish a common session key. We propose a certificateless key exchange protocol for two different devices managed by different KGCs to address the issue. The security of the proposed protocol is conducted in the random oracle model with the hardness assumption of elliptic curve computational Diffie‐Hellman (ECDH) problem. The main merits of our protocol include the following: (a) it enables users from heterogeneous networks to establish upon a shared session key, (b) it can solve the key escrow problem, (c) it does not use bilinear pairings and obtains computational efficiency, and (d) it achieves stronger security compared with other related protocols.

DOI
10.1002/dac.4093

Related papers

Lightweight Certificateless Authenticated Key Agreement Protocol

Gervais Mwitende

Data security and privacy are important to prevent the reveal, modification and unauthorized usage of sensitive information. The introduction of using critical power devices for internet of things (IoTs), e-commerce, e-payment, and wireless sensor networks (WSNs) has brought a new challenge of security due to the low computation capability of sensors. Therefore, the lightweight authenticated key agreement protocols are important to protect their security and privacy. Several researches have been published about authenticated key agreement. However, there is a need of lightweight schemes that can fit with critical capability devices. Addition to that, a malicious key generation center (KGC) can become a threat to watch other users, i.e impersonate user by causing the key escrow problem. Therefore, we propose a lightweight certificateless Authenticated Key Agreement (AKA) based on the computation Diffie-Hellman problem (CDHP). The proposed protocol maintains the characteristics of certificateless public key cryptography. The protocol is split into two combined phases. In the first phase, our protocol establishes a session key between users (sender and receiver). In the second phase, we use a lightweight proxy blind signature based on elliptic curve discrete logarithm problem (ECDLP). The used proxy signature has small computation costs, and can fit for small devices such sensors and protects against un-authentication and un-authorization on decentralized system. Compared to the existing AKA schemes, our scheme has small computation costs. The protocol achieves the well known security features compared to the related protocols.

•Oct 28, 2023•0 citations

A new certificateless authenticated key agreement protocol for SIP with different KGCs

Xiaowei Li, Yuqing Zhang, Geifei Zhang

ABSTRACT Session Initiation Protocol, which can be applied to various networks for establishing, modifying, and terminating multimedia sessions, has received much attention in these years because of its wide applications. Because different users may belong to different networks and different networks may have different Key Generation Centers in identity‐based networks, how to make different networks be compatible and how to make users belong to different Key Generation Centers can establish a secure Session Initiation Protocol session become two key problems. In this paper, we propose a new certificateless authenticated key agreement protocol for different networks to address the problems. The protocol is provably secure against a fully adaptive adversary in the random oracle model, provided that the underlying problem of Gap Bilinear Diffie–Hellman problem is hard. Moreover, our scheme has good performance compared with the certificateless authentication key agreement protocols using pairings. The trick proposed in this paper may give some help in making different networks be compatible. Copyright © 2012 John Wiley & Sons, Ltd.

Security and Communication Networks•Jul 5, 2012•10 citations

An asymmetric group key agreement protocol based on attribute threshold for Internet of Things

Yong Gan, Bingli Wang, Yuan Zhuang +3 more

Abstract With the development of wireless mobile network and Internet of Things (IoT), users enter the network with a large amount of data and information, including some important personal information, such as ID number, telephone number. Personal privacy disclosure has become one of the focuses of attention. In this article, we propose an asymmetric group key agreement (GKA) protocol based on attribute threshold for IoT to protect user privacy. Users do not need to expose any personal information in the group, but only need to meet the same number of attributes and conduct bidirectional authentication registration with key generation center (KGC) to ensure the legitimacy of mobile terminal members participating in GKA. In the registration phase, user performs heavy preliminary calculations according to the designed protocol, thereby reducing the computation in the key agreement phase and decreasing the complexity of the protocol. The protocol can realize self‐verification, and any member participating in key agreement can verify the correctness of the negotiated key by themselves. Under the assumption of bilinear computational Diffie‐Hellman problem, the security of the protocol is proved. Performance analysis further shows that our protocol has lower energy consumption in terms of communication and computing.

Transactions on Emerging Telecommunications Technologies•Nov 25, 2020•9 citations

A Provably Secure and Practical PUF-Based End-to-End Mutual Authentication and Key Exchange Protocol for IoT

Sensen Li, Tikui Zhang, Bin Yu +1 more

Device authentication and key exchange are essential issues for Internet of Things (IoT) which plays an indispensable role in modern life. Many sensor devices in IoT, with limited resources and poor self-protection capabilities, are deployed in the unattended and open places, making them vulnerable to physical attacks while facing traditional security threats. Despite several researches have been conducted by using the physical unclonable function (PUF) to immune the communication between IoT devices from the security threats above, as per the knowledge of the authors, current solutions rely on the participation of the server to distribute the key parameters, which requires high message overhead and markedly influences the efficiency. To fill this gap, this article proposes an end-to-end mutual authentication and key exchange protocol for IoT by combining PUF with certificateless public key cryptography (CL-PKC) on elliptic curve, which only needs “three handshakes” without the real-time participation of the server. The security analysis shows that the proposed protocol can not only secure the IoT devices from various attacks, but also provide perfect forward secrecy. Moreover, the experimental validation and performance analysis show the proposed protocol outperforms existing related protocols in terms of security features, protocol rounds and communication cost.

IEEE Sensors Journal•Oct 6, 2020•125 citations

Development of Authenticated Key Exchange Protocol for IoT Sensor Layer

Yoanes Bandung, Arvandy Arvandy

An authenticated key exchange for the Internet of Things (IoT) sensor layer is discussed in this paper. This paper presents an enhanced key exchange protocol to provide an authentication scheme and data confidentiality for IoT sensor layer. In our approach, we incorporate an identity-based authentication scheme into the existing key exchange protocol based on Elliptic Curve Diffie Hellman (ECDH). We utilize two communication channels for the process, main channel and auxiliary channel. The main channel is used to exchange key and sensor data and the auxiliary channel is used to exchange the identity information prior to the key exchange process. To provide the data confidentiality, AES encryption algorithm is implemented with a key derived from shared secret key to ensure the Perfect Forward Secrecy. For the evaluations, there are four parameters that are evaluated: the protocol resistance, formal verification of protocol, the protocol security, and performance testing. The protocol resistance was evaluated using security analysis against common security threats on IoT sensor layer. The formal verification of the proposed protocol was evaluated using Scyther, and the protocol security was evaluated using attack scenarios (i.e., authentication and sniffing attack) to prove the authentication and confidentiality. The performance testing was conducted to measure time complexity and memory complexity of the protocol. The experiment results show that the proposed protocol is able to provide an authentication mechanism, data confidentiality, and resilience against common security threats at IoT sensor layers.

International Journal on Electrical Engineering and Informatics•Sep 30, 2020•2 citations

Provably secure lightweight certificateless lattice‐based authenticated key exchange scheme for IIoT

Zuowen Tan, Jintao Jiao, Yanliang Chen

Summary Through the Industrial Internet of Things (IIoT), the manufacturing enterprises have significantly enhanced the production efficiency. The transmission of data in IIoT over public channels has brought about information leakage issues. Therefore, it is crucial to agree on a session key among the participants. In recent years, numerous authenticated key exchange (AKE) schemes have been designed. However, those AKE schemes which adopt the certificateless approach to tackle certificate management and key escrow may remain vulnerable to quantum attacks, and other AKE schemes which are based on lattice hard problem so as to achieve the post quantum security may incur key management issues. To simultaneously address the aforementioned challenges, we propose a lightweight certificateless lattice‐based authenticated key exchange (C2LAKE) scheme. Upon the hardness assumptions of the inhomogeneous small integer solution (ISIS) and computational bilateral inhomogeneous small integer solution (CBi‐ISIS) problems, the C2LAKE scheme has been demonstrated to be secure in the eCK model and the random oracle model (ROM). Better trade‐off among security and functionality features, and communication and computation costs make the C2LAKE scheme suitable and applicable in the IIoT environment.

Concurrency and Computation Practice and Experience•Dec 27, 2023•2 citations
Summary Human‐centered Internet of things (IoT) systems enable human beings to enjoy the ubiquitous services and play more and more important roles in our life. A common application scenario in human‐centered IoT systems is that two distributed wireless devices from heterogeneous networks want to communicate with each other. However, key generation centers (KGCs) from different networks usually use independent security parameters. It is difficult for two users with different security parameters to establish a common session key. We propose a certificateless key exchange protocol for two different devices managed by different KGCs to address the issue. The security of the proposed protocol is conducted in the random oracle model with the hardness assumption of elliptic curve computational Diffie‐Hellman (ECDH) problem. The main merits of our protocol include the following: (a) it enables users from heterogeneous networks to establish upon a shared session key, (b) it can solve the key escrow problem, (c) it does not use bilinear pairings and obtains computational efficiency, and (d) it achieves stronger security compared with other related protocols.
Data security and privacy are important to prevent the reveal, modification and unauthorized usage of sensitive information. The introduction of using critical power devices for internet of things (IoTs), e-commerce, e-payment, and wireless sensor networks (WSNs) has brought a new challenge of security due to the low computation capability of sensors. Therefore, the lightweight authenticated key agreement protocols are important to protect their security and privacy. Several researches have been published about authenticated key agreement. However, there is a need of lightweight schemes that can fit with critical capability devices. Addition to that, a malicious key generation center (KGC) can become a threat to watch other users, i.e impersonate user by causing the key escrow problem. Therefore, we propose a lightweight certificateless Authenticated Key Agreement (AKA) based on the computation Diffie-Hellman problem (CDHP). The proposed protocol maintains the characteristics of certificateless public key cryptography. The protocol is split into two combined phases. In the first phase, our protocol establishes a session key between users (sender and receiver). In the second phase, we use a lightweight proxy blind signature based on elliptic curve discrete logarithm problem (ECDLP). The used proxy signature has small computation costs, and can fit for small devices such sensors and protects against un-authentication and un-authorization on decentralized system. Compared to the existing AKA schemes, our scheme has small computation costs. The protocol achieves the well known security features compared to the related protocols.
ABSTRACT Session Initiation Protocol, which can be applied to various networks for establishing, modifying, and terminating multimedia sessions, has received much attention in these years because of its wide applications. Because different users may belong to different networks and different networks may have different Key Generation Centers in identity‐based networks, how to make different networks be compatible and how to make users belong to different Key Generation Centers can establish a secure Session Initiation Protocol session become two key problems. In this paper, we propose a new certificateless authenticated key agreement protocol for different networks to address the problems. The protocol is provably secure against a fully adaptive adversary in the random oracle model, provided that the underlying problem of Gap Bilinear Diffie–Hellman problem is hard. Moreover, our scheme has good performance compared with the certificateless authentication key agreement protocols using pairings. The trick proposed in this paper may give some help in making different networks be compatible. Copyright © 2012 John Wiley & Sons, Ltd.
Abstract With the development of wireless mobile network and Internet of Things (IoT), users enter the network with a large amount of data and information, including some important personal information, such as ID number, telephone number. Personal privacy disclosure has become one of the focuses of attention. In this article, we propose an asymmetric group key agreement (GKA) protocol based on attribute threshold for IoT to protect user privacy. Users do not need to expose any personal information in the group, but only need to meet the same number of attributes and conduct bidirectional authentication registration with key generation center (KGC) to ensure the legitimacy of mobile terminal members participating in GKA. In the registration phase, user performs heavy preliminary calculations according to the designed protocol, thereby reducing the computation in the key agreement phase and decreasing the complexity of the protocol. The protocol can realize self‐verification, and any member participating in key agreement can verify the correctness of the negotiated key by themselves. Under the assumption of bilinear computational Diffie‐Hellman problem, the security of the protocol is proved. Performance analysis further shows that our protocol has lower energy consumption in terms of communication and computing.
Device authentication and key exchange are essential issues for Internet of Things (IoT) which plays an indispensable role in modern life. Many sensor devices in IoT, with limited resources and poor self-protection capabilities, are deployed in the unattended and open places, making them vulnerable to physical attacks while facing traditional security threats. Despite several researches have been conducted by using the physical unclonable function (PUF) to immune the communication between IoT devices from the security threats above, as per the knowledge of the authors, current solutions rely on the participation of the server to distribute the key parameters, which requires high message overhead and markedly influences the efficiency. To fill this gap, this article proposes an end-to-end mutual authentication and key exchange protocol for IoT by combining PUF with certificateless public key cryptography (CL-PKC) on elliptic curve, which only needs “three handshakes” without the real-time participation of the server. The security analysis shows that the proposed protocol can not only secure the IoT devices from various attacks, but also provide perfect forward secrecy. Moreover, the experimental validation and performance analysis show the proposed protocol outperforms existing related protocols in terms of security features, protocol rounds and communication cost.
An authenticated key exchange for the Internet of Things (IoT) sensor layer is discussed in this paper. This paper presents an enhanced key exchange protocol to provide an authentication scheme and data confidentiality for IoT sensor layer. In our approach, we incorporate an identity-based authentication scheme into the existing key exchange protocol based on Elliptic Curve Diffie Hellman (ECDH). We utilize two communication channels for the process, main channel and auxiliary channel. The main channel is used to exchange key and sensor data and the auxiliary channel is used to exchange the identity information prior to the key exchange process. To provide the data confidentiality, AES encryption algorithm is implemented with a key derived from shared secret key to ensure the Perfect Forward Secrecy. For the evaluations, there are four parameters that are evaluated: the protocol resistance, formal verification of protocol, the protocol security, and performance testing. The protocol resistance was evaluated using security analysis against common security threats on IoT sensor layer. The formal verification of the proposed protocol was evaluated using Scyther, and the protocol security was evaluated using attack scenarios (i.e., authentication and sniffing attack) to prove the authentication and confidentiality. The performance testing was conducted to measure time complexity and memory complexity of the protocol. The experiment results show that the proposed protocol is able to provide an authentication mechanism, data confidentiality, and resilience against common security threats at IoT sensor layers.
Summary Through the Industrial Internet of Things (IIoT), the manufacturing enterprises have significantly enhanced the production efficiency. The transmission of data in IIoT over public channels has brought about information leakage issues. Therefore, it is crucial to agree on a session key among the participants. In recent years, numerous authenticated key exchange (AKE) schemes have been designed. However, those AKE schemes which adopt the certificateless approach to tackle certificate management and key escrow may remain vulnerable to quantum attacks, and other AKE schemes which are based on lattice hard problem so as to achieve the post quantum security may incur key management issues. To simultaneously address the aforementioned challenges, we propose a lightweight certificateless lattice‐based authenticated key exchange (C2LAKE) scheme. Upon the hardness assumptions of the inhomogeneous small integer solution (ISIS) and computational bilateral inhomogeneous small integer solution (CBi‐ISIS) problems, the C2LAKE scheme has been demonstrated to be secure in the eCK model and the random oracle model (ROM). Better trade‐off among security and functionality features, and communication and computation costs make the C2LAKE scheme suitable and applicable in the IIoT environment.