Key Tree and Chinese Remainder Theorem Based Group Key Distribution Scheme
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Key distribution protocol for secure multicast with reduced communication delay
AMT'11 Proceedings of the 7th international conference on Active media technology
Key distribution for Pay-TV system with reduced computation cost using XOR operation
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Protocol for ownership transfer across authorities: with the ability to assign transfer target
Security and Communication Networks
N-ary tree based key distribution in a network as a service provisioning model
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Secure multiple group ownership transfer protocol for mobile RFID
Electronic Commerce Research and Applications
| Hi-index | 0.00 |
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 {\\em 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 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.