Premium
Efficient group key management for secure big data in predictable large‐scale networks
Author(s) -
He Shuangyu,
Wu Qianhong,
Qin Bo,
Liu Jianwei,
Li Yan
Publication year - 2015
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.3574
Subject(s) - computer science , communication in small groups , group key , key (lock) , protocol (science) , key management , computer network , set (abstract data type) , computer security , computation , secure communication , distributed computing , scale (ratio) , communications protocol , group (periodic table) , encryption , medicine , chemistry , physics , alternative medicine , organic chemistry , pathology , algorithm , quantum mechanics , programming language
Summary It is challenging to secure group communications among large‐scale networks due to their network scale. We observe that in many large‐scale networks, the scale of actual group communication is nevertheless predicable and not very large. For instance, although the entire social network (e.g., Facebook) may have billions of users, the members in a concrete group are usually about tens to hundreds. We manage to secure group communication in such scenarios with efficient group management protocols. Technically, we achieve this goal by using a novel dual‐ring approach in which two rings of nodes are established, one active and one dummy. When some nodes leave, the remaining nodes can replace these nodes with dummy nodes, minimizing the required communications and computations after the protocol is set up and thus providing significant advantage over existing group key management protocols. Formal security arguments show that our protocols are secure under standard computational assumptions. Thorough analysis confirms that our protocols are efficient in computation and communication. Copyright © 2015 John Wiley & Sons, Ltd.