Title :
A Novel Key Assignment Algorithms for Secure Multicast
Author :
Gao ZhiMin ; Qi, Yao
Author_Institution :
Beijing Jiaotong Univ., Beijing
Abstract :
Group key management has been one of important problems all the time for secure multicast. Key assignment algorithm plays a very important role in the large and dynamic groups for group key management. This paper investigates detailed and deeply key assignment algorithms and analyses breadth first assignment (BFA) and depth first assignment(DFA). Combining the advantage and disadvantage of these two kinds of algorithms, we present a new mixed key assignment algorithm (MKA). Our results show that this approach is much better than previous key assignment algorithms for reducing the average number of packets that a user needs to receive and the variance of it. For stage of rekey retransmission, we use a method that assigns the keys of different members into one packet. The approach can be very effective in reducing the bandwidth requirements of the reliable key delivery.
Keywords :
cryptography; multicast communication; telecommunication security; breadth first assignment; depth first assignment; group key management; mixed key assignment algorithm; secure multicast; Algorithm design and analysis; Bandwidth; Data privacy; Joining IEEE; Multicast algorithms; Multicast communication; Partitioning algorithms; Protocols; Technology management; Teleconferencing;
Conference_Titel :
Data, Privacy, and E-Commerce, 2007. ISDPE 2007. The First International Symposium on
Conference_Location :
Chengdu
Print_ISBN :
978-0-7695-3016-1
DOI :
10.1109/ISDPE.2007.96