UNITED STATES
Scalable Rekeying limited to Subgroup using Hybrid Key Trees
|
10.5120/371-558 |
Valli V Kumari, Naga D V Raju and Raju} {Article: Scalable Hybrid K V S V N = trees. . International Journal of Computer Applications 1(17):1–7, February 2010. Published By Foundation of Computer Science. BibTeX
@article{key:article,
author = {V. Valli Kumari and D.V. Naga Raju and K.V.S.V.N Raju} title = {Article: Scalable rekeying limited to subgroup using Hybrid key trees},
journal = {International Journal of Computer Applications},
year = {2010},
volume = {1},
number = {17},
pages = {1--7},
month = {February},
note = {Published By Foundation of Computer Science}
}
Abstract
Maintaining security is a critical issue in any group communication protocols. The objective of security in a group communication is to ensure the access only to the legitimate members of the multicast group. The entry and eviction of the members are the main criteria to change the group key and to give them more assurance of a secret communication, which is known as re-keying. Since it is a frequently performed activity during a communication, the group key updating need to be done in a scalable and efficient manner. Earlier, client-server paradigm is the most predominantly used technique for applications like conferencing, chat groups, interactive video gaming, etc which use the concept of unicast for the transmission of data. Present day advancements in the Internet technologies, especially the increase of bandwidth are definitely encouraging environment for new developments. Unlike the old communication models, where the delivery of the packets are to be carried out in an unicast model, multicasting technique provides an efficient delivery service to larger user-community with effective and efficient network resource utilization.
In the earlier schemes proposed for rekeying mechanism like LKH [4], FDLKH [7], DLPKH [9], the entire group will be disturbed with change in the membership. This paper proposes two new ideas: one with an objective of efficient re-keying and the other with an objective of disturbing only a subset of the group. Both the ideas don't need the secure channel for the distribution of the key material like [4],[7] and also does not reveal the private keys like [9]. The number of keys maintained at each member in this scheme, number of messages sent, size of the messages and number of encryption and decryptions are always constant unlike the other schemes which typically depends on the height of the tree.
Reference
-
[1] H. Harney and C. Muckenhim, Group Key Management Protocol (GKMP) Architecture," RCF 2094, July 1997.
[2] H. Harney and C. Muckenhim, Group Key Management Protocol (GKMP) Specification, RFC 2093, July 1997.
[3] G. H. Chiou and W. T. Chen. Secure Broadcast using Secure Lock. IEEE Transactions on Software Engineering, 15(8):929-934, August 1989.
[4] C. K. Wong, M. Gouda, and S. S. Lam. Secure Group Communications Using Key Graphs. IEEE/ACM Transactions on Networking, 8(1):16-30, February 2000.
[5] D.A. McGrew and A.T. Sherman. Key Establishment in Large Dynamic Groups using One-way Function Trees.
[6] B. DeCleene, L. Dondeti, S. Griffin, T. Hardjono, D. Kiwior,J. Kurose, D. Towsley, S. Vasudevan, and C. Zhang. Secure group communications for wireless networks. MILCOM, June 2001.
[7] FDLKH: fully decentralized key management scheme on a logical key hierarchy. Springer Berlin / Heidelberg, Volume 3089/2004
[8] S. Rafaeli and D. Hutchison. Hydra: a decentralized group key management. 11th IEEE International WETICE: Enterprise Security Workshop, June 2002.
[9] DLPKH: Distributed Logical Public Key Hierarchy Rakesh Bobba, Himamshu Khurana.
[10] O. Rodeh, K. Birman, and D. Dolev. Optimized group rekey for group communication systems. Network and Distributed System Security, February 2000.
