A one-time stegosystem and applications to efficient covert communication

DOI10.1007/S00145-012-9135-4zbMath1350.94043arXiv0909.3658OpenAlexW2071597046MaRDI QIDQ2442646

Alexander Russell, Aggelos Kiayias, Narasimha Shashidhar, Yona Raekow

Publication date: 1 April 2014

Published in: Journal of Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

covertext distributions with constant min-entropyfirst information-theoretic steganographic protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

On the gold standard for security of universal steganography ⋮ On the universal steganography of optimal rate

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• An information-theoretic model for steganography
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Number-theoretic constructions of efficient pseudo-random functions
• Simple Constructions of Almost k-wise Independent Random Variables
• Provably Secure Steganography
• The Prisoners’ Problem and the Subliminal Channel
• Advances in Cryptology - EUROCRYPT 2004

This page was built for publication: A one-time stegosystem and applications to efficient covert communication