DocumentCode
950597
Title
Computation-Efficient Multicast Key Distribution
Author
Xu, Lihao ; Huang, Cheng
Author_Institution
Wayne State Univ., Detroit
Volume
19
Issue
5
fYear
2008
fDate
5/1/2008 12:00:00 AM
Firstpage
577
Lastpage
587
Abstract
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied extensively. In this paper, we propose a new multicast key distribution scheme whose computation complexity is significantly reduced. Instead of using conventional encryption algorithms, the scheme employs MDS codes, a class of error control codes, to distribute multicast key dynamically. This scheme drastically reduces the computation load of each group member compared to existing schemes employing traditional encryption algorithms. Such a scheme is desirable for many wireless applications where portable devices or sensors need to reduce their computation as much as possible due to battery power limitations. Easily combined with any key-tree-based schemes, this scheme provides much lower computation complexity while maintaining low and balanced communication complexity and storage complexity for secure dynamic multicast key distribution.
Keywords
communication complexity; cryptography; decoding; error correction codes; multicast communication; telecommunication security; trees (mathematics); MDS codes; communication-storage complexity; encryption; erasure decoding; error control codes; multicast key distribution; secure group communications; tree-based schemes; wireless applications; Complexity; MDS codes; Multicast; computation; erasure decoding; key distribution;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/TPDS.2007.70759
Filename
4359443
Link To Document