Deception by Design: Evidence-Based Signaling Games for Network Defense
Jeffrey Pawlick, Quanyan Zhu

TL;DR
This paper introduces a game-theoretic model for deception in network defense, analyzing how detection affects strategies and outcomes, with implications for designing more effective honeypot defenses.
Contribution
It develops a new model of deceptive interactions incorporating evidence detection, extending traditional signaling games, and reveals counterintuitive effects of detection on defender utility.
Findings
Detection can eliminate pure-strategy equilibria.
Deception detection can sometimes increase defender utility.
The model generalizes traditional signaling and complete information games.
Abstract
Deception plays a critical role in the financial industry, online markets, national defense, and countless other areas. Understanding and harnessing deception - especially in cyberspace - is both crucial and difficult. Recent work in this area has used game theory to study the roles of incentives and rational behavior. Building upon this work, we employ a game-theoretic model for the purpose of mechanism design. Specifically, we study a defensive use of deception: implementation of honeypots for network defense. How does the design problem change when an adversary develops the ability to detect honeypots? We analyze two models: cheap-talk games and an augmented version of those games that we call cheap-talk games with evidence, in which the receiver can detect deception with some probability. Our first contribution is this new model for deceptive interactions. We show that the model…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Experimental Behavioral Economics Studies · Crime, Illicit Activities, and Governance
