An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
SPINS: security protocols for sensor networks
Wireless Networks
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
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
Proceedings of the 10th ACM conference on Computer and communications security
LEAP: efficient security mechanisms for large-scale 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
TinyPK: securing sensor networks with public key technology
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Avrora: scalable sensor network simulation with precise timing
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Combinatorial design of key distribution mechanisms for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
ACM Transactions on Sensor Networks (TOSN)
Review: Wireless sensor network key management survey and taxonomy
Journal of Network and Computer Applications
Enhancing resilience of probabilistic key pre-distribution schemes for WSNs through hash chaining
Proceedings of the 17th ACM conference on Computer and communications security
Key management for mobile sensor networks
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Hi-index | 0.24 |
In the last decade, we witness a proliferation of potential application domains of wireless sensor networks (WSN). Therefore, a host of research works have been conducted by both academic and industrial communities. Nevertheless, given the sensitivity of the potential applications that are generally tightly related to the physical world and may be human beings, a large scale deployment of WSN depends on the dependability provided by these emerging networks. Particularly, security emerges as a challenging issue in WSN because of the resource limitations. Key management is one of the required building blocks of many security services, such as confidentiality, authentication, etc. Unfortunately, public key based solutions, which provide efficient key management services in conventional networks, are unsuitable for WSN because of resource limitations. Symmetric key establishment is then one of the most suitable paradigms for securing wireless sensor networks. In this paper, we tackle the resiliency of symmetric key pre-distribution schemes against node capture. We propose a hash-based mechanism which enhances the resiliency of key pre-distribution for WSN. Applied to any pool based key pre-distribution scheme, our solution gives birth to an enhanced scheme which is more resilient against node capture attacks. We analyze and compare our solution against the existing schemes, with respect to some important criteria such as: the network resiliency against node capture, secure connectivity coverage, storage requirement, communication overhead and computation complexity. We show through analytical analysis that our solution enhances the network resiliency without introducing any new storage or communication overheads. Moreover, we show that our solution introduces insignificant computational overhead.