Certificateless Authenticated Key Agreement Research Articles

An efficient and secure CLAKA protocol for blockchain-aided wireless body area networks

The effective usage of a WBAN elaborated as a wireless body area network in remote healthcare services is made conceivable by the speedy progression of wireless transmission technologies. Wearable sensors are used in WBANs to gather patient health information and communicate it over a public channel to the controller node. Due to the wireless nature of communication, many attacks can be attempted over WBAN communication. This necessitates an appropriately authenticated key agreement mechanism and protected information transfer between the user’s device and the controller node. The key escrow issue plagues identity-based systems and is avoided by certificateless authenticated key agreement (CLAKA) protocols, which also eliminate certificateless operational overheads in public key infrastructure. This paper proposes an efficient and secure protocol named ES-CLAKA for WBANs based on blockchain, which satisfies multiple security features. Informal analysis confirms that the attributes of forward security, key security, known temporary key security, key control security, key escrow, anonymity, verifiability, consensus, immutability, and unknown key share are fulfilled by ES-CLAKA. The security of the authenticated key-establishment phase and the concealment of the established key have been established through a formal analysis of the ES-CLAKA protocol utilizing the BAN logic and the ROR model, respectively. Results show that compared to the other most effective CLAKA protocols, ES-CLAKA consumes 47.4% less computational time, 20% less communication bandwidth, and 16.67% less storage overhead under reasonable assumptions. Comparative assessment of the security attributes has revealed that, when equated to other analogous schemes, the proposed ES-CLAKA protocol offers the highest level of security.

A secure and efficient certificateless authenticated key agreement protocol for smart healthcare

As more and more important smart healthcare becomes in people’s daily life, its security issues draw increasing attention. It is stringent to design trusty communication protocol guaranteeing the data security and users privacy. Recently, Wang et al. proposed a certificateless authenticated key agreement (CL-AKA) protocol such that providing a resolution to transmit unforged data over open channel in smart healthcare. Claiming that their protocol could resist attacks from two types of adversaries, Wang et al. also compared their protocol with several related works. However, in this paper, we analyze their protocol and point out that the protocol lacks forward security. Moreover, aiming at remedying such defects, this paper proposes an improved CL-AKA protocol. Not only does the improved CL-AKA protocol satisfy the security requirements but also behaves efficient compared with other related works.

A Certificateless Authenticated Key Agreement Scheme for the Power IoT

Power Internet of Things (IoT) is the application of IoT technology in the field of power grid, which can better control all kinds of power equipment, power personnel and operating environment. However, access to mass terminals brings higher requirements for terminal authentication and key management for the power IoT. And the traditional public key infrastructure (PKI) and identity-based public key cryptography (IB-PKC) exist the problems of certificate management and key escrow. Therefore, the paper proposes a novel authenticated key agreement scheme based on the certificateless public key cryptography (CL-PKC) mechanism. In addition, the proposed scheme is proven with the improved extended Canetti-Krawczyk (eCK) security model. Finally, the implementation of the authenticated key agreement protocol is given based on the actual application requirement of the power IoT, and the analysis and comparison of the simulation demonstrates that the proposed scheme has higher efficiency and would be suitable for the power IoT.

Certificateless authenticated key agreement for blockchain-based WBANs

Abstract Authenticated key agreement (AKA) enables communicating parties to mutually establish a session key, in a way that each entity is assured of the authentication of its peer. Certificateless AKA (CLAKA) protocols are widely designed since they avoid the key escrow problem found in identity-based systems and overcome certificateless management overheads in Public Key Infrastructure (PKI). Furthermore, the existing CLAKA were designed to operate in centralized network. Such architecture is a single point of management and single point of failure. We need lightweight protocols that fit with body sensors capabilities. In order to mitigate the aforementioned vulnerabilities, we propose a pairing-based certificateless against the key escrow problem. Our protocol operates in a decentralized system against the single point of failure and management. The protocol establishes a session key in the first phase for communications. The ring signature is used in the second phase for node authentication. The ring signature has advantage of reducing computation costs where a node signs a signature on behalf of others. The signing node remains anonymous and other nodes can verify the signature. Another advantage of ring signature is that there is no specification about the size of the group.

