New Group Rekeying Algorithm Using Combination of Secret Mask Patterns and Hash Values

Yaser M. ASEM
Atsushi KARA

IEICE TRANSACTIONS on Information and Systems   Vol.E89-D    No.9    pp.2525-2532
Publication Date: 2006/09/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e89-d.9.2525
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Application Information Security
multicast security,  group key management,  matrix-mask group rekeying,  group communications,  hash values,  

Full Text: PDF(415.6KB)>>
Buy this Article

Efficient group rekeying is an important issue for secure group communications. Most of the proposed group rekeying methods require expensive encryption and decryption operations to rekey the group. However, in a model where a trusted server is used to distribute group keys, the trusted server may become a bottleneck because of the expensive computation operations, such as encryption, that it has to perform. In this paper, we propose a new stateless group rekeying scheme to solve the multicast group rekeying problem. In our proposed scheme, the trusted server combines mask-based key-location hiding with the simple XOR-encryption using secret hash values to rekey the group. Without affecting the system security, our approach reduces the processing cost of the trusted server by eliminating the need to encrypt the group key. Moreover, to acquire the group key, the computational cost of the group members is low and stable regardless of the rekeying message size.

open access publishing via