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)
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Communications of the ACM
Hydra: A Decentralised Group Key Management
WETICE '02 Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises
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
Threshold and Identity-based Key Management and Authentication for Wireless Ad Hoc Networks
ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
Group Key Agreement Efficient in Communication
IEEE Transactions on Computers
New directions in cryptography
IEEE Transactions on Information Theory
Scalable secure one-to-many group communication using dual encryption
Computer Communications
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
ECGK: An efficient clustering scheme for group key management in MANETs
Computer Communications
| Hi-index | 0.01 |
Most existing solutions to group security in Mobile Ad Hoc Networks (MANETs) rely on a multicast Core Based Tree (CBT) for key distribution. Such solutions, although suitable for systems with low mobility and static characteristics, are unsuitable for dynamic and sparse groups with changing neighborhoods. In this paper, we propose an entirely decentralized key generation mechanism, employing a central trusted entity only during initialization. Using our approach, keys can be established between group members with absolutely no prior communication. The solution relies on threshold cryptography and introduces a novel concept of Node-Group-Key (NGK) mapping. We have provided an extensive analytical model for the computations involved and communication costs and have also provided a lie detection mechanism. Simulation results show appreciable performance improvement and enhanced robustness.