Authenticated key agreement for blockchain-based WBAN

Certificateless authenticated key agreement (CLAKA) is important to prevent the escrow problem. It also mitigates the certificate management burden in storage and during the message exchange. However, many previously designed CLAKA protocols were designed in the centralized system architectures that may cause the single point of failure. A new CLAKA is designed in a decentralized (blockchain) architecture that is very suitable for wireless body area networks (WBANs). The proposed protocol is secure as long as it computes a common session key between WBAN user and blockchain nodes. An ID-based blind signature with message recovery is used between blockchain nodes. The blind signature with message recovery is used to achieve authentication and anonymity by acquiring a signature without disclosing the message. It also has advantage in minimizing the size of signature and it is efficient in a situation of limited bandwidth. The protocol analysis shows that it is secure and can resist many WBAN security attacks compared to the existing authenticated key agreement protocols.

Cryptanalysis of certificateless authenticated key agreement protocols

In this work, we cryptanalyse two certificateless authenticated key agreement (CL-AKA) protocols, Bala et al. (2018) and Xie et al. (2019), which are recently proposed claiming provable security. Specifically, we show impersonation attacks against the two protocols with successful probability 1 in extended eCK model using at most two queries. Then, the process of our cryptanalysis is abstracted to a general method for cryptanalysing a specific class of CL-AKA protocols which we call linearly-expressible CL-AKA protocol. Our method suggests new security requirements of CL-AKA protocols.

Cryptanalysis of certificateless authenticated key agreement protocols

In this work, we cryptanalyse two certificateless authenticated key agreement (CL-AKA) protocols, Bala et al. (2018) and Xie et al. (2019), which are recently proposed claiming provable security. Specifically, we show impersonation attacks against the two protocols with successful probability 1 in extended eCK model using at most two queries. Then, the process of our cryptanalysis is abstracted to a general method for cryptanalysing a specific class of CL-AKA protocols which we call linearly-expressible CL-AKA protocol. Our method suggests new security requirements of CL-AKA protocols.

An efficient eCK secure certificateless authenticated key agreement scheme with security against public key replacement attacks

Authenticated Key Agreement (AKA) protocol enables two communicating entities to mutually establish a session key, in such a way that each entity is assured of the authenticity of its peer. Certificateless AKA (CL-AKA) protocols are widely researched, since, it eliminates the key escrow problem in Identity based systems and the cumbersome certificate management overheads associated with the Public Key Infrastructure (PKI) model. However, AKA protocols in the Certificateless setting suffer from public key replacement attacks, since, the user public keys cannot be validated explicitly by certificates. Our investigations reveal that the existing eCK- secure CL-AKA protocols are vulnerable to basic impersonation attacks and Man-in-the-middle attacks by the Key Generation Center (KGC). Moreover, public key replacement attacks by other malicious users can prevent communicating entities from ever agreeing upon a valid session key. In order to mitigate the aforementioned vulnerabilities, we propose the first eCK secure CL-AKA scheme with security against public key replacement attacks by the KGC, as well as, the external adversaries. Contrary to the conventional CL-AKA protocols, the proposed scheme does not have a partial private key escrow at the KGC and does not require secure authenticated channels for the transmission of the partial private keys from the KGC to individual users. Furthermore, we cryptanalyze two of the most recently proposed CL-AKA protocols, to illustrate their lack of eCK security and discuss the flaws in their security proofs. Comparative analysis of the proposed scheme with other CL-AKA protocols in the literature reveals that the proposed scheme offers better efficiency and security.

Efficient two-party certificateless authenticated key agreement protocol under GDH assumption

Security and efficiency are two key requirements for most of the authentication protocol, especially for the mobile wireless network. However, security and efficiency are a contradiction for the design of authentication protocol, it is hard to meet the two requirements simultaneously. Since certificateless public key cryptography (CL-PKC) has an advantage in wiping off key escrow problem, many certificateless authentication key agreement (CL_AKA) protocols have been proposed. The existing CL_AKA protocols may meet either security requirement well or efficiency requirement well, but cannot meet the two well. In this paper, we propose an efficient two-party CL_AKA protocol with strong security. We perform an in-depth security analysis in extended Canetti-Krawczyk (eCK) model to show the proposed CL_AKA protocol is provably secure. The performance analysis shows that the proposed protocol can meet the strong security and efficiency requirements simultaneously.

