Premium
An authenticated group key distribution protocol based on the generalized Chinese remainder theorem
Author(s) -
Guo Cheng,
Chang ChinChen
Publication year - 2014
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2348
Subject(s) - computer science , group key , chinese remainder theorem , key distribution , computer network , key (lock) , protocol (science) , security association , encryption , computer security , group (periodic table) , key generation , public key cryptography , algorithm , medicine , network access control , cloud computing , chemistry , alternative medicine , organic chemistry , pathology , cloud computing security , operating system
SUMMARY The group key distribution protocol is a mechanism for distributing a group key that is used to encrypt the communication data transmitted in an open group. Recently, a novel group key distribution protocol based on secret sharing was proposed. In their protocol, the group key information is broadcast in an open network environment, and only authorized group members can obtain the group key. However, their protocol requires each group member to broadcast a random challenge to the rest of the group members in the construction of the group key, and this may increase communication cost and cause network traffic congestion. In this paper, we propose an authenticated group key distribution protocol based on the generalized Chinese remainder theorem that drastically reduces communication costs while maintaining at least the same degree of security. Our protocol is built on the secret sharing scheme based on Chinese remainder theorem, which requires fewer computation operations than the previous work. Copyright © 2012 John Wiley & Sons, Ltd.