Graph-theoretic design and analysis of key predistribution schemes

DOI10.1007/s10623-015-0124-0zbMath1379.94043OpenAlexW1467444581MaRDI QIDQ306046

Michelle Kendall

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

zbMATH Keywords

graphshypergraphsnetwork securityexpander graphscombinatorial designskey predistribution schemes

Mathematics Subject Classification ID

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

Related Items (1)

Isoperimetric numbers of randomly perturbed intersection graphs

Cites Work

• Optimal block designs with minimal number of observations
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Connectivity of the uniform random intersection graph
• Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
• Optimality of some two-associate-class partially balanced incomplete- block designs
• On the second eigenvalue of a graph
• Some graphs with small second eigenvalue
• On the second eigenvalue of hypergraphs
• Bounds and constructions for key distribution schemes
• A unified approach to combinatorial key predistribution schemes for sensor networks
• On the Role of Expander Graphs in Key Predistribution Schemes for Wireless Sensor Networks
• Expander graphs and their applications
• A note on the isoperimetric constant
• Perfectly secure message transmission
• Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
• 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?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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