Steganography protocols for quantum channels

From MaRDI portal
Publication:5141002

DOI10.1063/5.0004731zbMATH Open1454.81045arXiv1907.09602OpenAlexW3080305991MaRDI QIDQ5141002FDOQ5141002


Authors: Mehrdad Tahmasbi, Matthieu Bloch Edit this on Wikidata


Publication date: 17 December 2020

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1907.09602




Recommendations



Cites Work


Cited In (14)





This page was built for publication: Steganography protocols for quantum channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5141002)