L-R Logical Key Tree Management Scheme Applying Hierarchical Data Processing

Article Preview

Abstract:

This paper proves multicast management belongs to problems of HDP, provides the cost analytical model of multicast logical key tree which applies HDPT. Based on the above analysis, the author proposes an improved multicast logical key management scheme termed as L-R logical key tree management scheme. L-R logical key tree management scheme is a kind of imbalanced multicast logical key tree, which is based on periodic re-key, according member nodes’ joining and leaving different probability, it employs different multicast key management strategy. The paper provides the design and calculation of the scheme, and realizes it in a simulation. By comparing this scheme with the typical LKH one, it shows clearly the scheme proposed in the paper is of high effect and low cost.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 532-533)

Pages:

753-757

Citation:

Online since:

June 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Roberto Tamassia, Nikos Triandopoulos. Computational bounds on hierarchical data processing with applications to information security[A]. Proceedings of the 32nd International Colloquium on Automata, Languages and Programming[C], Lisbon, Portugal, July 2005, 153-165.

DOI: 10.1007/11523468_13

Google Scholar

[2] Jian Xu, Fucai Zhou, Xinyang Li, Muzhou Yang. Hierarchical Data Processing Model and Complete Tree Key Management Mechanism[C], In: Proc of the 9th International Conference for Young Computer Scientists 2008, IEEE Computer Society, 1606-1612.

DOI: 10.1109/icycs.2008.252

Google Scholar

[3] Wu Changbai, Design and Analysis of a Nobel Multicast Key Management Scheme for Group Communications[D] .National Sun Yat-sen University. 2005. 7.

Google Scholar

[4] Liming Wang, Chuan-Kun Wu. Authenticated Group Key Agreement for Multicast [J], Springer Verlag, Lecture Notes in Computer Science.2006,4301: 55-72.

Google Scholar

[5] Chung Kei, Gouda M, Lam S.Secure Group Communications Using Key Graphs [J].IEEE/ACM Transaction on Networking, 2000, 8(1) : 16-30.

DOI: 10.1109/90.836475

Google Scholar

[6] Roberto Tamassia. Authenticated Data Structures[J], Springer Verlag, Lecture Notes in Computer Science,2003, 2832: 2-5.

Google Scholar

[7] Roberto Tamassia. Authenticated Data Structures[J], Springer Verlag, Lecture Notes in Computer Science,2003, 2832: 2-5.

Google Scholar

[8] Matt Bishop. Computer Security: Art and Science [M], Tsinghua University Press, Beijing. 2004, 3-25.

Google Scholar