pith. sign in

arxiv: 1907.09602 · v1 · pith:Y36IA3LTnew · submitted 2019-07-22 · 💻 cs.IT · math.IT· quant-ph

Steganography Protocols for Quantum Channels

Mehrdad Tahmasbi , Matthieu Bloch This is my paper

Pith reviewed 2026-05-24 17:37 UTC · model grok-4.3

classification 💻 cs.IT math.ITquant-ph
keywords quantum steganographyquantum channelscovert communicationclassical communicationentanglement sharingrandomness sharinginformation hiding
0
0 comments X

The pith

Quantum steganography allows classical cyphers to be hidden in noiseless quantum communication covers without shared keys.

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

The paper investigates quantum steganography, where two parties hide a secret cypher task within a cover communication task sent over a quantum channel, evading detection by a warden with inaccurate channel knowledge. It examines multiple combinations of tasks: classical covers can hide classical communication or entanglement sharing; entanglement covers can hide randomness sharing; and noiseless quantum covers can hide classical communication. The quantum cover case improves earlier results by eliminating the need for a pre-shared key and relaxing assumptions on the cover code. This matters because it provides protocols for concealing information in quantum systems under realistic imperfect monitoring conditions.

Core claim

In the quantum steganography problem, when the cover task is quantum communication over a noiseless main channel, the cypher task can be classical communication. This is achieved without requiring a shared key between the transmitter and receiver, and the results hold under milder assumptions on the cover quantum communication code than previous work, given that the warden has inaccurate knowledge of the quantum channel. Analogous results are shown for other pairs of cover and cypher tasks.

What carries the argument

Models of steganography that pair different communication tasks as cover and cypher, with the mechanism relying on the warden's inaccurate channel knowledge to allow embedding without suspicion.

Load-bearing premise

The warden has an inaccurate knowledge of the quantum channel.

What would settle it

An experiment in which the warden is given exact knowledge of the channel and checks whether the steganography protocol still conceals the cypher without raising suspicion.

Figures

Figures reproduced from arXiv: 1907.09602 by Matthieu Bloch, Mehrdad Tahmasbi.

