CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
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
Scalable multicast security in dynamic groups
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Secure and efficient key management for dynamic multicast groups
ACM SIGOPS Operating Systems Review
Introduction to Algorithms
Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th 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
A Distributed Key Management Protocol for Dynamic Groups
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
A Secure Group Key Management Framework: Design and Rekey Issues
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
A Dual Encryption Protocol for Scalable Secure Multicasting
ISCC '99 Proceedings of the The Fourth IEEE Symposium on Computers and Communications
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
A scalable key-management scheme with minimizing key storage for secure group communications
International Journal of Network Management
Protocol design for scalable and reliable group rekeying
IEEE/ACM Transactions on Networking (TON)
Secure Group Communication Using Robust Contributory Key Agreement
IEEE Transactions on Parallel and Distributed Systems
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
Scalable and lightweight key distribution for secure group communications
International Journal of Network Management
Dynamic Balanced Key Tree Management for Secure Multicast Communications
IEEE Transactions on Computers
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Secure group communication using binomial trees
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
New multiparty authentication services and key agreement protocols
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Numerous emerging applications, such as teleconferencing, board meetings, pay-per-view and scientific discussions, rely on a secure group communication model. Scalable group rekeying is an important issue in the secure group communication model as the nature of the group is dynamic. The number of encryptions performed and rekey messages constructed should be minimized to carry out updating of the group key, and secure delivery of the group key should be carried out in an efficient manner. In this paper, we propose a new scheme to manage the secure group using the binomial key tree approach. In this scheme, the number of encryptions performed and rekey messages constructed during membership change are fewer compared to the scheme proposed by Wong and others. Further, it is not required to balance the tree after each membership change. We show that, for a large group, the average encryption cost and rekey message cost are independent of the size of the group for join operation and logarithmic in size of the group for leave operation. Hence our scheme is scalable.