Contributory Key Agreement Research Articles

SPGS: a secure and privacy-preserving group setup framework for platoon-based vehicular cyber-physical systems

Recently, the platoon-based vehicular cyber-physical system VCPS has attracted significant attention because the platoon based driving pattern can bring many benefits. In the platoon-based VCPS, the platoon members may change quite dynamically because vehicles can join or leave the platoon at any time. Therefore, how to securely and efficiently set up and maintain a platoon is a challenge. To address this issue, in this paper, we propose a secure and privacy-preserving group setup framework, called SPGS, for platoon-based VCPS. The key components of SPGS are two group setup policies that can be developed based on two kinds of techniques: attribute-based encryption and contributory key agreement. Based on these group setup policies, we propose two authentication protocols, respectively. The first one can authenticate all vehicles in the platoon simultaneously. The second one can guarantee anonymous authentication with traceability. With SPGS, a temporary platoon can be securely set up and maintained, and platoon merging/splitting can also be flexibly supported. Finally, we carry out extensive analysis to show the security and efficiency of our proposed SPGS. Copyright © 2016 John Wiley & Sons, Ltd.

Contributory Group Key Agreement in Dynamic Setting

Abstract: protocol proposed by Burmester and Security of many cryptographic protocols hinges on efficient key management mechanism. Many applications in Dynamic Peer Group are becoming increasing popular nowadays. In these group-oriented applications, it is important to establish the group key securely and efficiently. The members in Dynamic Peer Group are symmetrical and dynamic, so the contributory key agreement is more appropriate. In this paper an efficient and authenticated key agreement scheme has been proposed in the Dynamic Peer Group. In this scheme, the members in the Dynamic Peer Group are divided into several clusters according to Linker Cluster Architecture. In each cluster, the members perform the BD protocol to establish the cluster key and the TGDH protocol to generate the group key among the clusters. This method can not only avoid the weakness of AKA (Auxiliary Key Agreement) of BD, but also reduce the computation cost of TGDH scheme. In this scheme the members have been authenticated by an ID-based signature.

A secure authenticated group key agreement protocol for resource-limited mobile devices

With rapid growth of mobile wireless networks, many mobile applications have received significant attention. However, security will be an important factor for their full adoption. Most security technologies currently deployed in wired networks are not fully applicable to wireless networks involved in resource-limited mobile nodes because of their low-power computing capability and limited energy. The design of secure group key agreement protocols is one of many important security issues in wireless networks. A group key agreement protocol involves all participants cooperatively establishing a group key, which is used to encrypt/decrypt transmitted messages among participants over an open channel. Unfortunately, most previously proposed group key agreement protocols are too expensive computationally to be employed in mobile wireless networks. Recently, Bresson et al. proposed an authenticated group key agreement protocol suitable for a mobile wireless network. This mobile wireless network is an asymmetric wireless one that consists of many mobile nodes with limited computing capability and a powerful node with less restriction. However, this protocol does not satisfy some important security properties such as forward secrecy and contributory key agreement. In this paper, we propose a new authenticated group key agreement protocol, which is well suited for this asymmetric wireless network. The proposed protocol not only is efficient but also meets strong security requirements. We demonstrate that the proposed protocol is a real contributory group key agreement one and provides forward secrecy as well as implicit key authentication. The proposed protocol is provably secure against passive adversaries and impersonator's attacks. A simulation result shows that the proposed protocol is well suited for mobile devices with limited computing capability.

Secure group communication using robust contributory key agreement

Contributory group key agreement protocols generate group keys based on contributions of all group members. Particularly appropriate for relatively small collaborative peer groups, these protocols are resilient to many types of attacks. Unlike most group key distribution protocols, contributory group key agreement protocols offer strong security properties such as key independence and perfect forward secrecy. We present the first robust contributory key agreement protocol resilient to any sequence of group changes. The protocol, based on the Group Diffie-Hellman contributory key agreement, uses the services of a group communication system supporting virtual synchrony semantics. We prove that it provides both virtual synchrony and the security properties of Group Diffie-Hellman, in the presence of any sequence of (potentially cascading) node failures, recoveries, network partitions, and heals. We implemented a secure group communication service, Secure Spread, based on our robust key agreement protocol and Spread group communication system. To illustrate its practicality, we compare the costs of establishing a secure group with the proposed protocol and a protocol based on centralized group key management, adapted to offer equivalent security properties.

Key management approaches to offer data confidentiality for secure multicast

Multicasting is an efficient way to deliver data to a large group of users in applications such as Internet stock quotes, audio and music delivery, file and video distribution, etc. Many of these applications require the security feature of data confidentiality, which is not readily offered by the open nature of multicast. In order to offer such confidentiality, the encryption and decryption keys must be constantly changed upon a membership change. In this article, after discussing some performance criteria to offer secure multicast, we present a number of the proposed key management schemes for data confidentiality. We categorize these schemes into four groups: key tree-based approaches, contributory key agreement schemes supported by the Diffie-Hellman algorithm, computational number theoretic approaches, and secure multicast framework approaches. Through examples, we describe the operation of the schemes and compare their performances.