The rise and fall and rise of combinatorial key predistribution

Authors:
Keith M. Martin
Affiliations:
Information Security Group, Royal Holloway, University of London, Surrey, UK
Venue:
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Year:
2010

Citing 10
Cited 0

An optimal class of symmetric key generation systems

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Key storage in secure networks

Discrete Applied Mathematics
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
An Application-Oriented Framework for Wireless Sensor Network Key Establishment

Electronic Notes in Theoretical Computer Science (ENTCS)
On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks

IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Ultra-Lightweight Key Predistribution in Wireless Sensor Networks for Monitoring Linear Infrastructure

WISTP '09 Proceedings of the 3rd IFIP WG 11.2 International Workshop on Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks
Key predistribution for homogeneous wireless sensor networks with group deployment of nodes

ACM Transactions on Sensor Networks (TOSN)
Distinct difference configurations: multihop paths and key predistribution in sensor networks

IEEE Transactions on Information Theory
Deterministic key predistribution schemes for distributed sensor networks

SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are many applications of symmetric cryptography where the only realistic option is to predistribute key material in advance of deployment, rather than provide online key distribution. The problem of how most effectively to predistribute keys is inherently combinatorial. We revisit some early combinatorial key predistribution shemes and discuss their limitations. We then explain why this problem is back "in fashion" after a period of limited attention by the research community. We consider the appropriateness of combinatorial techniques for key distribution and identify potential areas of further research.