Masking Radar Cognition under Adversarial Surveillance: A Distributional Privacy Framework
Not on the map. Why?
Abstract (arXiv)
In this article, we propose an online electronic counter-countermeasure (ECCM) framework designed to conceal the strategic decision-making processes of a cognitive radar (CR) operating under adversarial surveillance. We model the CR under two distinct decision paradigms: a static constrained utility-maximizing behavior and a dynamic expected utility-maximizing behavior. The radar's utility function is modeled via a von Mises--Fisher (vMF) distribution, with the distributional parameter constituting the private information to be protected from adversarial inference. We adopt a distribution privacy framework to conceal this private information and provide formal distribution privacy guarantees for cognition masking. In this work, we develop cognition-hiding algorithms for both static constrained utility maximization (WDPCH-SU), and dynamic expected utility maximization (WDPCH-DU). Through rigorous mathematical analysis, we show that both WDPCH-SU and WDPCH-DU satisfy ε-distribution privacy (ε-DistP) against inference-based adversarial attacks and present the privacy--performance trade-off bounds, quantifying utility loss (in static setting) and expected utility deviation (in dynamic setting) as functions of ε. Numerical results show that WDPCH-SU gives about 15% improvement in utility loss at maximum privacy compared to the existing methodology while WDPCH-DU achieves a greater reduction in adversarial Fisher information without requiring explicit Fisher information constraints, at a moderate, analytically bounded utility deviation. These results are highly promising in many 6G communication scenarios such as network slicing for automated driving and swarm UAV coordination, where it is essential to keep the resource allocation policy robust against privacy attacks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 52 references that are in the map. First posted on arXiv 7 Sep 2026.
Builds on
12 of 52 references.
References · 12
- 2021On the Variance of the Fisher Information for Deep Learningcited by 22
- 2016Pufferfish Privacy Mechanisms for Correlated Datacited by 16
- 2019Identifying Cognitive Radars -- Inverse Reinforcement Learning using Revealed Preferencescited by 13
- 2018Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraintscited by 11
- 2019How to Calibrate your Adversary's Capabilities? Inverse Filtering for Counter-Autonomous Systemscited by 11
- 2022Protecting Global Properties of Datasets with Distribution Privacy Mechanismscited by 11
- 2018Local Obfuscation Mechanisms for Hiding Probability Distributionscited by 8
- 2020Privacy-Preserving Policy Synthesis in Markov Decision Processescited by 7
- 2019Deception in Supervisory Controlcited by 6
- 2018Least Inferable Policies for Markov Decision Processescited by 3
- 2017On Bayesian Fisher Information Maximization for Distributed Vector Estimationcited by 1
- 2021Adversarial Multi-Player Bandits for Cognitive Radar Networkscited by 1
Built on by
Not cited yet.