Optimal throughput for covert communication over a classical-quantum channel
Author:
- 27 October 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 364-368
Abstract
This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn with high confidence whether the legitimate parties are using the channel to communicate or not. Specifically, the relative entropy between the output quantum states at the eavesdropper when a codeword is transmitted and when no input is provided must be sufficiently small. Extending earlier works, this paper proves the “square-root law” for a broad class of classical-quantum channels: the maximum amount of information that can be reliably and covertly transmitted over n uses of such a channel scales like √n. The scaling constant is also determined.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Fundamental Limits of Communication With Low Probability of DetectionIEEE Transactions on Information Theory, 2016
- Covert Communication Over Noisy Channels: A Resolvability PerspectiveIEEE Transactions on Information Theory, 2016
- Limits of low-probability-of-detection communication over a discrete memoryless channel2015
- Effective secrecy: Reliability, confusion and stealth2014
- Reliable deniable communication: Hiding messages in noise2013
- From Quasi-Entropy to Various Quantum Information QuantitiesPublications of the Research Institute for Mathematical Sciences, 2012
- Superadditivity of communication capacity using entangled inputsNature Physics, 2009
- On the Existence of Perfect StegosystemsLecture Notes in Computer Science, 2005
- General formulas for capacity of classical-quantum channelsIEEE Transactions on Information Theory, 2003
- The capacity of the quantum channel with general signal statesIEEE Transactions on Information Theory, 1998