By Topic

A time-efficient contributory key agreement scheme for secure group communications

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
$33 $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

4 Author(s)
Bin Sun ; Beijing Univ. of Posts & Telecommun., China ; W. Trappe ; Yan Sun ; K. J. R. Liu

Group-oriented services are attractive to both customers and service providers since they allow for potential markets that exploit user collaboration and shared experiences. In order to protect the content of a group service, the content must be encrypted using a key shared by group members. With the advancement of network technologies, customers will access group services from different networks using different terminals. The computational capabilities of the group members will vary. Contributory key agreement schemes have been developed to support secure communication between many senders and many receivers, but do not consider that users might require different amounts of time to perform a round of key establishment. In this paper, we develop a contributory key agreement scheme to setup the customer group which achieves a smaller latency for group key generation than existing schemes. We then address the latency needed to rekey the group during member joins and departures. A protocol that determines the location to place a joining member is presented that considers the time needed for rekeying the joining member as well as the effect the joining member has upon the departure times of the other group members. Simulations are presented that compare our algorithms with existing schemes for different group sizes, as well as different user join rates.

Published in:

Communications, 2002. ICC 2002. IEEE International Conference on  (Volume:2 )

Date of Conference: