Detection Games under Fully Active Adversaries
Department of Information Engineering and Mathematical Sciences, University of Siena, 53100 Siena, Italy
The Andrew and Erna Viterbi Faculty of Electrical Engineering—Israel Institute of Technology Technion City, Haifa 3200003, Israel
Author to whom correspondence should be addressed.
Received: 23 November 2018 / Revised: 24 December 2018 / Accepted: 25 December 2018 / Published: 29 December 2018
We study a binary hypothesis testing problem in which a defender must decide whether a test sequence has been drawn from a given memoryless source
, while an attacker strives to impede the correct detection. With respect to previous works, the adversarial setup addressed in this paper considers an attacker who is active under both hypotheses, namely, a fully active attacker, as opposed to a partially active attacker who is active under one hypothesis only. In the fully active setup, the attacker distorts sequences drawn both from
and from an alternative memoryless source
, up to a certain distortion level, which is possibly different under the two hypotheses, to maximize the confusion in distinguishing between the two sources, i.e., to induce both false positive and false negative errors at the detector, also referred to as the defender. We model the defender–attacker interaction as a game and study two versions of this game, the Neyman–Pearson game and the Bayesian game. Our main result is in the characterization of an attack strategy that is asymptotically both dominant (i.e., optimal no matter what the defender’s strategy is) and universal, i.e., independent of
. From the analysis of the equilibrium payoff, we also derive the best achievable performance of the defender, by relaxing the requirement on the exponential decay rate of the false positive error probability in the Neyman–Pearson setup and the tradeoff between the error exponents in the Bayesian setup. Such analysis permits characterizing the conditions for the distinguishability of the two sources given the distortion levels.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Tondi, B.; Merhav, N.; Barni, M. Detection Games under Fully Active Adversaries. Entropy 2019, 21, 23.
Tondi B, Merhav N, Barni M. Detection Games under Fully Active Adversaries. Entropy. 2019; 21(1):23.
Tondi, Benedetta; Merhav, Neri; Barni, Mauro. 2019. "Detection Games under Fully Active Adversaries." Entropy 21, no. 1: 23.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.