Secure Broadcasting Using the Secure Lock
IEEE Transactions on Software Engineering
Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Iolus: a framework for scalable secure multicasting
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Multicast security and its extension to a mobile environment
Wireless Networks
Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A Simple XOR-based Technique for Distributing Group Key in SecureMulticasting
A Simple XOR-based Technique for Distributing Group Key in SecureMulticasting
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Key agreement in ad hoc networks
International Journal of Computational Science and Engineering
Key agreement in ad hoc networks
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
A simple and efficient key exchange scheme against the smart card loss problem
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
| Hi-index | 0.00 |
One approach to multicast group security is to have a group key shared by every group member. In this paper, we are interested in group key distribution and management. A new simple technique is introduced for key distribution to a large group based on the hierarchical key tree. The new technique uses bit XOR operation between keys to reduce the computation effort, and uses random byte patterns (BPs) to distribute the key material in the multicast message. The new technique has symmetric procedures for message construction by a key distribution center (KDC) when a member joins or leaves the group, which allows the generation of one re-key message that incorporates multiple delays of both joins and leaves. In addition to the substantial decrease in the computation effort, our technique reduces the required group member storage. Finally, a novel model for the key tree in a distributed KDC is introduced. The new model allows sending the re-key message by one KDC to the whole group and other peer KDCs without any increase in the delay or the number of sent messages. Building and replicating an additional KDC key tree achieve this.