On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks

DOI10.1007/978-3-642-01877-0_12zbMath1248.94135arXiv0902.0458OpenAlexW2143128950MaRDI QIDQ5323004

No author found.

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.0458

zbMATH Keywords

sensor networkscombinatorial designskey predistribution

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Applications of design theory to circuits and networks (94C30)

Related Items (3)

Key predistribution schemes for distributed sensor networks via block designs ⋮ A unified approach to combinatorial key predistribution schemes for sensor networks ⋮ The Rise and Fall and Rise of Combinatorial Key Predistribution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Key storage in secure networks
• On some methods for unconditionally secure key distribution and broadcast encryption
• Generalized cover-free families.
• An Application-Oriented Framework for Wireless Sensor Network Key Establishment
• Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks
• Common intersection designs
• Selected Areas in Cryptography
• Selected Areas in Cryptography
• Information Security
• Efficient Key Predistribution for Grid-Based Wireless Sensor Networks
• Applied Cryptography and Network Security

This page was built for publication: On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks