Provably secure steganography and the complexity of sampling

Authors:
Christian Hundt;Maciej Liśkiewicz;Ulrich Wölfel
Affiliations:
Institut für Theoretische Informatik, Universität zu Lübeck, Germany;Institut für Theoretische Informatik, Universität zu Lübeck, Germany;Bundesamt für Sicherheit in der Informationstechnik, Bonn, Germany
Venue:
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Year:
2006

Citing 7
Cited 3

Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Provably Secure Steganography

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Improved upper bounds for 3-SAT

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Public-key steganography with active attacks

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Provably secure steganography with imperfect sampling

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
On the limits of steganography

IEEE Journal on Selected Areas in Communications

Grey-box steganography

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Moving steganography and steganalysis from the laboratory into the real world

Proceedings of the first ACM workshop on Information hiding and multimedia security
Grey-box steganography

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent work on theoretical aspects of steganography resulted in the construction of oracle-based stegosystems. It has been shown that these can be made secure against the steganography equivalents of common cryptographic attacks. In this paper we use methods from complexity theory to investigate the efficiency of sampling from practically relevant types of channels. We show that there are channels that cannot be efficiently used in oracle-based stegosystems. By classifying channels based on their usability for stegosystems, we provide a means to select suitable channels for their practical implementation.