Wuhan University Journal of Natural Sciences

Security analysis of broadcaster group key exchange protocols

Li Li, Zhang Huanguo

Published Nov 1, 2006• 0 citations

Abstract

Group key exchange protocols are basic protocols to provide privacy and integrity in secure group communication. This paper discusses the security of one type of group key exchange protocols and defines the kind of protocols as broadcaster group protocols. It points out two attacks on this kind of protocols. The first attack can be avoided by using fresh values in each action during one session of the group protocol. The second attack should be related with concrete application. It also proposes a dynamic key agreement protocol as an example of solutions at the last part of the paper.

DOI: 10.1007/bf02831824

Related papers

Dynamic security analysis of group key agreement protocol

Huaqi Sun, Dongsheng Lin

Group key agreement is a fundamental building block for increasing collaborative applications. The protocol is more complicated than peer-to-peer communication owing to its dynamic characteristics, but the research to date on group key agreement protocols (GKAP) mainly focuses on the static security and the most distinctively dynamic characteristic of GKAP is difficult to analyse by existing methods. The paper attempts to extend the strand space theory to analyse the dynamic security of GKAP. With the aid of the theory, the AT-GDH protocol is taken as an example to discuss the general conditions of the security retention in dynamic cases. A new scheme is proposed of updating the session key when some member leaves the group based on SA-GDH.2 protocol to avoid the single-point weakness.

IEE Proceedings - CommunicationsJan 1, 20055 citations

Group key exchange protocols withstanding ephemeral-key reveals.

María Isabel González Vasco, Ángel Luis Pérez del Pozo, Adriana Suárez Corona

When a group key exchange protocol is executed, the session key is typically extracted from two types of secrets: long-term keys (for authentication) and freshly generated (often random) values. The leakage of this latter so-called ephemeral keys has been extensively analysed in the 2-party case, yet very few works are concerned with it in the group setting. The authors provide a generic group key exchange construction that is strongly secure, meaning that the attacker is allowed to learn both long-term and ephemeral keys (but not both from the same participant, as this would trivially disclose the session key). Their design can be seen as a compiler, in the sense that it builds on a 2-party key exchange protocol which is strongly secure and transforms it into a strongly secure group key exchange protocol by adding only one extra round of communication. When applied to an existing 2-party protocol from Bergsma et al., the result is a 2-round group key exchange protocol which is strongly secure in the standard model, thus yielding the first construction with this property.

Jan 1, 20160 citations

An efficient dynamic group key agreement protocol

YE Cheng-qing

A new efficient dynamic group key agreement protocol was presented to reduce the communication cost in ID-based constant round authenticated group key agreement.All group members constructed a ring structure during the group key agreement.Utilizing the technology proposed in one round tripartite key agreement protocol,about half of group members did not need to broadcast their messages in the second round information exchange in this protocol.So the efficiency of this protocol was improved.Then the group key agreement protocol was extended to suit dynamic group membership.When the membership changed,the number of members participating in the message exchange was only dependent on the number of joining/leaving numbers instead of that of all members.Hence,the total communication cost in the protocol was reduced compared with other protocols.Analysis results show that it is a secure protocol and more efficient than other protocols.

Journal of Zhejiang University(Engineering Science)Jan 1, 20070 citations

Group key exchange protocols withstanding ephemeral‐key reveals

María Isabel González Vasco, Ángel Luis Pérez del Pozo, Adriana Suárez Corona

When a group key exchange protocol is executed, the session key is typically extracted from two types of secrets: long‐term keys (for authentication) and freshly generated (often random) values. The leakage of this latter so‐called ephemeral keys has been extensively analysed in the 2‐party case, yet very few works are concerned with it in the group setting. The authors provide a generic group key exchange construction that is strongly secure, meaning that the attacker is allowed to learn both long‐term and ephemeral keys (but not both from the same participant, as this would trivially disclose the session key). Their design can be seen as a compiler, in the sense that it builds on a 2‐party key exchange protocol which is strongly secure and transforms it into a strongly secure group key exchange protocol by adding only one extra round of communication. When applied to an existing 2‐party protocol from Bergsma et al ., the result is a 2‐round group key exchange protocol which is strongly secure in the standard model, thus yielding the first construction with this property.

IET Information SecuritySep 5, 20173 citations

A group-key agreement protocol secure against the malleability attacks

Seiko Arita, Akihiko Sakuma

In group key agreement protocols, it is important to consider the effects of existence of malicious insiders. In this paper, we define a type of key-control attacks and the security against them for group key agreement protocols with malicious insiders. Then, we give a first ideal functionality of group key agreement that takes key-control attacks (as well as key-integrity attacks) into consideration, and construct a group key agreement protocol that securely realizes the ideal functionality. The construction is efficient enough for practical uses, being comprised of 2 rounds and n messages for n-party groups.

International Symposium on Information Theory and its ApplicationsDec 1, 20083 citations

Constructing group key agreement protocols using mKEMs

Konstantina Papadopoulou

Over the last few years, researchers have introduced many group key agreement protocols, aiming to construct new efficient schemes in terms of both computation and communication. Group key agreement protocols aim to derive a common session key among a group of users, which will be used later in order to achieve secure communication between them. In this thesis, we provide a complete analysis of the protocols that have already been introduced in the literature from 2010 until now and require only one round. The main goal of this analysis is to evaluate these protocols in both communication and computation cost, in order to provide a comprehensive comparative analysis. The second part of the thesis is to analyze and evaluate the multi key encapsulation mechanisms that exist in the literature. A multi key encapsulation mechanism is the encryption technique by which a symmetric cryptographic algorithm is combined with an asymmetric one. To be more specific, such a mechanism uses an asymmetric cryptographic algorithm, as a method to encrypt the session key, while the key is derived by a symmetric cryptographic algorithm. Finally, we propose two new group key agreement protocols which use the multi key encapsulation mechanisms, and compare them with existing group key agreement protocols. These constructions are based on a generic methodology for creating a group key exchange protocol by using multi key encapsulation mechanisms. For this reason, emphasis has been given to both one round group key agreement protocols and multi key encapsulation mechanisms, in order to examine the possibility of combining them

Feb 26, 20180 citations