Identity-based Key Agreement Protocol Research Articles

Identity-Based Key Agreement for Blockchain-Powered Intelligent Edge

In the new paradigm of blockchain-powered intelligent edge, the key agreement is a significant problem that has not been extensively studied so far. Existing key agreement protocols in the traditional public-key setting are usually too complicated and heavy for edge and end devices. Besides, most protocols in use do not have effective measures to resist side-channel attacks, which are increasingly threatening cloud servers, edge devices, and end devices. Identity (ID)-based protocols can be conveniently implemented in the blockchain-powered intelligent edge. Several leakage-resilient ID-based protocols, which can resist side-channel attacks, have been proposed. However, they all involve time-consuming pairing computations. Besides, none of them address side-channel attacks to the key generation center (KGC). This article designs and realizes two novel ID-based key agreement protocols for the blockchain-powered intelligent edge, including an extended Canetti-Krawczyk (eCK) secure ID-based authenticated key agreement (AKA) protocol and a continuous after-the-fact leakage-resilient eCK (CAFL-eCK) secure ID-based AKA protocol. Both protocols do not involve any heavy pairing computation. Besides, the second one can resist side-channel attacks to the KGC and the communicating parties. A hybrid implementation of the two protocols can achieve high efficiency and strong security at the same time in blockchain-powered intelligent edge environments. This is demonstrated via a use case of a blockchain-powered smart home.

Provably Secure Authentication Protocol for Mobile Clients in IoT Environment Using Puncturable Pseudorandom Function

The Internet of Things (IoT) is a framework of various services and smart technologies that mutually communicate information between mobile devices and users or just between devices with the help of Internet connectivity. The dramatic progression of IoT helps numerous network applications and communication technologies to introduce state-of-the-art communication models for enabling interaction among mobile server, clients, and various other smart entities. Now-a-days, online mobile services have gained huge attention by providing ample convenience to the distant users. However, it is necessary to secure the information, being exchanged among mobile clients and server. Therefore, a large number of authentication protocols have been presented but majority of them are unsuitable to fulfill novel security requirements and standards. Moreover, they are incompatible for the IoT environment due to higher computation and communication complexity. Consequently, there is a dire need of developing an adequate, reliable, and cost-effective authentication protocol. In this article, we introduce a novel identity-based key agreement protocol using the puncturable pseudorandom functions for mobile clients in the IoT environment. The proposed PSK-MC protocol enables two mobile clients to accomplish mutual authentication via server. The proposed protocol is evaluated formally and informally to determine its security strength. The formal security analysis is presented using the widely used random oracle model. Moreover, all the cryptographic operations used at mobile client side are executed on a mobile device, while the operations used at the server side are implemented on a desktop machine to get the experimental results to determine computation cost. The performance analysis reveals the fact that our protocol is comparatively better than related protocols by exhibiting least communication and computation overhead.

A Provably Secure and Lightweight Identity-Based Two-Party Authenticated Key Agreement Protocol for Vehicular Ad Hoc Networks

As an important part of smart cities, vehicle ad hoc networks (VANETs) have attracted much attention from both industry and academia. In a VANET, generating a secure session key to facilitate subsequent data-in-transit transfer between two or more vehicles is crucial, which can be achieved by using an authenticated key agreement protocol. However, most of the existing identity-based two-party authenticated key agreement protocols have significant computational requirements or are known to be insecure. Thus, in this paper, a secure and efficient identity-based two-party authenticated key agreement protocol is presented by us. This protocol does not involve complex bilinear pairing computations and can generate a valid session key in two rounds. The security of the proposed protocol is proved in the eCK model which has better capability to describe a protocol’s security than the famous CK model, and it has been widely used in the security proof of ID-based key agreement protocols currently. Additionally, we also evaluate its performance for potential utility in a VANET.

Group Key Agreement Protocol Based on Privacy Protection and Attribute Authentication

Group key agreement is a good way to ensure secure communication within a group. However, the identity authentication, privacy protection, and information sharing access control (different access rights may exist for different sensitivity of information) are key issues to be solved in group key agreement. Aiming at these problems, this paper proposes a group key agreement protocol based on privacy protection and attribute authentication (GKA-PPAA). The protocol proposes identity authentication for hidden attributes; it not only preserves the advantages of traditional identity-based key agreement protocol, but also provides hiding the identity information and privacy protection of the individual, and also proposes information sharing access control, which different secret information is shared among a set of members who have different levels of authority. It increases the flexibility of group key management. In addition, the group key factors are also calculated before the group key agreement, which eliminates most of the computation overhead due to the group key agreement. This protocol is proven secure under the discrete logarithm problem (DLP) and decisional bilinear Diffie-Hellman (DBDH) problem assumptions. The performance analysis shows that the proposed scheme is much more efficient than the existing ones.

Authenticated Privacy Preserving Pairing-Based Scheme for Remote Health Monitoring Systems