A strongly secure pairing-free certificateless authenticated key agreement protocol under the CDH assumption

Certificateless authenticated key agreement (CL-AKA) protocols have been studied a great deal since they neither suffer from a heavy certificate management burden nor have the key escrow problem. Recently, many efficient CL-AKA protocols without pairings have been built. However, these pairing-free CL-AKA protocols are either not proved in any formal security model or proved under the gap Diffie-Hellman (GDH) assumption, a non-standard and strong assumption. With available implementation technologies, pairings are needed to realize the GDH assumption, which means that these pairing-free CL-AKA protocols are not pure pairing-free. Furthermore, these protocols are insecure in the strengthened eCK (seCK) model, which encompasses the eCK model and considers leakages on intermediate results. In this paper, we present a pure pairing-free CL-AKA protocol, which is provably secure in the seCK model under the standard computational Diffie-Hellman (CDH) assumption. Compared with the existing CL-AKA protocols, the proposed protocol has advantage over them in security or efficiency.

A strongly secure pairing-free certificateless authenticated key agreement protocol suitable for smart media and mobile environments

The authenticated key agreement (AKA) protocol is an important cryptographic mechanism, which allows two users to establish a session key for future communication. Recently, the certificateless public key cryptography received wide attention since it could solve the certificate management problem in the traditional public key cryptography and solve the key escrow problem in the identity-based public key cryptography. In this paper, we present a strongly secure certificateless authenticated key agreement (CLAKA) protocol without pairing suitable for smart media and mobile environments, which is provably secure in the extended Canetti---Krawczyk (eCK) model and is secure as long as each party has at least one uncompromised secret. Compared with previous CLAKA protocols, our protocol has advantages over them in security or efficiency.

A novel pairing-free certificateless authenticated key agreement protocol with provable security

Recently, He et al. (Computers and Mathematics with Applications, 2012) proposed an efficient pairing-free certificateless authenticated key agreement (CL-AKA) protocol and claimed their protocol was provably secure in the extended Canetti-Krawczyk (eCK) model. By giving concrete attacks, we indicate that their protocol is not secure in the eCK model. We propose an improved protocol and show our improvement is secure in the eCK model under the gap Diffie-Hellman (GDH) assumption. Furthermore, the proposed protocol is very efficient.

A Strongly Secure Pairing-free Certificateless Authenticated Key Agreement Protocol for Low-Power Devices

Certificateless authenticated key agreement (CL-AKA) protocols neither suffer from a heavy certificate managementburden nor have the key escrow problem. Recently, many CL-AKA protocols have been proposed. However, manyof them need expensive bilinear pairings, which cannot be suitable for low-power devices such as sensors or mobile devices.To be implemented in practice, some pairing-free CL-AKA protocols have been built, however, very few of these pairing-freeCL-AKA protocols can be secure in the eCK model. In this paper, we present a pairing-free CL-AKA protocol and providea full proof of its security in the eCK model. Compared with the existing CL-AKA protocols, our protocol is more secure,practical and suitable for low-power devices. DOI: http://dx.doi.org/10.5755/j01.itc.42.2.1689

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

ABSTRACTSession 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.

An efficient certificateless two-party authenticated key agreement protocol

Since certificateless public key cryptography (CLPKC) has received widespread attention due to its efficiency in avoiding key escrow problems in identity-based public key cryptography (ID-PKC), the certificateless authenticated key agreement (CLAKA) protocol, an important part of CLPKC, has been studied a great deal. Most CLAKA protocols are built from pairings which need costly operations. To improve the performance, several pairing-free CLAKA protocols have been proposed. In this paper, we propose a new pairing-free CLAKA protocol. Compared with the related protocols, our protocol has better performance. Also, our protocol is provably secure in a very strong security model—the extended Canetti–Krawczyk (eCK) model.