An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Perfectly secure key distribution for dynamic conferences
Information and Computation
On k-connectivity for a geometric random graph
Random Structures & Algorithms
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
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
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Location-aware key management scheme for wireless sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
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)
The Strange Logic of Random Graphs
The Strange Logic of Random Graphs
IEEE Communications Magazine
ACM Transactions on Sensor Networks (TOSN)
Asymmetric key pre-distribution scheme for sensor networks
IEEE Transactions on Wireless Communications
Location-based pairwise key predistribution for wireless sensor networks
IEEE Transactions on Wireless Communications
On the price of security in large-scale wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Cooperative secret delivery in wireless sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys are required to be established between them. Considering the storage limitations and the lack of post-deployment configuration information of sensors, RandomKey Predistribution schemes have been proposed. Due to limited number of keys, sensors can only share keys with a subset of the neighboring sensors. Sensors then use these neighbors to establish pairwise keys with the remaining neighbors. In order to study the communication overhead incurred due to pairwise key establishment, we derive probability models to design and analyze pairwise key establishment schemes for large-scale sensor networks. Our model applies the binomial distribution and a modified binomial distribution and analyzes the key path length in a hop-by-hop fashion. We also validate our models through a systematic validation procedure. We then show the robustness of our results and illustrate how our models can be used for addressing sensor network design problems.