Brief Encounters with a Random Key Graph

(Transcript of Discussion)
  • Virgil D. Gligor
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7028)


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.


Wireless Sensor Network Recommender System Random Graph Block Cipher Connectivity Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Virgil D. Gligor
    • 1
  1. 1.Carnegie Mellon UniversityUSA

Personalised recommendations