Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2506.02297

Help | Advanced Search

Computer Science > Networking and Internet Architecture

arXiv:2506.02297 (cs)
[Submitted on 2 Jun 2025 ]

Title: Experimental Covert Communication Using Software-Defined Radio

Title: 基于软件定义无线电的实验隐蔽通信

Authors:Rohan Bali, Trevor E. Bailey, Michael S. Bullock, Boulat A. Bash
Abstract: The fundamental information-theoretic limits of covert, or low probability of detection (LPD), communication have been extensively studied for over a decade, resulting in the square root law (SRL): only $L\sqrt{n}$ covert bits can be reliably transmitted over time-bandwidth product $n$, for constant $L>0$. Transmitting more either results in detection or decoding errors. The SRL imposes significant constraints on hardware realization of provably-secure covert communication. Thus, experimental validation of covert communication is underexplored: to date, only two experimental studies of SRL-based covert communication are available, both focusing on optical channels. Here, we report our initial results demonstrating the provably-secure covert radio-frequency (RF) communication using software-defined radios (SDRs). These validate theoretical predictions, open practical avenues for implementing covert communication systems, as well as raise future research questions.
Abstract: 关于隐蔽通信,或者低检测概率(LPD)通信的信息论基本极限已经被研究了十多年,得到了平方根定律(SRL):对于常量 $L\sqrt{n}$,仅能在时频积 $n$ 上可靠传输 $L>0$ 个隐蔽比特。传输更多比特要么会导致被检测到,要么会导致解码错误。 SRL 对可证明安全的隐蔽通信硬件实现施加了重大限制。因此,隐蔽通信的实验验证尚不充分:迄今为止,只有两项基于 SRL 的隐蔽通信实验研究可用,且这两项研究都专注于光学信道。 在这里,我们报告了使用软件定义无线电(SDR)实现的可证明安全的隐蔽射频(RF)通信的初步成果。这些成果验证了理论预测,开辟了实现隐蔽通信系统的实际途径,并提出了未来的研究问题。
Comments: 8 pages, 5 figures
Subjects: Networking and Internet Architecture (cs.NI) ; Information Theory (cs.IT); Systems and Control (eess.SY)
Cite as: arXiv:2506.02297 [cs.NI]
  (or arXiv:2506.02297v1 [cs.NI] for this version)
  https://doi.org/10.48550/arXiv.2506.02297
arXiv-issued DOI via DataCite

Submission history

From: Boulat Bash [view email]
[v1] Mon, 2 Jun 2025 22:30:54 UTC (252 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
eess
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs
cs.IT
cs.NI
cs.SY
eess.SY
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号