A Game-Theoretic Analysis for Distributed Honeypots
AbstractA honeypot is a decoy tool for luring an attacker and interacting with it, further consuming its resources. Due to its fake property, a honeypot can be recognized by the adversary and loses its value. Honeypots equipped with dynamic characteristics are capable of deceiving intruders. However, most of their dynamic properties are reflected in the system configuration, rather than the location. Dynamic honeypots are faced with the risk of being identified and avoided. In this paper, we focus on the dynamic locations of honeypots and propose a distributed honeypot scheme. By periodically changing the services, the attacker cannot distinguish the real services from honeypots, and the illegal attack flow can be recognized. We adopt game theory to illustrate the effectiveness of our system. Gambit simulations are conducted to validate our proposed scheme. The game-theoretic reasoning shows that our system comprises an innovative system defense. Further simulation results prove that the proposed scheme improves the server’s payoff and that the attacker tends to abandon launching attacks. Therefore, the proposed distributed honeypot scheme is effective for network security. View Full-Text
Share & Cite This Article
Li, Y.; Shi, L.; Feng, H. A Game-Theoretic Analysis for Distributed Honeypots. Future Internet 2019, 11, 65.
Li Y, Shi L, Feng H. A Game-Theoretic Analysis for Distributed Honeypots. Future Internet. 2019; 11(3):65.Chicago/Turabian Style
Li, Yang; Shi, Leyi; Feng, Haijie. 2019. "A Game-Theoretic Analysis for Distributed Honeypots." Future Internet 11, no. 3: 65.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.