Quantum steganographic protocols using degenerate and entanglement-assisted quantum codes

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Dutta, Sanjoy, Dash, Nihar Ranjan, Banerjee, Subhashish, Srikanth, R.
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911693243678720
author Dutta, Sanjoy
Dash, Nihar Ranjan
Banerjee, Subhashish
Srikanth, R.
author_facet Dutta, Sanjoy
Dash, Nihar Ranjan
Banerjee, Subhashish
Srikanth, R.
contents Steganography is the art of concealing secret information by embedding it in an apparently innocent-looking message. Quantum steganography applies the principles of quantum mechanics to traditional steganography and, compared to the latter, offers significant advantages, including heightened security, improved concealment, and increased data-hiding capacity. Traditionally, quantum steganography disguises the covert communication as channel noise, which is corrected using preshared classical randomness. This method requires the steganalytic eavesdropper Eve to overestimate the level of channel noise, so that the bounds on the stego channel capacity depend on this assumed gap in Eve's knowledge of the channel. In this work, we point out that by means of preshared quantum entanglement the secret message can be encoded into nonlocal correlations, obviating the need for such an assumption of Eve's ignorance. Consequently, the capacity bounds on the stego channel can then come from the channel capacity of the quantum communication channel. We introduce three such entanglement-based quantum steganographic protocols that make use of catalytic quantum error-correcting codes (QECCs), degenerate entanglement-assisted QECCs, or the phase bit of preshared entanglement. Here catalytic QECCs enable recycling entanglement, while entanglement assistance allows both sender and receiver to contribute to the protocol's secrecy. We derive upper and lower bounds on the secrecy capacity of each protocol, and demonstrate their practical robustness.
format Preprint
id arxiv_https___arxiv_org_abs_2505_15869
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Quantum steganographic protocols using degenerate and entanglement-assisted quantum codes
Dutta, Sanjoy
Dash, Nihar Ranjan
Banerjee, Subhashish
Srikanth, R.
Quantum Physics
Steganography is the art of concealing secret information by embedding it in an apparently innocent-looking message. Quantum steganography applies the principles of quantum mechanics to traditional steganography and, compared to the latter, offers significant advantages, including heightened security, improved concealment, and increased data-hiding capacity. Traditionally, quantum steganography disguises the covert communication as channel noise, which is corrected using preshared classical randomness. This method requires the steganalytic eavesdropper Eve to overestimate the level of channel noise, so that the bounds on the stego channel capacity depend on this assumed gap in Eve's knowledge of the channel. In this work, we point out that by means of preshared quantum entanglement the secret message can be encoded into nonlocal correlations, obviating the need for such an assumption of Eve's ignorance. Consequently, the capacity bounds on the stego channel can then come from the channel capacity of the quantum communication channel. We introduce three such entanglement-based quantum steganographic protocols that make use of catalytic quantum error-correcting codes (QECCs), degenerate entanglement-assisted QECCs, or the phase bit of preshared entanglement. Here catalytic QECCs enable recycling entanglement, while entanglement assistance allows both sender and receiver to contribute to the protocol's secrecy. We derive upper and lower bounds on the secrecy capacity of each protocol, and demonstrate their practical robustness.
title Quantum steganographic protocols using degenerate and entanglement-assisted quantum codes
topic Quantum Physics
url https://arxiv.org/abs/2505.15869