The Efficient Group Key Management Blocking Collusion Attack


The KIPS Transactions:PartC, Vol. 11, No. 4, pp. 409-418, Aug. 2004
10.3745/KIPSTC.2004.11.4.409,   PDF Download:

Abstract

Multicast services are provided on the Internet in fast increasing. Therefore it is important to keep security for multicast communication. Member leaving is deeply associated with scalability problem for group key management. If one member of the group is removed, new group key has to be generated and distributed to all remaining members of group. Minimizing the number of messages and operation cost for generation of the composite keys are important evaluating criteria of multicast key management scheme since generation and distribution of new keys for rekeying require expensive operation. Batch removal can reduce these important parameters rather than removing members sequentially in fashion one after another. In this paper, Hamming distance is calculated between every members to be removed. The members with Hamming distance less than threshold are selected for rekeying procedure. With running the round assignment algorithm in the case of removing several members simultaneously, our model has advantages of reducing the number of message and operation cost for generation of the composite keys and eliminating possibility of collusion attack for rekeying.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
T. G. Kim and J. I. Chung, "The Efficient Group Key Management Blocking Collusion Attack," The KIPS Transactions:PartC, vol. 11, no. 4, pp. 409-418, 2004. DOI: 10.3745/KIPSTC.2004.11.4.409.

[ACM Style]
Tae Gyun Kim and Jong In Chung. 2004. The Efficient Group Key Management Blocking Collusion Attack. The KIPS Transactions:PartC, 11, 4, (2004), 409-418. DOI: 10.3745/KIPSTC.2004.11.4.409.