The digitization of patient health information has brought many benefits and challenges for both the patients and physicians. However, security and privacy preservation have remained important challenges for remote health monitoring systems. Since a patient’s health information is sensitive and the communication channel (i.e. the Internet) is insecure, it is important to protect them against unauthorized entities. Otherwise, failure to do so will not only lead to compromise of a patient’s privacy, but will also put his/her life at risk. How to provide for confidentiality, patient anonymity and un-traceability, access control to a patient’s health information and even key exchange between a patient and her physician are critical issues that need to be addressed if a wider adoption of remote health monitoring systems is to be realized. This paper proposes an authenticated privacy preserving pairing-based scheme for remote health monitoring systems. The scheme is based on the concepts of bilinear paring, identity-based cryptography and non-interactive identity-based key agreement protocol. The scheme also incorporates an efficient batch signature verification scheme to reduce computation cost during multiple simultaneous signature verifications.

Round-optimal ID-based dynamic authenticated group key agreement

A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement DAGKA protocol is presented. It is round-optimal, since: 1 in setup and join algorithms, only one round of communication is required; 2 in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman DBDH assumption. In addition, the protocol resists key control attack and achieves forward security.

PF-ID-2PAKA: Pairing Free Identity-Based Two-Party Authenticated Key Agreement Protocol for Wireless Sensor Networks

To ensure secure communication between any two entities, authenticated key agreement protocol is the primary step and current research has a lot of contribution in this direction. In this paper, we propose a Pairing Free Identity-based Two-Party Authenticated Key Agreement protocol and gather the implementation results for Wireless Sensor Networks on MICAz mote by using Relic-toolkit cryptographic library. The proposed protocol is efficient as it does not use any pairing operation and only uses three scalar point multiplications. The security of the protocol has been proved secure using strongest security model for identity-based key agreement protocol presented by Liang et al.

RYY ++ : A Novel Provably Secure Identity‐Based Authenticated Key Agreement Protocol

Based on revisiting the RYY+ Identitybased (ID-Based) key agreement protocol, we find it’s vulnerable to Intermediate results leakage (IRL) and Keycompromise impersonation (KCI) attack. A novel protocol called RYY++ is proposed to make up for its deficiencies. Our protocol follows the Full dual exponential challenge response (FDCR-1) scheme to ensure the signature change every time, so the master public key of Private key generator (PKG) joined in signature generation can guarantee two parties trust each other. The RYY++ protocol is also proven to be secure in the Strengthened extended Canetti– Krawczyk (SeCK) model which provides better support for adversary’s query and has an advantage over most existing protocols on security and efficiency.

Perfect Forward Secure ID-based Key Agreement Protocol in Group Communication

Several identity-based key agreement protocols using bilinear pairing have been proposed in recent years and none of them has achieved all required security properties. In this paper, we firstly propose an ID-based one round authenticated group key agreement protocol with bilinear pairings, where all participants can generate the group session key in one round. Based on the intractability of elliptic curve discrete logarithm problem, every user’s private key can be proved to be secure. Also an extended version of one round authenticated group key agreement protocol is given, it provide perfect forward secrecy and avoid key escrow by the Key Generation Center. Finally, a comprehensive security analysis and a comprehensive security analysis are provided. By comparing with other protocols, the proposed protocol requires lower computation cost.

Perfect Forward Secure ID-based Key Agreement Protocol in Group Communication

Perfect Forward Secure ID-based Key Agreement Protocol in Group Communication

An efficient identity-based key agreement protocol in a multiple PKG environment

Identity-based key agreement protocol affords a natural way to combine the participant’s identity with its public key. However, most of them just consider the key agreement in a single private key generator (PKG) environment. In addition, the existing key agreement protocols have a great computing overhead for mobile computing which is more and more popular today. This paper proposes a new identity based key agreement protocol. With the help of mathematical tools, we make our protocol applied in multiple PKG environment. It also satisfies all the security properties which is set for key agreement protocol. Moreover, some of its time-consuming operations can be delivered to untrusted public computation resources, so its computing complexity can be greatly reduced.

A Pairing-free ID-based Key Agreement Protocol with Different PKGs

This paper proposes an identity based key agreement protocol based on elliptic curve cryptography (ECC) between users of different networks with independent private key generations (PKGs). Instead of bilinear pairings which commonly used for contracting identity based schemes, the proposed protocol makes use of elliptic curves to obtain more computational efficiency. The proposed protocol develops Cao et al’s protocol for situations that two users of independent organizations or networks with separate servers (that in this article, are named PKGs, based on their main duty, generating private keys for the users) want to share a secret key via an insecure link. The main novelty of this paper is security proof of the proposed protocol in the random oracle model. The security proof argues the security attributes of the proposed protocol.

Security weaknesses of a signature scheme and authenticated key agreement protocols

At ACISP 2012, a novel deterministic identity-based (aggregate) signature scheme was proposed that does not rely on bilinear pairing. The scheme was formally proven to be existentially unforgeable under an adaptive chosen message and identity attack. The security was proven under the strong RSA assumption in the random oracle model. In this paper, unfortunately, we show that the signature scheme is universally forgeable, i.e., an adversary can recover the private key of a user and use it to generate forged signatures on any messages of its choice having on average eight genuine signatures. This means, that realizing a deterministic identity-based signature scheme in composite order groups is still an open problem. In addition, we show that a preliminary version of the authenticated key exchange protocol proposed by Okamoto in his invited talk at ASIACRYPT 2007 is vulnerable to the key-compromise impersonation attack and therefore cannot be secure in the eCK model. We also show that the two-party identity-based key agreement protocol of Hölbl et al. is vulnerable to the unknown key-share attack.

New two-party key agreement protocol in separate networks

There is much research about key agreement focus on the secure communication in the same Key Generation Center(KGC),i.e.all the parameters of different participants should be provided by one KGC.To realize the secure communication between two users in different KGCs,adopting elliptic curve cryptography algorithm,a new two-party ID-based key agreement protocol was proposed.This new scheme realized key agreement protocol in separate networks between two participants.Then the improved Blake-Wilson model was used to prove the security of the scheme.After being analyzed,the new protocol was proved to be secure,efficient and of lower computational cost.Therefore,the new scheme will be compatible with low-power and lightweight devices.

On the Security of an Efficient and Non-interactive Hierarchical Key Agreement Protocol

As a fundamental cryptographic primitive, key agreement protocol allows two or more parties to agree on shared keys which will be used to protect their later communication. To resist against the corruption of any number of nodes at any level in the hierarchy, Guo et al. (Comput Secur 30:28---34, 2011) proposed a novel non-interactive hierarchical identity-based key agreement protocol along with a claimed security proof in the random oracle model. Unfortunately, by giving concrete attacks, we indicate that Guo et al.'s protocol is not secure even against the corruption of any leaf or intermediate nodes in the hierarchy. Concretely, the session key of one node will be compromised provided that one of its child node has been corrupted.

A Flexible ID-based Key Agreement Protocol in Group Communication

A Flexible ID-based Key Agreement Protocol in Group Communication

Privacy-preserving ID-based key agreement protocols for cluster-based MANETs

Security support is a significant factor in ad hoc networks. Especially in dynamic topologies, considering clusters, key distribution, key agreement and key management are essential for providing a secure system. It is also necessary to protect the identities of individual nodes in wireless environments to avoid personal privacy concerns. However, many of the existing key agreement schemes for Mobile Ad Hoc Networks MANETs do not consider these security issues concurrently. This paper proposes privacy-preserving ID-based cluster key distribution and key agreement schemes for cluster-based MANETs and proves them in ID-mBJM model. To the best of our knowledge, our proposal is the first in which the anonymity property is combined with cluster-based MANETs. These schemes are secure against a wide variety of attacks and are suitable for privacy-preserving MANETs. Therefore, these schemes can be applied in many different kinds of cluster-based MANETs to protect user's privacy.

Identity-based key agreement protocol employing a symmetric balanced incomplete block design

Key agreement protocol is a fundamental protocol in cryptography whereby two or more participants can agree on a common conference key in order to communicate securely among themselves. In this situation, the participants can securely send and receive messages with each other. An adversary not having access to the conference key will not be able to decrypt the messages. In this paper, we propose a novel identity-based authenticated multi user key agreement protocol employing a symmetric balanced incomplete block design. Our protocol is built on elliptic curve cryptography and takes advantage of a kind of bilinear map called Weil pairing. The protocol presented can provide an identification (ID)-based authentication service and resist different key attacks. Furthermore, our protocol is efficient and needs only two rounds for generating a common conference key. It is worth noting that the com munication cost for generating a conference key in our protocol is only O(n√n) and the computation cost is only O(nm <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ), where n implies the number of participants and m denotes the extension degree of the finite field Fp <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> . In addition, in order to resist the different key attack from malicious participants, our protocol can be further extended to provide the fault tolerant property.

Enhancement of an Authenticated 3-round Identity-Based Group Key Agreement Protocol

In 2008, Gang Yao et al. proposed an authenticated 3-round identity-based group key agreement protocol, which is based on Burmester and Desmedt’s protocol proposed at Eurocrypt 94. However, their protocol can only prevent passive attack. If the active attack is allowed, the protocol is vulnerable and an internal attacker can forge her neighbor’s keying material. It is obvious that the protocol do not achieve the aim of authentication. In this paper, we discuss the flaws to attack this protocol and propose an enhanced provably-secure protocol based on their protocol. At last, we make a detailed security analysis of our enhanced authenticated identity-based group key agreement protocol.

Relations between the security models for certificateless encryption and ID-based key agreement

We discuss the relationship between ID-based key agreement protocols, certificateless encryption and ID-based key encapsulation mechanisms. In particular we show how in some sense ID-based key agreement is a primitive from which all others can be derived. In doing so we focus on distinctions between what we term pure ID-based schemes and non-pure schemes, in various security models. We present security models for ID-based key agreement which do not “look natural” when considered as analogues of normal key agreement schemes, but which look more natural when considered in terms of the models used in certificateless encryption. We illustrate our models and constructions with two running examples, one pairing based and one non-pairing based. Our work highlights distinctions between the two approaches to certificateless encryption and adds to the debate about what is the “correct” security model for certificateless encryption.