Graph-theoretic design and analysis of key predistribution schemes

DOI10.1007/S10623-015-0124-0zbMATH Open1379.94043OpenAlexW1467444581MaRDI QIDQ306046FDOQ306046

Authors: Michelle Kendall, Keith M. Martin 

Publication date: 31 August 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10044/1/26183

Recommendations

• On the role of expander graphs in key predistribution schemes for wireless sensor networks
• Key predistribution schemes for distributed sensor networks via block designs
• A Key Predistribution Scheme Based on 3-Designs
• Linear key predistribution schemes
• The rise and fall and rise of combinatorial key predistribution

zbMATH Keywords

graphshypergraphsexpander graphscombinatorial designskey predistribution schemesnetwork security

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cryptography (94A60) Circuits, networks (94C99) Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Applications of graph theory to circuits and networks (94C15) Applications of design theory to circuits and networks (94C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The CRC handbook of combinatorial designs
• Title not available (Why is that?)
• A unified approach to combinatorial key predistribution schemes for sensor networks
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Expander graphs and their applications
• Title not available (Why is that?)
• Some graphs with small second eigenvalue
• On the second eigenvalue of hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the isoperimetric constant
• Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
• Connectivity of the uniform random intersection graph
• Optimality of some two-associate-class partially balanced incomplete- block designs
• On the second eigenvalue of a graph
• Bounds and constructions for key distribution schemes
• On the role of expander graphs in key predistribution schemes for wireless sensor networks
• Expansion properties of Levi graphs.
• Combinatorics of optimal designs
• Title not available (Why is that?)
• Perfectly secure message transmission
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
• Title not available (Why is that?)
• On the Connectivity of Sensor Networks Under Random Pairwise Key Predistribution
• Common intersection designs
• Selected Areas in Cryptography
• Combinatorial design of key distribution mechanisms for wireless sensor networks
• Random strongly regular graphs?
• Optimal block designs with minimal number of observations
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators

Cited In (9)

• Isoperimetric numbers of randomly perturbed intersection graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A graph theoretic method for securing key fobs
• Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs
• Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models
• On the role of expander graphs in key predistribution schemes for wireless sensor networks
• Title not available (Why is that?)
• The rise and fall and rise of combinatorial key predistribution

This page was built for publication: Graph-theoretic design and analysis of key predistribution schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306046)