Covert Communication With Polynomial Computational Complexity

DOI10.1109/TIT.2019.2955987MaRDI QIDQ5123791zbMATH OpenOpenAlexFDO

Authors Qiaosheng Zhang, Mayank Bakshi, Sidharth Jaggi

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2019.2955987

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(2)

• Covert two-party computation
• Universal Covertness for Discrete Memoryless Sources

This page was built for publication: Covert Communication With Polynomial Computational Complexity

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