pith. sign in

arxiv: 1907.01350 · v2 · pith:WRTL4MFLnew · submitted 2019-07-02 · 📡 eess.SP

Covert Communication Using Null Space and 3D Beamforming

Moslem Forouzesh , Paeiz Azmi , Nader Mokari , Dennis Goeckel This is my paper

Pith reviewed 2026-05-25 10:52 UTC · model grok-4.3

classification 📡 eess.SP
keywords covert communicationnull space beamforming3D beamformingjammingoptimizationmultiple antennaswireless security
0
0 comments X

The pith

A multi-antenna jammer that nulls its signal at the receiver via beamforming, paired with 3D beamforming at the transmitter, raises the achievable rate for covert communications.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that covert communication is rate-limited by the need to hide signals in noise, but a jammer with multiple antennas can beamform to place the intended receiver in the null space of its jamming signal. At the same time, a transmitter with three-dimensional antennas can direct its beam toward the recipient to concentrate power. This combination reduces the jamming power that reaches the receiver while preserving the jamming effect elsewhere, allowing higher covert rates. The authors formulate an optimization problem over the beamforming vectors and solve it with an iterative algorithm, then compare the resulting rates against exhaustive search in numerical evaluations.

Core claim

A multiple-antenna jammer that employs beamforming to place the intended receiver in the null space of the jamming signal, together with a multi-antenna transmitter that uses three-dimensional antennas to beamform toward its intended recipient, improves the rate of covert communications; the design is evaluated by solving a formulated optimization problem iteratively and measuring the achieved covert rate against exhaustive search.

What carries the argument

Null-space projection of the jamming signal at a multi-antenna jammer combined with three-dimensional directional beamforming at the transmitter, jointly optimized by an iterative algorithm under a covertness constraint.

If this is right

  • The covert communication rate increases because jamming power is removed from the intended receiver while remaining effective against potential eavesdroppers.
  • The iterative algorithm produces beamforming vectors whose performance approaches that of exhaustive search over the same search space.
  • The architecture remains compatible with standard covertness metrics based on the total variation distance or Kullback-Leibler divergence between the distributions observed with and without the transmission.
  • The design applies whenever the transmitter and jammer each have multiple antennas and the transmitter can form three-dimensional beams.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same null-space technique could be examined under imperfect or delayed channel estimates to test robustness.
  • The approach might be combined with artificial-noise methods at the transmitter to further shape the received distributions.
  • Extension to multi-user or relay-assisted covert scenarios would require re-deriving the null-space and beamforming constraints.
  • Hardware experiments with measured 3D antenna patterns would reveal whether the modeled radiation patterns hold in practice.

Load-bearing premise

The jammer possesses perfect channel state information to the intended receiver so that the receiver can be accurately placed in the null space of the jamming signal.

What would settle it

Numerical evaluation in which the iterative optimization yields covert rates no higher than those obtained when the jammer transmits isotropically without null-space projection.

Figures

Figures reproduced from arXiv: 1907.01350 by Dennis Goeckel, Moslem Forouzesh, Nader Mokari, Paeiz Azmi.

