Skip to main content

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

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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chunjie Cao.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Cao, C., Yang, C., Ma, J. et al. Constructing UC Secure and Constant-Round Group Key Exchange Protocols via Secret Sharing. J Wireless Com Network 2008, 271989 (2008). https://doi.org/10.1155/2008/271989

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

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

Keywords

  • Information System
  • Building Block
  • System Application
  • Group Participant
  • Group Communication