Open Access

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

EURASIP Journal on Wireless Communications and Networking20082008:271989

https://doi.org/10.1155/2008/271989

Received: 10 June 2007

Accepted: 30 April 2008

Published: 12 May 2008

Abstract

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.

Publisher note

To access the full article, please see PDF

Authors’ Affiliations

(1)
Key Laboratory of Computer Networks and Information Security, Xidian University
(2)
No.36 Research Institute of China Electronic Technology Corporation (CETC)
(3)
Mobile Network Security Technology Research Center, Kyungpook National University

Copyright

© Chunjie Cao et al. 2008

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.