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

arXiv:2604.13122

Conflict-Aware Robust Design for Covert Wireless Communications

Abbas Arghavani

Published Apr 13, 2026• 0 citations
arXivHTMLPDF

Abstract

Covert wireless communication aims to establish a reliable link while hiding the transmission from an adversary. In wireless settings, uncertainty plays a central role in this tradeoff: it can help mask the signal from a warden, but it also complicates robust system design. This raises a basic question: under bounded uncertainty, are reliability and covertness governed by the same adverse conditions? If not, robust covert design cannot be reduced to a single worst-case environment. In this paper, we study this question in a covert wireless model with quasi-static fading, outage-based reliability at Bob and radiometric detection at Willie. Uncertainty is represented through bounded intervals for Bob's average channel strength and Willie's noise power. To obtain a tractable characterization, we adopt a conditional large-N midpoint-threshold surrogate for Willie's detector, parameterized by a Willie-side fading realization. Within this framework, we show that the reliability constraint is governed by Bob's smallest admissible channel parameter, whereas the covertness constraint is governed by Willie's smallest admissible noise level. This establishes a conflict-aware robust-design principle: the adverse realizations for reliability and covertness differ. Based on this result, we derive closed-form expressions for the robustly feasible transmit power and the corresponding robust optimal rate. Numerical results show that bounded uncertainty contracts the feasible region, monotonically reduces the robust optimal rate, and can cause substantial loss relative to the nominal design. Monte Carlo results further show that the conditional surrogate closely tracks the midpoint-threshold radiometer in the intended low-effective-SNR regime. Overall, the paper shows that even in a streamlined wireless setting, robust covert design requires different adverse-case reasoning for reliability and covertness.

DOI
10.48550/arxiv.2604.13122

Related papers

A Risk-Aware Framework for Covert Quantum Communication under Stochastic Channel Uncertainty

Abbas Arghavani, Shahid Raza, Maryam Amiri +1 more

Covert quantum communication (CQC) seeks to hide not only message content but also the existence of communication. Existing CQC models usually assume deterministic or worst-case channel conditions, which are difficult to justify in realistic free-space optical and quantum links affected by turbulence, fluctuating background radiance, and stochastic detector noise. We propose a stochastic risk-aware optimization framework for CQC under uncertain physical-layer conditions. By modeling transmissivity and background noise as random variables, we express covertness and reliability guarantees through chance constraints with explicit outage budgets $ε_{\text{cov}}$ and $ε_{\text{rel}}$. This recasts CQC design as a risk-calibrated resource-allocation problem balancing throughput, covertness, reliability, and communication privacy. We derive quantile-based reformulations of the outage constraints, characterize feasible operating regions under stochastic uncertainty, and introduce a complementary risk-adjusted utility formulation to expose throughput-risk trade-offs. The analysis reveals that modest relaxations in acceptable covertness-outage risk can yield large throughput gains, while aggressive optimization may break covertness outside sparse-transmission regimes. Monte Carlo results under log-normal fading and stochastic thermal noise show that the framework expands feasible operating regions, improves covert throughput by more than an order of magnitude, and identifies degradation boundaries beyond which covert operation becomes unreliable. These results move CQC closer to realistic secure quantum networking for free-space, satellite, and low-probability-of-detection applications.

quant-pharXiv:2605.18928•May 19, 2026•0 citations

Robust Covert Quantum Communication under Bounded Channel Uncertainty

Abbas Arghavani, Alessandro V. Papadopoulos, Vahid Azimi Mousolou +2 more

Covert quantum communication is usually analyzed under idealized assumptions that channel parameters, such as transmissivity and background noise, are perfectly known and constant. In realistic optical links, including satellite, fiber, and free-space systems, these parameters vary because of environmental fluctuations, calibration noise, and estimation errors. We study covert quantum communication over compound quantum optical channels with bounded uncertainty in both transmissivity and thermal noise, and derive guarantees that hold for all admissible channel realizations. We develop a robust framework for certifying both covertness and reliability under uncertainty. A central finding is that robustness cannot be obtained by simply inserting worst-case parameter values into known-channel bounds: the channel realizations that are most adverse for covertness and reliability generally occur at different corners of the uncertainty set. This creates a fundamental trade-off in secure system design. We derive a closed-form lower bound on the worst-case guaranteed number of covert qubits that can be transmitted reliably, identify a sharp feasibility boundary beyond which the guaranteed payload drops to zero, and quantify the security penalty caused by uncertainty. We validate the covertness term with QuTiP simulations of a four-mode bosonic model and combine it with an analytical reliability bound to evaluate the robust payload. Our results move covert quantum communication from nominal perfect-knowledge analysis to certified worst-case operation under uncertainty.

