Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

Active Covert Sensing

Mehrdad Tahmasbi, Matthieu R. Bloch

Published Jun 1, 2020• 13 citations
Publisher

Abstract

We formalize the problem of active covert sensing, in which a legitimate user wants to not only sense an unknown parameter but also remain undetectable from an adversary by actively controlling the actions that generate observations. We characterize the optimal achievable error exponent when the actions of the legitimate user do not depend on the past observations. When the actions are allowed to depend on the past observations, we provide an example showing the benefits of adaptivity.

DOI
10.1109/isit44484.2020.9174220

Related papers

On Covert Quantum Sensing and the Benefits of Entanglement

Mehrdad Tahmasbi, Matthieu R. Bloch

Motivated by applications to covert quantum radar, we analyze a covert quantum sensing problem, in which a legitimate user aims at estimating an unknown parameter taking finitely many values by probing a quantum channel while remaining undetectable from an adversary receiving the probing signals through another quantum channel. When channels are classical-quantum, we characterize the optimal error exponent under a covertness constraint for sensing strategies in which probing signals do not depend on past observations. When the legitimate user's channel is a unitary depending on the unknown parameter, we provide achievability and converse results that show how one can significantly improve covertness using an entangled input state.

arXiv:2008.01264•IEEE Journal on Selected Areas in Information Theory•Feb 3, 2021•14 citations

Covert Secret Key Generation With an Active Warden

Mehrdad Tahmasbi, Matthieu R. Bloch

We investigate the problem of covert and secret key generation over a state-dependent discrete memoryless channel with one-way public discussion in which an adversary, the warden, may arbitrarily choose the channel state. We develop an adaptive protocol that, under conditions that we explicitly specify, not only allows the transmitter and the legitimate receiver to exchange a secret key but also conceals from the active warden whether the protocol is being run. When specialized to passive adversaries that do not control the channel state, we partially characterize the covert secret key capacity. In particular, the covert secret key capacity is sometimes equal to the covert capacity of the channel, so that secrecy comes “for free.”

arXiv:1901.02044•IEEE Transactions on Information Forensics and Security•Aug 2, 2019•27 citations

Learning adversary's actions for secret communication

Mehrdad Tahmasbi, Matthieu R. Bloch, Aylin Yener

We analyze the problem of secure communication over a wiretap channel with an active adversary, in which the legitimate transmitter has the opportunity to sense and learn the adversary's actions. Specifically, the adversary has the ability to switch between two channels and to observe the corresponding output at every channel use; the encoder, however, has causal access to observations impacted by adversary's actions. We develop a joint learning/transmission scheme in which the legitimate users learn and adapt to the adversary's actions. For some channel models, we show that the achievable rates, which we define precisely, are arbitrarily close to those obtained with hindsight, had the transmitter known the actions ahead of time. This suggests that there is much to exploit and gain in physical-layer security by monitoring the environment.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•6 citations

Keyless covert communication over Multiple-Access Channels

Keerthi Suria Kumar Arumugam, Matthieu R. Bloch

We consider a scenario in which two legitimate transmitters attempt to communicate with a legitimate receiver over a discrete memoryless Multiple-Access Channel (MAC), while escaping detection from an adversary who observes their communication through another discrete memoryless MAC. If the MAC to the legitimate receiver is “better” than the one to the adversary, in a sense that we make precise, then the legitimate users can reliably communicate on the order of √n bits per n channel uses with arbitrarily Low Probability of Detection (LPD) without using a secret key. We also identify the pre-constants of the scaling, which leads to a characterization of the covert capacity region.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•84 citations

Learning an Adversary’s Actions for Secret Communication

Mehrdad Tahmasbi, Matthieu R. Bloch, Aylin Yener

Secure communication over a wiretap channel is investigated, in which an active adversary modifies the state of the channel and the legitimate transmitter has the opportunity to sense and learn the adversary's actions. The adversary has the ability to switch the channel state and observe the corresponding output at every channel use while the encoder has causal access to observations that depend on the adversary's actions. A joint learning/transmission scheme is developed in which the legitimate users learn and adapt to the adversary's actions. For some channel models, it is shown that the achievable rates, defined precisely for the problem, are arbitrarily close to those obtained with hindsight, had the transmitter known the actions ahead of time. This initial study suggests that there is much to exploit and gain in physical-layer security by learning the adversary, e.g., monitoring the environment.

arXiv:1807.08670•IEEE Transactions on Information Theory•Sep 13, 2019•11 citations

Cognitive Jammer-Assisted MIMO Covert Communications: Analysis and Optimization

Xing Lv, Manlin Wang, Bin Xia

