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
KHIP—a scalable protocol for secure multicast routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Batch rekeying for secure group communications
Proceedings of the 10th international conference on World Wide Web
Reliable group rekeying: a performance analysis
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Multicasting on the Internet and Its Applications
Multicasting on the Internet and Its Applications
Data Structures, Algorithms and Applications in Java
Data Structures, Algorithms and Applications in Java
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Efficient Security for Large and Dynamic Multicast Groups
WETICE '98 Proceedings of the 7th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
Algorithms for dynamic multicast key distribution trees
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A survey of security issues in multicast communications
IEEE Network: The Magazine of Global Internetworking
Proceedings of the 2nd international conference on Scalable information systems
Scalable group key management protocol based on key material transmitting tree
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
A benchmarking environment for performance evaluation of tree-based rekeying algorithms
Journal of Systems and Software
Non-split balancing higher order tree for multi-privileged groups
WSEAS TRANSACTIONS on COMMUNICATIONS
Cryptanalysis of two group key management protocols for secure multicast
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Authenticated group key agreement for multicast
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Hardware security platform for multicast communications
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 14.98 |
Multicast is used to deliver packets to a group of users. To prevent users outside the group from eavesdropping, a group key is maintained to encrypt the group communication, and the group key is changed (rekeying) when a new member joins the group or an existing member leaves the group. Rekeying costs could be as high as n for a group with n members. The hierarchical key-tree approach is widely used to achieve logarithmic rekeying costs. However, the key tree has to be kept balanced in order to keep logarithmic rekeying costs. Goshi and Ladner [8] propose the height-balanced 2-3 tree (a B-tree of order m = 3) and found that it has the best performance among the balancing strategies tested. However, balancing a B-tree [8] after member joining involves splitting oversized tree nodes and results in (m + 2)h worst-case rekeying cost, where h is the tree height. We propose an NSBHO (Non-Split Balancing High-Order) tree in which balancing tree after member joining does not involve node splitting, thus having 2h worst-case rekeying cost. An NSBHO tree is always balanced and its nodes may not satisfy the node properties of a standard B-tree. Our proposed NSBHO tree has the same worst-case rekeying cost incurred by a member removing as a B-tree [8] does. Our experiments show that the NSBHO tree has better average-case rekeying performance and far superior worst-case rekeying performance than a B--tree.