Do You Really Need to Disguise Normal Servers
as Honeypots?
Suhyeon Lee∗†, Kwangsoo Cho†, and Seungjoo Kim†
∗Cyber Operations Command, Republic of Korea
†School of Cybersecurity, Korea University
Email: {orion-alpha, cks4386, skim71}@korea.ac.kr
Abstract—A honeypot, which is a kind of deception strategy,
has been widely used for at least 20 years to mitigate cyber
threats. Decision-makers have believed that honeypot strategies
are intuitive and effective, since honeypots have successfully pro-
tected systems from Denial-of-Service (DoS) attacks to Advanced
Persistent Threats (APT) in real-world cases. Nonetheless, there is
a lack of research on the appropriate level of honeypot technique
application to choose real-world operations. We examine and
contrast three attack-defense games with respect to honeypot
detection techniques in this paper. In particular, we specifically
design and contrast two stages of honeypot technology one by
one, starting with a game without deception. We demonstrate
that the return for a defender using honeypots is higher than
for a defender without them, albeit the defender may not always
benefit financially from using more honeypot deception strategies.
Particularly, disguising regular servers as honeypots does not
provide defenders with a better reward. Furthermore, we take in
consideration that fake honeypots can make maintaining normal
nodes more costly. Our research offers a theoretical foundation
for the real-world operator’s decision of honeypot deception
tactics and the required number of honeypot nodes.
Index Terms—cybersecurity, game theory, honeypot, signaling
game
I. INTRODUCTION
Cyber attacks are getting more threatening as a consequence
of the proliferation of digital technologies such as cloud
computing and the Internet of Things (IoT). Defenders create
strategies to counterattack. Accordingly, attackers are persis-
tent in developing new methods. A honeypot is one technology
that enables cybersecurity agents to trap attackers and collect
threat intelligence. This intelligence ultimately enables them
to learn and strengthen safeguards against future threats.
However, only establishing a large number of honeypots is
not a viable option, and installing and operating honeypots
requires a strategic approach.
Cybersecurity can utilize game theory to analyze the most
effective techniques [1], [2]. Game theory has applications in
all social science disciplines, as well as logic, systems sci-
ence, and computer science. Originally, it addressed zero-sum
games, in which each player’s earnings or losses are exactly
balanced by those of the other players. In game-theoretic
examination of honeypot technology, it can be described as
a signaling game in which the defender indicates whether a
specific node is honeypot or normal. These models were the
subject of a significant investigation in [3]. Perfect Bayesian
Equilibrium (PBE) was investigated using a signaling game
with symmetric payoffs. They derived 10 equilibria that every
node sends the same honeypot or normal signal.
La et al. [4] analyzed honeypot defense strategies in Internet
of Things (IoT). In their model, an attacker sends a signal
and the defender chooses the defense strategy according to
the signal. Li et al. [5] analyzed signaling games with anti-
honeypot techniques in industrial systems. Diamantoulakis et
al. [6] studied the optimal honeypot ratio by analyzing the
strategy of switching nodes to honeypot in an environment
where no new nodes are added. Nevertheless, systems must
retain their normal nodes to maintain service quality. In this
perspective, we focus on the number of honeypot nodes rather
than the number of defensive nodes. Shortridge [7] claimed
that making defenders’ environment resemble an analyst’s
sandbox can be a good strategy from a practical perspective.
We found her reasoning to be really compelling. This study
concentrated on how the payoffs of defenders vary as honeypot
nodes and fake honeypot nodes are gradually added.
Our contributions are as follows:
•We show that profits do not always increase even if the
number of defense techniques increase in the honeypot
game. This research applies zero to three honeypot decep-
tion actions to attacker-defender games. In the presence of
additional cost in the normal node deception, we conclude
that deception techniques for normal nodes are practically
ineffective in choosing the best strategy.
•We demonstrate that an increase in the number of hon-
eypot nodes does not always increase the payoff of the
defender. The defender’s payoff continues to increase to
a certain point, but continues to decrease beyond the
maximum point. Furthermore, we confirm that payoff can
be dramatically reduced assuming that the honeypot cost
is dynamic.
The paper is organized as follows. In Section II, we give an
overview of the background of the honeypot deception and
the signaling game. In Section III, we describe a scenario
and models of honeypot deception games. In Section IV, we
analyze the equilibria of the signaling games of honeypot de-
ception. In Section V, we find optimal honeypot distributions
based on the analysis. Finally, we examine the dynamic payoff
in the honeypot deception game. In Section VI, we show cases
of signaling games with a fixed cost and a dynamic cost of
honeypot nodes. In Section VIII, conclusions are presented.
arXiv:2210.17399v1 [cs.CR] 31 Oct 2022