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
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
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
Collecting and Modeling the Join/Leave Behavior of Multicast Group Members in the MBone
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Balanced Batch LKH: New Proposal, Implementation and Performance Evaluation.
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Multicast and Group Security
Using AVL Trees for Fault Tolerant Group Key Management
Using AVL Trees for Fault Tolerant Group Key Management
Algorithms for dynamic multicast key distribution trees
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Efficient Secure Multicast with Well-Populated Multicast Key Trees
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
On the performance of group key agreement protocols
ACM Transactions on Information and System Security (TISSEC)
A Novel High-Order Tree for Secure Multicast Key Management
IEEE Transactions on Computers
High-Performance Rekeying Processor Architecture for Group Key Management
IEEE Transactions on Computers
Review: Wireless sensor network key management survey and taxonomy
Journal of Network and Computer Applications
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Abstract: While a vast number of solutions to multicast group rekeying were published in the last years, a common base to evaluate these solutions and compare them with each other is still missing. This paper presents a unified and comprehensive way to evaluate the performance of different rekeying algorithms. A rekeying benchmark estimates rekeying costs from a system point of view, which allows a reliable comparison between different rekeying algorithms. For this purpose, two metrics are defined: the Join Rekeying Time (JRT) and the Disjoin Rekeying Time (DRT). By means of four simulation modes, these metrics are estimated in relation to both the group size and the group dynamics. A benchmark prototype, implemented in Java, demonstrates the merit of this unified assessment method by means of two comprehensive case studies.