Entry Xie:2008:MDA 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{Xie:2008:MDA,
  author =       "Liang Xie and Sencun Zhu",
  title =        "Message Dropping Attacks in Overlay Networks: Attack
                 Detection and Attacker Identification",
  journal =      j-TISSEC,
  volume =       "11",
  number =       "3",
  pages =        "15:1--15:??",
  month =        mar,
  year =         "2008",
  CODEN =        "ATISBQ",
  DOI =          "https://doi.org/10.1145/1341731.1341736",
  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 =     "Overlay multicast networks are used by service
                 providers to distribute contents such as Web pages,
                 static and streaming multimedia data, or security
                 updates to a large number of users. However, such
                 networks are extremely vulnerable to message-dropping
                 attacks by malicious or selfish nodes that
                 intentionally drop the packets they are required to
                 forward to others. It is difficult to detect such
                 attacks both efficiently and effectively and to further
                 identify the attackers, especially when members in the
                 overlay switch between online/offline statuses
                 frequently. In this article, we consider various
                 attacking strategies of an attacker and propose an
                 optimal sampling-based scheme to detect such attacks in
                 the overlay network. We analyze the detection problem
                 from a game-theoretical viewpoint and show that our
                 scheme outperforms a random sampling-based scheme in
                 terms of detection rate. In addition, based on a
                 reputation system, we propose a sampling-based
                 path-resolving scheme to identify compromised or
                 selfish nodes. Unlike other existing approaches, our
                 schemes do not assume global knowledge of the overlay
                 hierarchy and work for dynamic overlay networks as
                 well. Extensive analysis and simulation results show
                 that besides being band width efficient, our schemes
                 have high detection and identification rates and low
                 false-positive rates.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Transactions on Information and System Security",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J789",
  keywords =     "attack detection; attacker identification; message
                 dropping attacks; Overlay networks",
}

Related entries