By Topic

An improved key management scheme for large dynamic groups using one-way function trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wei-Chi Ku ; Dept. of Comput. Sci. & Inf. Eng., Fu Jen Catholic Univ., Hsinchuang, Taiwan ; Shuai-Min Chen

To achieve secure multicast communications, key management is one of the most critical problems that should be solved. So far, many multicast key management schemes have been proposed. In 1999, Balenson, McGrew, and Sherman proposed an efficient multicast key management scheme, the BMS scheme, based on one-way function trees. The number of broadcasts for a key updating operation is roughly proportional to the logarithm of group size. Recently, Horng showed that the BMS scheme is vulnerable to the collusion attack under a certain situation. In this paper, we further analyze the necessary conditions for mounting a collusion attack on the BMS scheme. Additionally, we describe an improved version of the BMS scheme. The improved scheme ensures none of the evictee and the new member can collude to get the group key that they should not know without incurring much additional computational overhead to the system.

Published in:

Parallel Processing Workshops, 2003. Proceedings. 2003 International Conference on

Date of Conference:

6-9 Oct. 2003