Figure 1
Figure 1. Figure 1: System model. boresight angle and the vertical 3dB beamwidth of Alice’s antenna. Furthermore, ϕm = tan−1 √ ∆zm xm+ym , where ∆zm is the height difference between Alice and node m. Finally, the antenna gain in dB scale is formulated as [11]: Ω (θm, ϕm) = Ωmax − min {Ξv (ϕm) + ΞH (θm), Ξm} . (1) where Ωmax is the maximum antenna gain at boresight. Given Ξv (ϕm) + ΞH (θm) ≤ Ξm, the antenna gain in linear scal… view at source ↗
Figure 2
Figure 2. Figure 2: Evaluation of proposed network and proposed solution of optimization problem. [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
read the original abstract

Covert communication is often limited in rate because it is difficult to hide the signal in the background noise. Recent work has shown that jamming can significantly improve the rate at which covert communications can be conducted; however, the rate could be improved further if the jamming incident on the intended receiver can be mitigated. Here, we consider a multiple-antenna jammer that employs beamforming to place the intended receiver in the null space of the jamming and a multi-antenna transmitter equipped with three-dimensional (3D) antennas that is able to beamform toward its intended recipient. To evaluate this design, we formulate an optimization problem and present an iterative algorithm to solve it. Numerical results consider both the rate of covert communications with the proposed architecture and the gap between the result from our optimization and that obtained from exhaustive search.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper proposes a covert communication architecture in which a multi-antenna jammer uses beamforming to place the legitimate receiver in the null space of the jamming signal while a multi-antenna transmitter employs 3D beamforming toward the receiver. An optimization problem is formulated to maximize the covert rate and solved via an iterative algorithm; numerical results compare the achieved rate against exhaustive search.

Significance. If the performance claims hold under the stated assumptions, the combination of null-space jamming mitigation and 3D transmit beamforming would represent a concrete architectural improvement over prior jamming-assisted covert schemes, potentially raising achievable covert rates without increasing transmit power.

major comments (2)
  1. [Optimization formulation and numerical evaluation] The optimization and iterative algorithm are formulated under the assumption of perfect instantaneous CSI at the jammer (to achieve exact null-space placement). No sensitivity analysis or imperfect-CSI model is provided, yet any estimation error would leak jamming power into the receiver and directly reduce the covert rate, undermining the reported gains over non-nulling baselines.
  2. [Numerical results] The abstract and results section state that the iterative solution is compared to exhaustive search, but the manuscript provides neither the explicit channel models, the convergence proof for the iterative algorithm, nor error bounds on the gap between the two, leaving the central performance claim unverifiable from the given derivation.
minor comments (1)
  1. [System model] Notation for the 3D beamforming vectors and the null-space projection matrix should be introduced with explicit definitions before the optimization problem is stated.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for the constructive comments. We respond to each major comment below and indicate where revisions will be made.

read point-by-point responses

  1. Referee: [Optimization formulation and numerical evaluation] The optimization and iterative algorithm are formulated under the assumption of perfect instantaneous CSI at the jammer (to achieve exact null-space placement). No sensitivity analysis or imperfect-CSI model is provided, yet any estimation error would leak jamming power into the receiver and directly reduce the covert rate, undermining the reported gains over non-nulling baselines.

    Authors: The manuscript explicitly assumes perfect instantaneous CSI in the system model to enable exact null-space placement and derive the achievable covert rate under ideal conditions. This is a standard modeling choice to quantify the potential benefit of the architecture. We agree that the absence of an imperfect-CSI analysis is a limitation. In the revised manuscript we will add a sensitivity study using an additive Gaussian CSI error model and corresponding numerical results. revision: yes

  2. Referee: [Numerical results] The abstract and results section state that the iterative solution is compared to exhaustive search, but the manuscript provides neither the explicit channel models, the convergence proof for the iterative algorithm, nor error bounds on the gap between the two, leaving the central performance claim unverifiable from the given derivation.

    Authors: Section II states the 3D channel model with path-loss, small-scale fading, and angle parameters. Algorithm 1 in Section III gives the iterative procedure, and Section IV reports numerical gaps to exhaustive search on small instances. We will expand the channel equations and add a convergence plot with observed iteration counts. A formal convergence proof and analytical error bounds are not available in the current derivation. revision: partial

standing simulated objections not resolved
  • Formal convergence proof and analytical error bounds for the iterative algorithm

Circularity Check

0 steps flagged

No circularity: optimization uses external standard models

full rationale

The paper's derivation consists of formulating a standard optimization problem over beamforming vectors and power allocations using conventional wireless channel models, null-space projection, and covert rate expressions drawn from prior literature. The iterative algorithm is a numerical solver for this optimization, and results are validated against exhaustive search. No step reduces the claimed rate improvement to a parameter fitted inside the paper, a self-citation chain, or a definitional equivalence; the central claims remain independent of the paper's own outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The approach depends on standard domain assumptions in wireless communications; no new entities are postulated and no free parameters are explicitly introduced in the abstract.

axioms (1)
  • domain assumption Perfect channel state information is available at the jammer to form the null space.
    Null-space placement requires exact knowledge of the channel to the intended receiver; this is invoked implicitly when the jammer is described as placing the receiver in the null space.

pith-pipeline@v0.9.0 · 5672 in / 1259 out tokens · 53092 ms · 2026-05-25T10:52:00.387800+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Joint Secrecy and Covert Communication (JSACC): An Enhanced Physical Layer Security Approach

    eess.SP 2026-04 unverdicted novelty 4.0

    JSACC dynamically switches between secrecy and covert modes using RIS, derives closed-form outage probability and ergodic rate, shows diversity order depends on Nakagami parameters and RIS elements, and outperforms co...

Reference graph

Works this paper leans on

13 extracted references · 13 canonical work pages · cited by 1 Pith paper · 2 internal anchors

  1. [1]

    Square root law for com- munication with low probability of detection on AWGN channels,

    B. A. Bash, D. Goeckel, and D. Towsley, “Square root law for com- munication with low probability of detection on AWGN channels,” In proc. IEEE Inter . Symp. on Inform. Theor . Proceed., Cambridge, MA, USA, Jul. 2012, pp. 448-452

    work page 2012

  2. [2]

    Limits of reliable communi- cation with low probability of detection on AWGN channels,

    B. A. Bash, D. Goeckel, and D. Towsley, “Limits of reliable communi- cation with low probability of detection on AWGN channels,” IEEE J. Sel. Areas Commun., vol. 31, no. 9, pp. 1921-1930, Sep. 2013

    work page 1921

  3. [3]

    Reliable deniable communication: Hiding messages in noise,

    P.H. Che, M. Bakshi, S. Jaggi, “Reliable deniable communication: Hiding messages in noise,” In proc IEEE Inter . Symp. on Inf. Theor ., Istanbul, Turkey, Jul. 2013, pp. 2945-2949

    work page 2013

  4. [4]

    Covert communication over noisy channels: A resolv- ability perspective,

    M. R. Bloch, “Covert communication over noisy channels: A resolv- ability perspective,” IEEE Trans. on Inform. Theor ., vol. 62, no. 5, pp. 2334-2354, May. 2016

    work page 2016

  5. [5]

    Fundamental limits of communica- tion with low probability of detection,

    L. Wang, G. W. Wornell, L. Zheng, “Fundamental limits of communica- tion with low probability of detection,” IEEE Trans. on Inform. Theor ., vol. 62, no. 6, pp. 3493-3450, Jun. 2016

    work page 2016

  6. [6]

    Covert communication in fading channels under channel uncertainty,

    K. Shahzad, X. Zhou, and S. Yan, “Covert communication in fading channels under channel uncertainty,”In proc. IEEE VTC., Sydney, NSW, Australia, Nov. 2017

    work page 2017

  7. [7]

    Robust Power Allocation in Covert Communication: Imperfect CDI

    M. Forouzesh, P Azmi, N Mokari, D. Goeckel, “Robust power allocation in covert communication: imperfect CDI”, arXiv:1901.04914v1

    work page internal anchor Pith review Pith/arXiv arXiv 1901

  8. [8]

    Secure transmission with covert requirement in untrusted relaying networks

    M. Forouzesh, P. Azmi, Ali kuhestani, “Secure Transmission with covert Requirement in Untrusted Relaying Networks” arXiv:1809.00312 [cs.CR]

    work page internal anchor Pith review Pith/arXiv arXiv

  9. [9]

    Achieving undetectable communication,

    S. Lee, R. J. Baxley, M. A. Weitnauer, and B. Walkenhorst, “Achieving undetectable communication,” IEEE J. Sel. Topics Signal Process., vol. 9, no. 7, pp. 1195-1205, Oct. 2015

    work page 2015

  10. [10]

    Covert communication in the presence of an uninformed jammer,

    T. Sobers, B. Bash, S. Guha, D. Towsley, and D. Goeckel, “Covert communication in the presence of an uninformed jammer,” IEEE Trans. on Wireless Commun , vol. 16, no. 9, pp. 6193-6206, Sep. 2017

    work page 2017

  11. [11]

    Report M.2135-1: Guidelines for Evaluation of Radio Interface Tech- nologies for IMT-Advanced,

    Radio communication Sector of International Telecommunication Union, “Report M.2135-1: Guidelines for Evaluation of Radio Interface Tech- nologies for IMT-Advanced,” ITU-R M Series , Oct. 2009

    work page 2009

  12. [12]

    CVX Research, CVX: Matlab software for disciplined convex pro- gramming, version 2.0, http://cvxr.com/cvx, Aug

    I. CVX Research, CVX: Matlab software for disciplined convex pro- gramming, version 2.0, http://cvxr.com/cvx, Aug. 2012

    work page 2012

  13. [13]

    Semidefinite relaxation of quadratic optimization problems,

    Z. Luo, A. M. So, Y . Ye, S. Zhang., “ Semidefinite relaxation of quadratic optimization problems,” IEEE Signal Process. Magazine, V ol. 27, no: 3, pp. 201-234, May. 2010

    work page 2010