An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
On k-connectivity for a geometric random graph
Random Structures & Algorithms
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
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
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
On Random Intersection Graphs: The Subgraph Problem
Combinatorics, Probability and Computing
Connectivity properties of secure wireless sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
The vertex degree distribution of random intersection graphs
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part I
Brief announcement: (more) efficient pruning of ad-hoc wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Simulation modeling of secure wireless sensor networks
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Connectivity results for random key graphs
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Securing wireless sensor networks against large-scale node capture attacks
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
On the existence of triangles in random key graphs
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Location privacy and resilience in wireless sensor networks querying
Computer Communications
Foisting and stealing of keys in sensor networks
EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Expansion properties of (secure) wireless networks
ACM Transactions on Algorithms (TALG)
On the complexity of the herding attack and some related attacks on hash functions
Designs, Codes and Cryptography
Data security in unattended wireless sensor networks with mobile sinks
Wireless Communications & Mobile Computing
| Hi-index | 0.00 |
We give, for the first time, a precise mathematical analysis of the connectivity and security properties of sensor networks that make use of the random predistribution of keys. We also show how to set the parameters---pool and key ring size---in such a way that the network is not only connected with high probability via secure links but also provably resilient, in the following sense: We formally show that any adversary that captures sensors at random with the aim of compromising a constant fraction of the secure links must capture at least a constant fraction of the nodes of the network. In the context of wireless sensor networks where random predistribution of keys is employed, we are the first to provide a mathematically precise proof, with a clear indication of parameter choice, that two crucial properties---connectivity via secure links and resilience against malicious attacks---can be obtained simultaneously. We also show in a mathematically rigorous way that the network enjoys another strong security property. The adversary cannot partition the network into two linear size components, compromising all the links between them, unless it captures linearly many nodes. This implies that the network is also fault tolerant with respect to node failures. Our theoretical results are complemented by extensive simulations that reinforce our main conclusions.