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

A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort

Jun Furukawa, Frederik Armknecht, Kaoru Kurosawa

Published Jan 1, 2008• 13 citations
Publisher
DOI
10.1007/978-3-540-85855-3_26

Related papers

On the Minimum Communication Effort for Secure Group Key Exchange

Frederik Armknecht, Jun Furukawa

Lecture notes in computer science•Jan 1, 2011•6 citations

Universally composable session key exchange protocol for mobile computers

Pranav Vyas

•Jan 1, 2017•0 citations

An Unbalanced Protocol for Group Key Exchange

Javier Herranz, Jorge Luis Villar

Lecture notes in computer science•Jan 1, 2004•7 citations

Constructing UC Secure and Constant-Round Group Key Exchange Protocols via Secret Sharing

Chunjie Cao, Chao Jun Yang, Jianfeng Ma +1 more

Group key exchange (GKE) is one of the basic building blocks in securing group communication. A number of solutions to GKE problem have been proposed, but most of them are not scalable and require a number of rounds linear with the number of group members. We present a method of constructing constant-round and identity-based protocol via secret sharing for GKE within universally composability (UC) framework. The resultant protocol focuses on round efficiency and three rounds of communication are required. The protocol allows the batch verification of messages signed by all other group participants. Moreover, compared with other identity-based protocols, the key generation center (KGC) in our protocol is not always online.

EURASIP Journal on Wireless Communications and Networking•May 12, 2008•6 citations

A Compiler for Group Key Exchange Protocol to Resist Insider Attack in Universally Composable Framework

Liehuang Zhu, Hong Li

The problem of group key exchange protocol to resist insider attack has been widely analyzed and studied. But in universally composable framework, there are not compilers which can directly compile a group key exchange protocol to the protocol which can resist insider attack yet. So this paper designs and analyzes this kind of compilers in universally composable framework, and proves that the protocols from the our compilers are secure to resist insider attack.

International Symposium on Information Science and Engineering•Dec 1, 2010•0 citations

Efficient group key exchange protocol with strong security

Shao-feng DENG, Fan DENG, LI Yi-fa

Journal of Computer Applications•Jul 29, 2010•0 citations
Group key exchange (GKE) is one of the basic building blocks in securing group communication. A number of solutions to GKE problem have been proposed, but most of them are not scalable and require a number of rounds linear with the number of group members. We present a method of constructing constant-round and identity-based protocol via secret sharing for GKE within universally composability (UC) framework. The resultant protocol focuses on round efficiency and three rounds of communication are required. The protocol allows the batch verification of messages signed by all other group participants. Moreover, compared with other identity-based protocols, the key generation center (KGC) in our protocol is not always online.