Grey-box steganography

DOI10.1016/j.tcs.2012.03.037zbMath1302.94054OpenAlexW2176705981MaRDI QIDQ393133

Maciej Liśkiewicz, Ulrich Wölfel, K. Ruediger Reischuk

Publication date: 16 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.037

zbMATH Keywords

learning complexitycovertext channelgrey-box steganographysampling complexity

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items

On the gold standard for security of universal steganography, Security levels in steganography -- insecurity does not imply detectability, On the universal steganography of optimal rate, Proper learning of \(k\)-term DNF formulas from satisfying assignments

Uses Software

• C4.5

Cites Work

• An information-theoretic model for steganography
• Upper and lower bounds on black-box steganography
• Random generation of combinatorial structures from a uniform distribution
• Learning decision trees from random examples
• The Prisoners’ Problem and the Subliminal Channel
• Efficient noise-tolerant learning from statistical queries
• Advances in Cryptology - EUROCRYPT 2004
• Provably Secure Steganography and the Complexity of Sampling
• Theory of Cryptography
• Automata, Languages and Programming
• Public Key Cryptography - PKC 2006
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item