Brief Encounters with a Random Key Graph

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.