TY - JOUR
T1 - Resilient LKH
T2 - Secure multicast key distribution schemes
AU - Safavi-Naini, Reihaneh
AU - Wang, Huaxiong
AU - Wong, Duncan S.
PY - 2006/10
Y1 - 2006/10
N2 - Multicasting has become the main mode communication for providing a wide range of Internet services such as video broadcasting and multi-party teleconferencing, where data must be delivered to multiple recipients. The main focus of the work on securing multicast applications has been to control access and to ensure that only authorised users can access the broadcast. The authorised group is not fixed and may change over time and hence efficient methods of re-keying are of very important. Logical Key Hierarchy (LKH) schemes are schemes that use a logical tree to assign keys to users: each user will be attached to a leaf of the tree and will own all the keys allocated to the nodes from that leaf to the root of the tree. In this paper we propose a new LKH scheme in which only a subset of leaves are attached to users. This allows separation of the key sets of the users and providing protection against collusion attack. This property combined with the logarithmic size of the group controller storage makes the approach very attractive. We give a number of constructions, the best of which also has logarithmic cost for users' key storage and communication.
AB - Multicasting has become the main mode communication for providing a wide range of Internet services such as video broadcasting and multi-party teleconferencing, where data must be delivered to multiple recipients. The main focus of the work on securing multicast applications has been to control access and to ensure that only authorised users can access the broadcast. The authorised group is not fixed and may change over time and hence efficient methods of re-keying are of very important. Logical Key Hierarchy (LKH) schemes are schemes that use a logical tree to assign keys to users: each user will be attached to a leaf of the tree and will own all the keys allocated to the nodes from that leaf to the root of the tree. In this paper we propose a new LKH scheme in which only a subset of leaves are attached to users. This allows separation of the key sets of the users and providing protection against collusion attack. This property combined with the logarithmic size of the group controller storage makes the approach very attractive. We give a number of constructions, the best of which also has logarithmic cost for users' key storage and communication.
UR - http://www.scopus.com/inward/record.url?scp=33748759789&partnerID=8YFLogxK
U2 - 10.1142/S0129054106004340
DO - 10.1142/S0129054106004340
M3 - Article
AN - SCOPUS:33748759789
SN - 0129-0541
VL - 17
SP - 1205
EP - 1221
JO - International Journal of Foundations of Computer Science
JF - International Journal of Foundations of Computer Science
IS - 5
ER -