loading...
An Efficient Group Key Management Scheme: Link Tree Protocol
Dalian, China December 05-December 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.76Sixth International Conference on Par ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Zhang Jun, Shanghai Jiaotong University, China
Ma Fanyuan, Shanghai Jiaotong University, China
Gu Dawu, Shanghai Jiaotong University, China
Bai Yingcai, Shanghai Jiaotong University, China
Many group key management schemes such as those proposed by Wallner et al, Wong et al are based on a multilevel, logical hierarchy (or tree) of keyencrypting keys. But LKH is based on the hypothesis that the tree is maintained in a balanced manner. This paper proposes a multi-link tree protocol based on LKH. LTP keeps the structure balanced and has a better performance. We analyze multi-LTP and multi- LKH?s performance in detail. We prove that 3-degree LTP is the best structure among all the LTP structures, which is also better than LKH.
Citation:
Zhang Jun, Ma Fanyuan, Gu Dawu, Bai Yingcai, "An Efficient Group Key Management Scheme: Link Tree Protocol," pdcat, pp.381-385, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.