Figure 1
Figure 1. Figure 1: Willie’s expectation (top) and true communication (bottom) [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Rate of the cypher message vs the symplectic eigenvalues of [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
read the original abstract

We study several versions of a quantum steganography problem, in which two legitimate parties attempt to conceal a cypher in a quantum cover transmitted over a quantum channel without arising suspicion from a warden who intercepts the cover. In all our models, we assume that the warden has an inaccurate knowledge of the quantum channel and we formulate several variations of the steganography problem depending on the tasks used as the cover and the cypher task. In particular, when the cover task is classical communication, we show that the cypher task can be classical communication or entanglement sharing; when the cover task is entanglement sharing and the main channel is noiseless, we show that the cypher task can be randomness sharing; when the cover task is quantum communication and the main channel is noiseless, we show that the cypher task can be classical communication. In the latter case, our results improve earlier ones by relaxing the need for a shared key between the transmitter and the receiver and hold under milder assumptions on the cover quantum communication code.

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

0 major / 2 minor

Summary. The manuscript examines multiple variants of quantum steganography in which two parties embed a cypher task inside a cover task sent over a quantum channel, with the goal of avoiding detection by a warden possessing inaccurate knowledge of the channel. It derives protocols for several cover-cypher pairs: classical communication as cover permits classical communication or entanglement sharing as cypher; entanglement sharing as cover over a noiseless channel permits randomness sharing as cypher; and quantum communication as cover over a noiseless channel permits classical communication as cypher. The last case is claimed to improve prior results by eliminating any shared key and by operating under milder assumptions on the cover quantum communication code.

Significance. If the stated derivations are correct, the results would constitute a modest but concrete advance in quantum steganography by relaxing the shared-key requirement and the assumptions placed on the cover code, all while retaining the warden's imperfect channel knowledge. Such relaxations could make the protocols more applicable to practical quantum communication settings where perfect shared randomness or strong code assumptions are unrealistic.

minor comments (2)
  1. The abstract asserts that 'results are shown' for the listed task pairs, yet the provided text contains no explicit theorem statements, proof sketches, or channel-model definitions that would allow verification of the central claims.
  2. Notation for the warden's inaccurate channel knowledge is introduced only at a high level; a precise mathematical statement of the inaccuracy model (e.g., distance from the true channel) would aid readability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their summary of the manuscript and for noting the potential practical value of relaxing shared-key requirements and cover-code assumptions under imperfect warden channel knowledge. We appreciate the recognition that these relaxations could improve applicability.

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper derives existence of steganography protocols for various cover-cypher task pairs over quantum channels, under the explicit modeling assumption that the warden has inaccurate channel knowledge. All results are presented as constructive or existence proofs that rely on standard quantum information coding theorems and channel models rather than on fitted parameters, self-referential definitions, or load-bearing self-citations that reduce the central claim to its own inputs. The improvement over prior work (relaxing shared-key requirements) is stated as a direct consequence of the milder cover-code assumptions and the warden model; no equation or protocol step is shown to be equivalent to its own premise by construction. This is the normal case for a theoretical protocol paper whose claims remain externally falsifiable via the stated channel assumptions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central modeling assumption is the warden's inaccurate channel knowledge; no free parameters or invented entities are visible in the abstract.

axioms (1)
  • domain assumption Warden has inaccurate knowledge of the quantum channel
    Explicitly stated as the assumption underlying all models.

pith-pipeline@v0.9.0 · 5700 in / 1046 out tokens · 25104 ms · 2026-05-24T17:37:54.049681+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.

Reference graph

Works this paper leans on

38 extracted references · 38 canonical work pages

  1. [1]

    I. Cox, M. Miller, J. Bloom, J. Fridrich, and T. Kalker, Digital Watermarking and Steganography , 2nd ed. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2008

    work page 2008

  2. [2]

    Information-theoretic analysis of information hiding,

    P. Moulin and J. O’Sullivan, “Information-theoretic analysis of information hiding,” IEEE Transactions on Information Theory , vol. 49, no. 3, pp. 563–593, 2003

    work page 2003

  3. [3]

    Perfectly secure steganography: Capacity, error exponents, and code constructions,

    Y . Wang and P. Moulin, “Perfectly secure steganography: Capacity, error exponents, and code constructions,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2706–2722, 2008

    work page 2008

  4. [4]

    An information-theoretic model for steganography,

    C. Cachin, “An information-theoretic model for steganography,” Information and Computation , vol. 192, no. 1, pp. 41–56, July 2004

    work page 2004

  5. [5]

    A capacity result for batch steganography,

    A. Ker, “A capacity result for batch steganography,” IEEE Signal Processing Letters , vol. 14, no. 8, pp. 525–528, 2007

    work page 2007

  6. [6]

    Limits of reliable communication with low probability of detection on AWGN channels,

    B. Bash, D. Goeckel, and D. Towsley, “Limits of reliable communication with low probability of detection on AWGN channels,” IEEE Journal on Selected Areas in Communications , vol. 31, no. 9, pp. 1921–1930, September 2013

    work page 1921

  7. [7]

    Effective secrecy: Reliability, confusion and stealth,

    J. Hou and G. Kramer, “Effective secrecy: Reliability, confusion and stealth,” in Proc. of IEEE International Symposium on Information Theory, Honolulu, HI, July 2014, pp. 601–605

    work page 2014

  8. [8]

    Covert communication in the presence of an uninformed jammer,

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

    work page 2017

  9. [9]

    Covert wireless communication with artificial noise generation,

    R. Soltani, D. Goeckel, D. Towsley, B. A. Bash, and S. Guha, “Covert wireless communication with artificial noise generation,” IEEE Transactions on Wireless Communications , vol. 17, no. 11, pp. 7252–7267, Nov 2018

    work page 2018

  10. [10]

    Achieving covert wireless communications using a full-duplex receiver,

    K. Shahzad, X. Zhou, S. Yan, J. Hu, F. Shu, and J. Li, “Achieving covert wireless communications using a full-duplex receiver,” IEEE Transactions on Wireless Communications , vol. 17, no. 12, pp. 8517–8530, Dec 2018

    work page 2018

  11. [11]

    Covert communication achieved by a greedy relay in wireless networks,

    J. Hu, S. Yan, X. Zhou, F. Shu, J. Li, and J. Wang, “Covert communication achieved by a greedy relay in wireless networks,” IEEE Transactions on Wireless Communications , vol. 17, no. 7, pp. 4766–4779, July 2018

    work page 2018

  12. [12]

    Why quantum steganography can be stronger than classical steganography,

    S. Natori, “Why quantum steganography can be stronger than classical steganography,” in Quantum Computation and Information: From Theory to Experiment , H. Imai and M. Hayashi, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 235–240

    work page 2006

  13. [13]

    Hiding messages in quantum data,

    J. Gea-Banacloche, “Hiding messages in quantum data,” Journal of Mathematical Physics , vol. 43, no. 9, pp. 4531–4536, Aug. 2002

    work page 2002

  14. [14]

    Quantum steganography with noisy quantum channels,

    B. A. Shaw and T. A. Brun, “Quantum steganography with noisy quantum channels,” Phys. Rev. A, vol. 83, p. 022310, Feb 2011

    work page 2011

  15. [15]

    Covert communication over classical-quantum channels,

    A. Sheikholeslami, B. A. Bash, D. Towsley, D. Goeckel, and S. Guha, “Covert communication over classical-quantum channels,” in Proc. of IEEE International Symposium on Information Theory , Barcelona, Spain, July 2016, pp. 2064–2068

    work page 2016

  16. [16]

    Quantum steganography over noisy channels: Achievability and bounds,

    C. Sutherland and T. A. Brun, “Quantum steganography over noisy channels: Achievability and bounds,” arXiv preprint 1808.03183, Aug. 2018

    work page arXiv 2018

  17. [17]

    Perfectly secure steganography: Hiding information in the quantum noise of a photograph,

    B. Sanguinetti, G. Traverso, J. Lavoie, A. Martin, and H. Zbinden, “Perfectly secure steganography: Hiding information in the quantum noise of a photograph,” Phys. Rev. A, vol. 93, p. 012336, Jan 2016

    work page 2016

  18. [18]

    Quantum steganography over noiseless channels: Achievability and bounds,

    C. Sutherland and T. A. Brun, “Quantum steganography over noiseless channels: Achievability and bounds,” arXiv: 1805.01599, May 2018

    work page arXiv 2018

  19. [19]

    Steganography protocols for quantum channels,

    M. Tahmasbi, , and M. R. Bloch, “Steganography protocols for quantum channels,” in accepted to IEEE nternational Symposium on Information Theory, 2019

    work page 2019

  20. [20]

    Noisy channel coding via privacy amplification and information reconciliation,

    J. M. Renes and R. Renner, “Noisy channel coding via privacy amplification and information reconciliation,” IEEE Transactions on Information Theory, vol. 57, no. 11, pp. 7377–7385, Nov 2011

    work page 2011

  21. [21]

    Achievability proof via output statistics of random binning,

    M. H. Yassaee, M. R. Aref, and A. Gohari, “Achievability proof via output statistics of random binning,” IEEE Transactions on Information Theory, vol. 60, no. 11, pp. 6760–6786, Nov 2014

    work page 2014

  22. [22]

    Hayashi, Quantum information: An Introduction

    M. Hayashi, Quantum information: An Introduction . Springer, 2006

    work page 2006

  23. [23]

    A hierarchy of information quantities for finite block length analysis of quantum tasks,

    M. Tomamichel and M. Hayashi, “A hierarchy of information quantities for finite block length analysis of quantum tasks,” IEEE Transactions on Information Theory , vol. 59, no. 11, pp. 7693–7710, Nov 2013

    work page 2013

  24. [24]

    One-shot classical-quantum capacity and hypothesis testing,

    L. Wang and R. Renner, “One-shot classical-quantum capacity and hypothesis testing,” Phys. Rev. Lett., vol. 108, p. 200501, May 2012

    work page 2012

  25. [25]

    A resource framework for quantum shannon theory,

    I. Devetak, A. W. Harrow, and A. J. Winter, “A resource framework for quantum shannon theory,” IEEE Transactions on Information Theory, vol. 54, no. 10, pp. 4587–4618, 2008

    work page 2008

  26. [26]

    M. M. Wilde, Quantum information theory . Cambridge University Press, 2013

    work page 2013

  27. [27]

    Concentrating partial entanglement by local operations,

    C. H. Bennett, H. J. Bernstein, S. Popescu, and B. Schumacher, “Concentrating partial entanglement by local operations,” Phys. Rev. A , vol. 53, pp. 2046–2052, Apr 1996. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.53.2046

    work page doi:10.1103/physreva.53.2046 2046

  28. [28]

    Minimal entropy of states emerging from noisy quantum channels,

    C. King and M. B. Ruskai, “Minimal entropy of states emerging from noisy quantum channels,” IEEE Transactions on Information Theory, vol. 47, no. 1, pp. 192–209, Jan 2001

    work page 2001

  29. [29]

    Polar codes for classical-quantum channels,

    M. M. Wilde and S. Guha, “Polar codes for classical-quantum channels,” IEEE Transactions on Information Theory , vol. 59, no. 2, pp. 1175–1187, Feb 2013

    work page 2013

  30. [30]

    Continuous variable quantum information: Gaussian states and beyond,

    G. Adesso, S. Ragy, and A. R. Lee, “Continuous variable quantum information: Gaussian states and beyond,” Open Systems & Information Dynamics, vol. 21, no. 01n02, p. 1440001, 2014. [Online]. Available: https://doi.org/10.1142/S1230161214400010

    work page doi:10.1142/s1230161214400010 2014

  31. [31]

    Approximate quantum error correction, random codes, and quantum channel capacity,

    R. Klesse, “Approximate quantum error correction, random codes, and quantum channel capacity,” Phys. Rev. A , vol. 75, p. 062315, Jun 2007

    work page 2007

  32. [32]

    Random quantum codes from gaussian ensembles and an uncertainty relation,

    P. Hayden, P. W. Shor, and A. Winter, “Random quantum codes from gaussian ensembles and an uncertainty relation,” Open Systems & Information Dynamics, vol. 15, no. 01, pp. 71–89, 2008

    work page 2008

  33. [33]

    Counterexamples to the maximal p-norm multiplicativity conjecture for all p ¿ 1,

    P. Hayden and A. Winter, “Counterexamples to the maximal p-norm multiplicativity conjecture for all p ¿ 1,” Communications in Mathematical Physics, vol. 284, no. 1, pp. 263–280, Nov 2008

    work page 2008

  34. [34]

    On error exponents in quantum hypothesis testing,

    T. Ogawa and M. Hayashi, “On error exponents in quantum hypothesis testing,” IEEE Transactions on Information Theory , vol. 50, no. 6, pp. 1368–1372, June 2004

    work page 2004

  35. [35]

    Security of quantum key distribution,

    R. Renner, “Security of quantum key distribution,” International Journal of Quantum Information , vol. 6, no. 01, pp. 1–127, 2008

    work page 2008

  36. [36]

    A fully quantum asymptotic equipartition property,

    M. Tomamichel, R. Colbeck, and R. Renner, “A fully quantum asymptotic equipartition property,” IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5840–5847, Dec 2009

    work page 2009

  37. [37]

    Coding theorem and strong converse for quantum channels,

    A. Winter, “Coding theorem and strong converse for quantum channels,” IEEE Transactions on Information Theory , vol. 45, no. 7, pp. 2481–2485, Nov 1999

    work page 1999

  38. [38]

    Quantum computation and quantum information,

    M. A. Nielsen and I. Chuang, “Quantum computation and quantum information,” 2002

    work page 2002