High Performance Group Merging/Splitting Scheme for Group Key Management

  • Authors:
  • Jian Zhou;Liyan Sun;Xianwei Zhou;Junde Song

  • Affiliations:
  • School of Management Science and Engineer, Anhui University of Finance and Economics, Bengbu, China 233041 and School of Computer and Communication Engineering, University of Science and Technolog ...;School of Management Science and Engineer, Anhui University of Finance and Economics, Bengbu, China 233041 and School of Computer Science, Beijing University of Posts and Telecommunications, Beiji ...;School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China 100083 and School of Computer Science, Beijing University of Posts and Telecommunicat ...;School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China 100083 and School of Computer Science, Beijing University of Posts and Telecommunicat ...

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

The group merging/splitting event is different to the joining/leaving events in which only a member joins or leaves group, but in the group merging/splitting event two small groups merge together into a group or a group is divided into two independent parts. Rekeying is an importance issue for key management whose target is to guarantee forward security and backward security in case of membership changes, however rekeying efficiency is related to group scale in most existing group key management schemes, so as to those schemes are not suitable to the applications whose rekeying time delay is limited strictly. In particular, multiple members are involved in the group merging/splitting event, thus the rekeying performance becomes a worried problem. In this paper, a high performance group merging/splitting group key management scheme is proposed based on an one-encryption-key multi-decryption-key key protocol, in the proposed scheme each member has an unique decryption key that is corresponding to a common encryption key so as to only the common encryption key is updated when the group merging/splitting event happens, however the secret decryption key still keeps unchanged. In efficiency aspect, since no more than a message on merging/splitting event is sent, at time the network load is reduced since only a group member's key material is enough for other group members to agree a fresh common encryption key. In security aspect, our proposed scheme achieves the key management security requirements including passive security, forward security, backward security and key independence. Therefore, our proposed scheme is suitable to the dynamitic networks that the rekeying time delay is limited strictly such as tolerate delay networks.