Combinatorica
An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
Journal of Combinatorial Theory Series A - Series A
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
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Location-based pairwise key establishments for static sensor networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Expansion properties of (secure) wireless networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Revisiting random key pre-distribution schemes for wireless sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Connectivity properties of secure 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)
Deterministic key predistribution schemes for distributed sensor networks
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design
ISC'05 Proceedings of the 8th international conference on Information Security
On the role of expander graphs in key predistribution schemes for wireless sensor networks
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
| Hi-index | 0.00 |
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n we derive the optimal value that is jointly achievable for parameters like, Size optimality: using less memory per node – while supporting large network, Connectivity optimality: possibility of establishing secure communication between any two nodes over short path, and Resiliency optimality: large fraction of network remains working under compromise or node capture. We characterize this relation in graph theoretic framework. Our result shows that the desired graph (a combination of network topology graph on which key-share graph is embedded) must have small clique and independent set and must have high expansion properties, in other words Expander graphs are best suited for forming secure networks.