An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
| Hi-index | 0.00 |
Ad hoc networks are exposed to numerous security threats that can adversely affect the success of important applications. Security services such as authentication and key management are important to secure the communication between two nodes in the networks. In the existing key predistribution schemes, each node is equipped with a weak authentication mechanism to identify neighboring nodes. During the secret key discovery phase, when any two nodes share at least one key information, one node considers the other side to be worthy of confidence and discloses all the shared information to it without a doubt. These schemes are vulnerable to active attack from authorized nodes as well as unauthorized nodes. This paper proposes a novel key management scheme: each node reduces the disclosure of the shared key information and the network provides strong authentication and privacy. Performance and security analyses have proven that our scheme is suitable for ad hoc networks in terms of availability and security aspects.