Entry DiPietro:2008:RSN from tissec.bib

Last update: Sun Oct 15 02:58:48 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{DiPietro:2008:RSN,
  author =       "Roberto {Di Pietro} and Luigi V. Mancini and
                 Alessandro Mei and Alessandro Panconesi and Jaikumar
                 Radhakrishnan",
  title =        "Redoubtable Sensor Networks",
  journal =      j-TISSEC,
  volume =       "11",
  number =       "3",
  pages =        "13:1--13:??",
  month =        mar,
  year =         "2008",
  CODEN =        "ATISBQ",
  DOI =          "https://doi.org/10.1145/1341731.1341734",
  ISSN =         "1094-9224 (print), 1557-7406 (electronic)",
  ISSN-L =       "1094-9224",
  bibdate =      "Thu Jun 12 17:52:50 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/tissec.bib",
  abstract =     "We give, for the first time, a precise mathematical
                 analysis of the connectivity and security properties of
                 sensor networks that make use of the random
                 predistribution of keys. We also show how to set the
                 parameters---pool and key ring size---in such a way
                 that the network is not only connected with high
                 probability via secure links but also provably
                 resilient, in the following sense: We formally show
                 that any adversary that captures sensors at random with
                 the aim of compromising a constant fraction of the
                 secure links must capture at least a constant fraction
                 of the nodes of the network. In the context of wireless
                 sensor networks where random predistribution of keys is
                 employed, we are the first to provide a mathematically
                 precise proof, with a clear indication of parameter
                 choice, that two crucial properties---connectivity via
                 secure links and resilience against malicious
                 attacks---can be obtained simultaneously. We also show
                 in a mathematically rigorous way that the network
                 enjoys another strong security property. The adversary
                 cannot partition the network into two linear size
                 components, compromising all the links between them,
                 unless it captures linearly many nodes. This implies
                 that the network is also fault tolerant with respect to
                 node failures. Our theoretical results are complemented
                 by extensive simulations that reinforce our main
                 conclusions.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Transactions on Information and System Security",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J789",
  keywords =     "connectivity; probabilistic key sharing; random
                 graphs; Wireless sensor network",
}

Related entries