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
MARKS: Zero Side Effect Multicast Key Management Using Arbitrarily Revealed Key Sequences
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
Scalable and lightweight key distribution for secure group communications
International Journal of Network Management
SAKM: a scalable and adaptive key management approach for multicast communications
ACM SIGCOMM Computer Communication Review
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
Security issues and solutions in multicast content distribution: a survey
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Group communication is the basis for many recent multimedia and web applications. The group key management is one of the most critical problems in a large dynamic group. All group rekeying protocols add communication as well as computational overhead at the Group Key Controller (GKC) and group members. The trade off between these overheads depends on different levels of security required for different types of multicast applications [10,12,16]. This proposed work introduces a new key management algorithm based on Chinese reminder theorem (CRT). This algorithm uses CRT tuple of smaller remainders instead of keys of larger bits. So, any computation on these keys is carried out in parallel using remainders. Thus this approach reduces overall computational overhead. This algorithm reduces communication over head during the join event highly without compromising security.