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

Lecture notes in computer science

Malicious Participants in Group Key Exchange: Key Control and Contributiveness in the Shadow of Trust

Emmanuel Bresson, Mark Manulis

Published Aug 11, 2007• 31 citations
Publisher
DOI
10.1007/978-3-540-73547-2_41

Related papers

Malicious Participants in Group Key Exchange: Key Control and Contributiveness in the Shadow of Trust (Extended Abstract)

Emmanuel Bresson, Mark Manulis

Group key exchange protocols allow their participants to compute a secret key which can be used to ensure security and privacy for various multi- party applications. The resulting group key should be computed through coop- eration of all protocol participants such that none of them is trusted to have any advantage concerning the protocol's output. This trust relationship states the main difference between group key exchange and group key transport protocols. Obvi- ously, misbehaving participants in group key exchange protocols may try to influ- ence the resulting group key, thereby disrupting this trust relationship, and also causing further security threats. This paper analyzes the currently known secu- rity models for group key exchange protocols with respect to this kind of attacks by malicious participants and proposes an extended model to remove the identi- fied limitations. Additionally, it proposes an efficient and provably secure generic solution, a compiler, to guarantee these additional security goals for group keys exchanged in the presence of malicious participants.

•Jan 1, 2007•0 citations

Non-interactive Key Exchange: New Notions, New Constructions, and Forward Security

Suvradip Chakraborty, Dennis Hofheinz, Roman Langrehr

Lecture notes in computer science•Jan 1, 2025•1 citation

Contributory group key exchange in the presence of malicious participants

Emmanuel Bresson, Mark Manulis

In a group key exchange (GKE) protocol, the resulting group key should be computed by all participants such that none of them can gain any advantage concerning the protocol's output: misbehaving participants might have personal advantage in influencing the value of the group key. In fact, the absence of trust relationship is the main feature of GKE (when compared with group key transport) protocols. The existing notions of security are enlarged by identifying limitations in some previously proposed security models while taking into account different types of corruptions (weak and strong). To illustrate these notions, two efficient and provably secure generic solutions, compilers, are presented.

IET Information Security•Aug 30, 2008•23 citations

Security Analysis on a Group Key Transfer Protocol Based on Secret Sharing

Mijin Kim, Namje Park, Dongho Won

Lecture notes in electrical engineering•Aug 19, 2013•1 citation

Towards ID-Based Authenticated Group Key Exchange Protocol with Identifying Malicious Participants

Tsu‐Yang Wu, Yuh‐Min Tseng

An authenticated group key exchange (AGKE) protocol allows participants to construct a common key and provide secure group communications in cooperative and distributed applications. Recently, Choi et al. proposed an identity (ID)-based authenticated group key exchange (IDAGKE) protocol from bilinear pairings. However, their protocol suffered from an insider colluding attack because it didn't realize the security issue of withstanding insider attacks. Withstanding insider attacks mean that it can detect whether malicious participants exist in the group key exchange protocol. Nevertheless, an AGKE protocol resistant to insider attacks is still unable to find “who are malicious participants”. In this paper, we propose an ID-based AGKE protocol with identifying malicious participants. In our protocol, we use a confirmed computation property to achieve identifying malicious participants. Certainly, it is also secure against insider attacks. In the random oracle model and under related mathematical hard problems, we prove that the proposed protocol a secure AGKE protocol with identifying malicious participants.

Informatica•Jan 1, 2012•17 citations

Group Key Exchange Resilient to Leakage of Ephemeral Secret Keys with Strong Contributiveness

Cheng Chen, Yanfei Guo, Rui Zhang

Lecture notes in computer science•Jan 1, 2013•2 citations
Group key exchange protocols allow their participants to compute a secret key which can be used to ensure security and privacy for various multi- party applications. The resulting group key should be computed through coop- eration of all protocol participants such that none of them is trusted to have any advantage concerning the protocol's output. This trust relationship states the main difference between group key exchange and group key transport protocols. Obvi- ously, misbehaving participants in group key exchange protocols may try to influ- ence the resulting group key, thereby disrupting this trust relationship, and also causing further security threats. This paper analyzes the currently known secu- rity models for group key exchange protocols with respect to this kind of attacks by malicious participants and proposes an extended model to remove the identi- fied limitations. Additionally, it proposes an efficient and provably secure generic solution, a compiler, to guarantee these additional security goals for group keys exchanged in the presence of malicious participants.
In a group key exchange (GKE) protocol, the resulting group key should be computed by all participants such that none of them can gain any advantage concerning the protocol's output: misbehaving participants might have personal advantage in influencing the value of the group key. In fact, the absence of trust relationship is the main feature of GKE (when compared with group key transport) protocols. The existing notions of security are enlarged by identifying limitations in some previously proposed security models while taking into account different types of corruptions (weak and strong). To illustrate these notions, two efficient and provably secure generic solutions, compilers, are presented.
An authenticated group key exchange (AGKE) protocol allows participants to construct a common key and provide secure group communications in cooperative and distributed applications. Recently, Choi et al. proposed an identity (ID)-based authenticated group key exchange (IDAGKE) protocol from bilinear pairings. However, their protocol suffered from an insider colluding attack because it didn't realize the security issue of withstanding insider attacks. Withstanding insider attacks mean that it can detect whether malicious participants exist in the group key exchange protocol. Nevertheless, an AGKE protocol resistant to insider attacks is still unable to find “who are malicious participants”. In this paper, we propose an ID-based AGKE protocol with identifying malicious participants. In our protocol, we use a confirmed computation property to achieve identifying malicious participants. Certainly, it is also secure against insider attacks. In the random oracle model and under related mathematical hard problems, we prove that the proposed protocol a secure AGKE protocol with identifying malicious participants.