IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v22y2011i3d10.1007_s10878-009-9285-y.html
   My bibliography  Save this article

Honeynet games: a game theoretic approach to defending network monitors

Author

Listed:
  • Jin-Yi Cai

    (University of Wisconsin)

  • Vinod Yegneswaran

    (SRI International)

  • Chris Alfeld

    (University of Wisconsin
    Nemean Networks)

  • Paul Barford

    (University of Wisconsin
    Nemean Networks)

Abstract

A honeynet is a portion of routed but otherwise unused address space that is instrumented for network traffic monitoring. It is an invaluable tool for understanding unwanted Internet traffic and malicious attacks. We formalize the problem of defending honeynets from systematic mapping (a serious threat to their viability) as a simple two-person game. The objective of the Attacker is to identify a honeynet with a minimum number of probes. The objective of the Defender is to maintain a honeynet for as long as possible before moving it to a new location within a larger address space. Using this game theoretic framework, we describe and prove optimal or near-optimal strategies for both the Attacker and the Defender. This is the first mathematically rigorous study of this increasingly important problem on honeynet defense. Our theoretical ideas provide the first formalism of the honeynet monitoring problem, illustrate the viability of network address shuffling, and inform the design of next generation honeynet defense systems.

Suggested Citation

  • Jin-Yi Cai & Vinod Yegneswaran & Chris Alfeld & Paul Barford, 2011. "Honeynet games: a game theoretic approach to defending network monitors," Journal of Combinatorial Optimization, Springer, vol. 22(3), pages 305-324, October.
    • Handle: RePEc:spr:jcomop:v:22:y:2011:i:3:d:10.1007_s10878-009-9285-y
    DOI: 10.1007/s10878-009-9285-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9285-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-009-9285-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:22:y:2011:i:3:d:10.1007_s10878-009-9285-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.