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

Flexible Group Key Exchange with On-demand Computation of Subgroup Keys

Michel Ferreira Abdalla, Céline Chevalier, Mark Manulis, David Pointcheval

Published Jan 1, 2010• 23 citations
Publisher
DOI
10.1007/978-3-642-12678-9_21

Related papers

Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys

Mark Manulis

Lecture notes in computer science•Jan 1, 2009•10 citations

Flexible Group Non-interactive Key Exchange in the Standard Model

Li Duan, Yong Li, Lijun Liao

Lecture notes in computer science•Jan 1, 2022•0 citations

Computationally-Fair Group and Identity-Based Key-Exchange

Andrew Chi-Chih Yao, Yunlei Zhao

Lecture notes in computer science•Jan 1, 2012•2 citations

Flexible Group Key Exchange with On-Demand Computation of Subgroup Keys (Full Version)

Michel Ferreira Abdalla, Mark Manulis, David Pointcheval

Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, oer exible forms of com- munication and exchange of data. At any time point concurrent communication sessions involv- ing dierent subsets of users can be invoked. The traditional tool for achieving security in a multi-party communication environment are group key exchange (GKE) protocols that provide participants with a secure group key for their subsequent communication. Yet, in communica- tion scenarios where various user subsets may be involved in dierent sessions the deployment of classical GKE protocols has clear performance and scalability limitations as each new session should be preceded by a separate execution of the protocol. The motivation of this work is to study the possibility of designing more exible GKE protocols allowing not only the computation

•Jan 1, 2010•0 citations

A Flexible ID-Based Group Key Agreement Protocol with Bilinear Pairings

Jun Liang, Hyeong Seon Yoo

A secure and efficient key agreement protocols should provide certain security attributes and low computation overhead. However, most of published protocols cannot provide perfect forward secrecy and avoid key escrow by the Key Generation Center (KGC). In this paper we propose a flexible protocol that can satisfy these security attributes. Moreover the proposed protocol can provide lower computation cost since we can arbitrarily construct subgroups.

CRC Press eBooks•May 7, 2019•0 citations

Dynamic Group Key Exchange Revisited

Guomin Yang, Chik How Tan

Lecture notes in computer science•Jan 1, 2010•4 citations
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, oer exible forms of com- munication and exchange of data. At any time point concurrent communication sessions involv- ing dierent subsets of users can be invoked. The traditional tool for achieving security in a multi-party communication environment are group key exchange (GKE) protocols that provide participants with a secure group key for their subsequent communication. Yet, in communica- tion scenarios where various user subsets may be involved in dierent sessions the deployment of classical GKE protocols has clear performance and scalability limitations as each new session should be preceded by a separate execution of the protocol. The motivation of this work is to study the possibility of designing more exible GKE protocols allowing not only the computation