arXiv:2604.13116•Apr 13, 2026•0 citations

Regulating Covert Communication Capacity with Full-Duplex Receiver Against Location-Uncertain Eavesdropper

Rui Xin Xu, Gaolei Li, Yuchen Liu +3 more

Covert communication enforces the transmitted signal to be indistinguishable from other signals under wireless environment, making it difficult for an eavesdropper to detect and intercept the message. The most common approach within covert systems is the augmentation of artificial noise (AN), ensuring reliable transmission. However, this strategy becomes problematic when the eavesdropper's position is uncertain, as continuous amplification of interference power can precipitate a substantial decline in covert communication capacity. In this paper, we investigate the covert communication between legitimate transmitter (i.e., Alice) and full duplex receiver (i.e., Bob) in the presence of the location uncertainties of the eavesdropper (i.e., Willie). We first derive the sufficient condition for achieving covert communication through robustness analysis. Then, we derive the effective throughput to measure the covert communication capacity. Afterward, by using joint optimization technology, the optimal AN power of Bob and the number of antennas for Alice are jointly designed to maximize the effective throughput subject to a covertness constraint. Theoretical analysis indicates that reducing the AN power while increasing the number of antennas helps to improve the system capacity, the effective throughput between Alice and Bob is inversely proportional to the distance between them. Finally, the validity of our analytical approach is corroborated by simulation results.

2012 International Conference on Computing, Networking and Communications (ICNC)•Feb 19, 2024•2 citations

Covert Communication in Uplink NOMA Systems Under Channel Distribution Information Uncertainty

Zhengxiang Duan, Xin Yang, Yanyun Gong +2 more

It is challenging to covert communication under channel distribution information (CDI) uncertainty caused by limited feedback and rapid-changing channels. This letter investigates covert communication in uplink non-orthogonal multiple access (NOMA) systems under CDI uncertainty, where a covert user (CU) and reliable user (RU) transmit messages to a legitimate receiver (Bob) threatened by a warden (Willie). RU not only transmits its public messages but also helps CU to send private messages against Willie’s detection. To protect CU’s transmission with imperfect CDI, we first study the worst case for NOMA users and obtain a lower bound of the worst-case detection error probability (DEP). In addition, both closed-form expressions for RU and CU’s connection outage probabilities are derived. Constrained by the DEP and connection outage probability, we maximize the expected covert rate (ECR) and derive the optimal power settings for RU and CU under imperfect CDI. Numerical results show that the proposed robust power setting scheme achieves a positive maximum ECR despite CDI uncertainty causing the reduction of covertness performance.

IEEE Communications Letters•Mar 10, 2023•33 citations

Covert Communication Based on Noise Uncertainty Against Multi-Antenna Detection: Analyses of Limit Covert and Reliable Rate

Weiyu Chen, Haiyang Ding, Shilian Wang +3 more

Uncertainty about noise variance is unavoidable. Many existing works exploited the noise uncertainty for covert communication and meanwhile assumed that the adversary third party Willie adopts a radiometer detector, in which case a positive covert and reliable rate O(N) bits/N channel uses is achievable. Nonetheless, the radiometer is not optimal in general. The limit covert and reliable rate based on noise uncertainty against the optimal detector remains unknown. To shed light on this problem, this letter proves that when Willie suffers from noise uncertainty but has two or more antennas for detection, the limit covert and reliable rate over additive white Gaussian noise channels is O(N) bits/N channel uses. This rate is the same as the limit rate without the noise uncertainty, which means that the covert performance gain stemming from the noise uncertainty is indeed fragile. The key of the proof is the proposed correlation detector for Willie, which is easy to deploy and does not require any knowledge about channel coefficients or transmitter’s codebook.

IEEE Wireless Communications Letters•Oct 11, 2023•5 citations

Target Sensing-Aided Covert Communication: Reduce Position Randomness

Xinwei Zhu, Weiwei Yang, Qiao Su +2 more

