Entry Zhang:2008:FIC 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{Zhang:2008:FIC,
  author =       "Qing Zhang and Ting Yu and Peng Ning",
  title =        "A Framework for Identifying Compromised Nodes in
                 Wireless Sensor Networks",
  journal =      j-TISSEC,
  volume =       "11",
  number =       "3",
  pages =        "12:1--12:??",
  month =        mar,
  year =         "2008",
  CODEN =        "ATISBQ",
  DOI =          "https://doi.org/10.1145/1341731.1341733",
  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 =     "Sensor networks are often subject to physical attacks.
                 Once a node's cryptographic key is compromised, an
                 attacker may completely impersonate it and introduce
                 arbitrary false information into the network. Basic
                 cryptographic mechanisms are often not effective in
                 this situation. Most techniques to address this problem
                 focus on detecting and tolerating false information
                 introduced by compromised nodes. They cannot pinpoint
                 exactly where the false information is introduced and
                 who is responsible for it. \par

                 In this article, we propose an application-independent
                 framework for accurately identifying compromised sensor
                 nodes. The framework provides an appropriate
                 abstraction of application-specific detection
                 mechanisms and models the unique properties of sensor
                 networks. Based on the framework, we develop alert
                 reasoning algorithms to identify compromised nodes. The
                 algorithm assumes that compromised nodes may collude at
                 will. We show that our algorithm is optimal in the
                 sense that it identifies the largest number of
                 compromised nodes without introducing false positives.
                 We evaluate the effectiveness of the designed algorithm
                 through comprehensive experiments.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Transactions on Information and System Security",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J789",
  keywords =     "intrusion detection; sensor networks",
}

Related entries