An Effective Contributory Re-Keying Approach to Compute Conference Key
D. Thilagavathy and M. Rajaram
DOI : 10.3844/jcssp.2011.1212.1217
Journal of Computer Science
Volume 7, Issue 8
Problem statement: With the explosive growth of and internet and web applications many emerging group-oriented distributed applications such as tele/video-conferencing, multiplayer games are based on group communication model that need security services such as privacy and data integrity Hence a secure distributed group key agreement is required to establish and authenticate a common group key for secure and private communication. There is a need for security services to provide group-oriented communication privacy and data integrity. It is important that members of the group can establish a common secret key for encrypting group communication. A key tree approach has been proposed by many authors to distribute group key in such a way that the rekeying cost scales with the logarithm of the group size for a join or leave request. The efficiency of this key tree approach critically depends on whether the key tree remains balanced over time as members join or leaves Approach: Instead of performing individual re-keying operations, an interval-based approach of re keying is adopted in the proposed scheme. Results: In the proposed scheme Queue-merge algorithm is used for rekeying which substantially reduces the computation cost and communication cost. The comparison shows that queue merge algorithm performs better than Batch algorithm in terms of minimizing the key tree and presumes better node density thereby reducing the computation cost. Conclusion: Performance comparison also shows reduced number of renewed nodes for various rekeying interval which reduces the communication cost.
© 2011 D. Thilagavathy and M. Rajaram. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.