This paper investigates the covert communication in the scenario of counter detection. In traditional covert communication design where the uncertainty of the position of the Warden Willie typically reduces covert performance. To overcome this limitation, we leverage the sensing ability of the ISAC system in a new way to reduce the channel uncertainty between Alice and Willie, thereby enabling less conservative power allocation and significantly improving the achievable covert throughput. In the first stage, the dual functional sensing and communication (DFRC) base station Bob sends joint signals to estimate the azimuth of Willie and transmits information to Alice at the same time. In the second stage, Alice uses the obtained azimuth information of Willie to adjust transmit power while meeting the covert constraints. We build a mathematical model of azimuth angle estimation error and connect it with the Cramér-Rao Bound (CRB) to change it into distance error. This connects sensing accuracy with channel state information (CSI) uncertainty in a linear way, allowing Alice to adopt a higher transmit power while still satisfying the covert constraint, and thus improving the achievable covert throughput. To increase the covert throughput of the user, we use a layered solving strategy to decouple the original problem. First, we use S-procedure to change the constraint on possible distance error into a linear matrix inequality (LMI) constraint and then find the upper limit of transmit power on the user side. Second, we combine it with the uplink communication link rate constraint to find the closed form expression of the resource allocation strategy in vector space. Finally, we use one dimensional search to find the optimal time slot allocation strategy. Simulation results show that the proposed two-stage protocol effectively improves the achievable covert throughput by reducing position uncertainty through sensing.

