Detection Games Under Fully Active Adversaries
Benedetta Tondi, Neri Merhav, Mauro Barni

TL;DR
This paper investigates a binary hypothesis testing game with a fully active adversary who distorts sequences under both hypotheses to maximize detection errors, providing a game-theoretic analysis and characterizing optimal attack strategies and source distinguishability.
Contribution
It introduces a novel fully active adversarial model in hypothesis testing and characterizes asymptotically dominant attack strategies and source distinguishability conditions.
Findings
Identified a universal asymptotically dominant attack strategy.
Characterized the equilibrium performance and error tradeoffs.
Derived conditions for source distinguishability under distortion constraints.
Abstract
We study a binary hypothesis testing problem in which a defender must decide whether or not a test sequence has been drawn from a given memoryless source whereas, 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, in order 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…
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.
