Abstract
The notion of the random key graph, which originally appeared in models of secure communication in wireless sensor networks, has been used in other applications, some of which are unrelated to cryptographic-key predistribution or sensor networks. In this presentation, I will outline some of these applications, which exploit the connectivity property of random key graphs and its similarity with that of random graphs. I’d like to start with the zero-one law for randomgraph connectivity, then explain how (i.e., for what graph parameters) this law appears in random key graphs. Then, I will present three brief encounters with random-key-graph properties in new settings and perhaps speculate on other types of useful properties they might have.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gligor, V.D. (2013). Brief Encounters with a Random Key Graph. In: Christianson, B., Malcolm, J.A., Matyáš, V., Roe, M. (eds) Security Protocols XVII. Security Protocols 2009. Lecture Notes in Computer Science, vol 7028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36213-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-36213-2_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36212-5
Online ISBN: 978-3-642-36213-2
eBook Packages: Computer ScienceComputer Science (R0)