IEEE Sensors Journal•Jan 1, 2026•1 citation
Covert wireless communication aims to establish a reliable link while hiding the transmission from an adversary. In wireless settings, uncertainty plays a central role in this tradeoff: it can help mask the signal from a warden, but it also complicates robust system design. This raises a basic question: under bounded uncertainty, are reliability and covertness governed by the same adverse conditions? If not, robust covert design cannot be reduced to a single worst-case environment. In this paper, we study this question in a covert wireless model with quasi-static fading, outage-based reliability at Bob and radiometric detection at Willie. Uncertainty is represented through bounded intervals for Bob's average channel strength and Willie's noise power. To obtain a tractable characterization, we adopt a conditional large-N midpoint-threshold surrogate for Willie's detector, parameterized by a Willie-side fading realization. Within this framework, we show that the reliability constraint is governed by Bob's smallest admissible channel parameter, whereas the covertness constraint is governed by Willie's smallest admissible noise level. This establishes a conflict-aware robust-design principle: the adverse realizations for reliability and covertness differ. Based on this result, we derive closed-form expressions for the robustly feasible transmit power and the corresponding robust optimal rate. Numerical results show that bounded uncertainty contracts the feasible region, monotonically reduces the robust optimal rate, and can cause substantial loss relative to the nominal design. Monte Carlo results further show that the conditional surrogate closely tracks the midpoint-threshold radiometer in the intended low-effective-SNR regime. Overall, the paper shows that even in a streamlined wireless setting, robust covert design requires different adverse-case reasoning for reliability and covertness.
Covert quantum communication (CQC) seeks to hide not only message content but also the existence of communication. Existing CQC models usually assume deterministic or worst-case channel conditions, which are difficult to justify in realistic free-space optical and quantum links affected by turbulence, fluctuating background radiance, and stochastic detector noise. We propose a stochastic risk-aware optimization framework for CQC under uncertain physical-layer conditions. By modeling transmissivity and background noise as random variables, we express covertness and reliability guarantees through chance constraints with explicit outage budgets εcovε_{\text{cov}}εcov​ and εrelε_{\text{rel}}εrel​. This recasts CQC design as a risk-calibrated resource-allocation problem balancing throughput, covertness, reliability, and communication privacy. We derive quantile-based reformulations of the outage constraints, characterize feasible operating regions under stochastic uncertainty, and introduce a complementary risk-adjusted utility formulation to expose throughput-risk trade-offs. The analysis reveals that modest relaxations in acceptable covertness-outage risk can yield large throughput gains, while aggressive optimization may break covertness outside sparse-transmission regimes. Monte Carlo results under log-normal fading and stochastic thermal noise show that the framework expands feasible operating regions, improves covert throughput by more than an order of magnitude, and identifies degradation boundaries beyond which covert operation becomes unreliable. These results move CQC closer to realistic secure quantum networking for free-space, satellite, and low-probability-of-detection applications.
Covert quantum communication is usually analyzed under idealized assumptions that channel parameters, such as transmissivity and background noise, are perfectly known and constant. In realistic optical links, including satellite, fiber, and free-space systems, these parameters vary because of environmental fluctuations, calibration noise, and estimation errors. We study covert quantum communication over compound quantum optical channels with bounded uncertainty in both transmissivity and thermal noise, and derive guarantees that hold for all admissible channel realizations. We develop a robust framework for certifying both covertness and reliability under uncertainty. A central finding is that robustness cannot be obtained by simply inserting worst-case parameter values into known-channel bounds: the channel realizations that are most adverse for covertness and reliability generally occur at different corners of the uncertainty set. This creates a fundamental trade-off in secure system design. We derive a closed-form lower bound on the worst-case guaranteed number of covert qubits that can be transmitted reliably, identify a sharp feasibility boundary beyond which the guaranteed payload drops to zero, and quantify the security penalty caused by uncertainty. We validate the covertness term with QuTiP simulations of a four-mode bosonic model and combine it with an analytical reliability bound to evaluate the robust payload. Our results move covert quantum communication from nominal perfect-knowledge analysis to certified worst-case operation under uncertainty.
Covert communication enforces the transmitted signal to be indistinguishable from other signals under wireless environment, making it difficult for an eavesdropper to detect and intercept the message. The most common approach within covert systems is the augmentation of artificial noise (AN), ensuring reliable transmission. However, this strategy becomes problematic when the eavesdropper's position is uncertain, as continuous amplification of interference power can precipitate a substantial decline in covert communication capacity. In this paper, we investigate the covert communication between legitimate transmitter (i.e., Alice) and full duplex receiver (i.e., Bob) in the presence of the location uncertainties of the eavesdropper (i.e., Willie). We first derive the sufficient condition for achieving covert communication through robustness analysis. Then, we derive the effective throughput to measure the covert communication capacity. Afterward, by using joint optimization technology, the optimal AN power of Bob and the number of antennas for Alice are jointly designed to maximize the effective throughput subject to a covertness constraint. Theoretical analysis indicates that reducing the AN power while increasing the number of antennas helps to improve the system capacity, the effective throughput between Alice and Bob is inversely proportional to the distance between them. Finally, the validity of our analytical approach is corroborated by simulation results.
It is challenging to covert communication under channel distribution information (CDI) uncertainty caused by limited feedback and rapid-changing channels. This letter investigates covert communication in uplink non-orthogonal multiple access (NOMA) systems under CDI uncertainty, where a covert user (CU) and reliable user (RU) transmit messages to a legitimate receiver (Bob) threatened by a warden (Willie). RU not only transmits its public messages but also helps CU to send private messages against Willie’s detection. To protect CU’s transmission with imperfect CDI, we first study the worst case for NOMA users and obtain a lower bound of the worst-case detection error probability (DEP). In addition, both closed-form expressions for RU and CU’s connection outage probabilities are derived. Constrained by the DEP and connection outage probability, we maximize the expected covert rate (ECR) and derive the optimal power settings for RU and CU under imperfect CDI. Numerical results show that the proposed robust power setting scheme achieves a positive maximum ECR despite CDI uncertainty causing the reduction of covertness performance.
Uncertainty about noise variance is unavoidable. Many existing works exploited the noise uncertainty for covert communication and meanwhile assumed that the adversary third party Willie adopts a radiometer detector, in which case a positive covert and reliable rate O(N) bits/N channel uses is achievable. Nonetheless, the radiometer is not optimal in general. The limit covert and reliable rate based on noise uncertainty against the optimal detector remains unknown. To shed light on this problem, this letter proves that when Willie suffers from noise uncertainty but has two or more antennas for detection, the limit covert and reliable rate over additive white Gaussian noise channels is O(N) bits/N channel uses. This rate is the same as the limit rate without the noise uncertainty, which means that the covert performance gain stemming from the noise uncertainty is indeed fragile. The key of the proof is the proposed correlation detector for Willie, which is easy to deploy and does not require any knowledge about channel coefficients or transmitter’s codebook.
This paper investigates the covert communication in the scenario of counter detection. In traditional covert communication design where the uncertainty of the position of the Warden Willie typically reduces covert performance. To overcome this limitation, we leverage the sensing ability of the ISAC system in a new way to reduce the channel uncertainty between Alice and Willie, thereby enabling less conservative power allocation and significantly improving the achievable covert throughput. In the first stage, the dual functional sensing and communication (DFRC) base station Bob sends joint signals to estimate the azimuth of Willie and transmits information to Alice at the same time. In the second stage, Alice uses the obtained azimuth information of Willie to adjust transmit power while meeting the covert constraints. We build a mathematical model of azimuth angle estimation error and connect it with the Cramér-Rao Bound (CRB) to change it into distance error. This connects sensing accuracy with channel state information (CSI) uncertainty in a linear way, allowing Alice to adopt a higher transmit power while still satisfying the covert constraint, and thus improving the achievable covert throughput. To increase the covert throughput of the user, we use a layered solving strategy to decouple the original problem. First, we use S-procedure to change the constraint on possible distance error into a linear matrix inequality (LMI) constraint and then find the upper limit of transmit power on the user side. Second, we combine it with the uplink communication link rate constraint to find the closed form expression of the resource allocation strategy in vector space. Finally, we use one dimensional search to find the optimal time slot allocation strategy. Simulation results show that the proposed two-stage protocol effectively improves the achievable covert throughput by reducing position uncertainty through sensing.