In multiple-input multiple-output covert communications, the joint beamforming of the legitimate transmitter (Alice) and a friendly jammer can enhance the covertness performance. However, such gains rely on instantaneous cooperation between Alice and the jammer, which could be intercepted by the warder, potentially compromising covertness. To address this issue, we consider a cognitive jammer-assisted covert communication architecture in which the jammer adapts its artificial noise transmission based on sensing Alice’s activity, without requiring real-time coordination. However, due to sensing errors, the cognitive operation produces mixed complex Gaussian observations at the warder, making the analytical characterization of covertness intractable. Consequently, the variational upper bound of the Kullback–Leibler divergence is introduced and derived as a tractable metric of covertness. Moreover, the absence of instantaneous cooperation renders centralized joint beamforming impractical. To meet this challenge, a separate optimization framework is introduced to decouple the beamforming design, and two individual algorithms based on successive convex approximation (SCA) and stochastic SCA are proposed for Alice and the jammer, respectively. Simulation results reveal that there exists an optimal antenna allocation strategy at the cognitive jammer that maximizes the covert rate, and demonstrate that the proposed cognitive jamming strategy achieves superior performance over benchmark schemes employing other jamming mechanisms, particularly in the high-power regime.

IEEE Transactions on Wireless Communications•Jan 1, 2026•0 citations
We formalize the problem of active covert sensing, in which a legitimate user wants to not only sense an unknown parameter but also remain undetectable from an adversary by actively controlling the actions that generate observations. We characterize the optimal achievable error exponent when the actions of the legitimate user do not depend on the past observations. When the actions are allowed to depend on the past observations, we provide an example showing the benefits of adaptivity.
Motivated by applications to covert quantum radar, we analyze a covert quantum sensing problem, in which a legitimate user aims at estimating an unknown parameter taking finitely many values by probing a quantum channel while remaining undetectable from an adversary receiving the probing signals through another quantum channel. When channels are classical-quantum, we characterize the optimal error exponent under a covertness constraint for sensing strategies in which probing signals do not depend on past observations. When the legitimate user's channel is a unitary depending on the unknown parameter, we provide achievability and converse results that show how one can significantly improve covertness using an entangled input state.
We investigate the problem of covert and secret key generation over a state-dependent discrete memoryless channel with one-way public discussion in which an adversary, the warden, may arbitrarily choose the channel state. We develop an adaptive protocol that, under conditions that we explicitly specify, not only allows the transmitter and the legitimate receiver to exchange a secret key but also conceals from the active warden whether the protocol is being run. When specialized to passive adversaries that do not control the channel state, we partially characterize the covert secret key capacity. In particular, the covert secret key capacity is sometimes equal to the covert capacity of the channel, so that secrecy comes “for free.”
We analyze the problem of secure communication over a wiretap channel with an active adversary, in which the legitimate transmitter has the opportunity to sense and learn the adversary's actions. Specifically, the adversary has the ability to switch between two channels and to observe the corresponding output at every channel use; the encoder, however, has causal access to observations impacted by adversary's actions. We develop a joint learning/transmission scheme in which the legitimate users learn and adapt to the adversary's actions. For some channel models, we show that the achievable rates, which we define precisely, are arbitrarily close to those obtained with hindsight, had the transmitter known the actions ahead of time. This suggests that there is much to exploit and gain in physical-layer security by monitoring the environment.
We consider a scenario in which two legitimate transmitters attempt to communicate with a legitimate receiver over a discrete memoryless Multiple-Access Channel (MAC), while escaping detection from an adversary who observes their communication through another discrete memoryless MAC. If the MAC to the legitimate receiver is “better” than the one to the adversary, in a sense that we make precise, then the legitimate users can reliably communicate on the order of √n bits per n channel uses with arbitrarily Low Probability of Detection (LPD) without using a secret key. We also identify the pre-constants of the scaling, which leads to a characterization of the covert capacity region.
Secure communication over a wiretap channel is investigated, in which an active adversary modifies the state of the channel and the legitimate transmitter has the opportunity to sense and learn the adversary's actions. The adversary has the ability to switch the channel state and observe the corresponding output at every channel use while the encoder has causal access to observations that depend on the adversary's actions. A joint learning/transmission scheme is developed in which the legitimate users learn and adapt to the adversary's actions. For some channel models, it is shown that the achievable rates, defined precisely for the problem, are arbitrarily close to those obtained with hindsight, had the transmitter known the actions ahead of time. This initial study suggests that there is much to exploit and gain in physical-layer security by learning the adversary, e.g., monitoring the environment.
In multiple-input multiple-output covert communications, the joint beamforming of the legitimate transmitter (Alice) and a friendly jammer can enhance the covertness performance. However, such gains rely on instantaneous cooperation between Alice and the jammer, which could be intercepted by the warder, potentially compromising covertness. To address this issue, we consider a cognitive jammer-assisted covert communication architecture in which the jammer adapts its artificial noise transmission based on sensing Alice’s activity, without requiring real-time coordination. However, due to sensing errors, the cognitive operation produces mixed complex Gaussian observations at the warder, making the analytical characterization of covertness intractable. Consequently, the variational upper bound of the Kullback–Leibler divergence is introduced and derived as a tractable metric of covertness. Moreover, the absence of instantaneous cooperation renders centralized joint beamforming impractical. To meet this challenge, a separate optimization framework is introduced to decouple the beamforming design, and two individual algorithms based on successive convex approximation (SCA) and stochastic SCA are proposed for Alice and the jammer, respectively. Simulation results reveal that there exists an optimal antenna allocation strategy at the cognitive jammer that maximizes the covert rate, and demonstrate that the proposed cognitive jamming strategy achieves superior performance over benchmark schemes employing other jamming mechanisms, particularly in the high-power regime.