Premium
An authenticated group key distribution mechanism using theory of numbers
Author(s) -
Liu Yanjun,
Harn Lein,
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.2569
Subject(s) - computer science , chinese remainder theorem , group key , key distribution , protocol (science) , group (periodic table) , key (lock) , computer security , computer network , shared secret , theoretical computer science , cryptography , public key cryptography , algorithm , encryption , medicine , chemistry , alternative medicine , organic chemistry , pathology
SUMMARY A group key distribution protocol can enable members of a group to share a secret group key and use it for secret communications. In 2010, Harn and Lin proposed an authenticated group key distribution protocol using polynomial‐based secret sharing scheme. Recently, Guo and Chang proposed a similar protocol based on the generalized Chinese remainder theorem. In this paper, we point out that there are some security problems of Guo and Chang's protocol and propose a simpler authenticated group key distribution protocol based on the Chinese remainder theorem. The confidentiality of our proposed protocol is unconditionally secure. Copyright © 2013 John Wiley & Sons, Ltd.