An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Key storage in secure networks
Discrete Applied Mathematics
Provably authenticated group Diffie-Hellman key exchange
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Handbook of Applied Cryptography
Handbook of Applied Cryptography
On the Key Predistribution System: A Practical Solution to the Key Distribution Problem
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Efficient and Secure Conference-Key Distribution
Proceedings of the International Workshop on Security Protocols
Mobility helps security in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Establishing pairwise keys in distributed sensor networks
ACM Transactions on Information and System Security (TISSEC)
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
Key establishment in heterogeneous self-organized networks
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
A lightweight group-key management protocol for secure ad-hoc-network routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
We propose a fully distributed group key distribution protocol for ad hoc networks. The protocol uses a key pre-distribution step that is performed by each node independently and generates secure links between nodes in a neighbourhood. The key pre-distribution step also allows formation of an initiator group who will generate a session key that will be distributed to all nodes using the secure links between nodes obtained in key pre-distribution stage. We describe efficient protocols for join of new nodes and revocation of compromised nodes. We analyse the system by calculating probability of success of each operation. We evaluate security of the system against outside eavesdroppers and discuss its security against an adversary that corrupts the nodes of the network. Finally we compare our system with two competing systems and show its superior performance in some scenarios.