Bandwidth optimal steganography secure against adaptive chosen stegotext attacks

Authors:
Tri Van Le;Kaoru Kurosawa
Affiliations:
Department of Computer Science, Florida State University, Tallahassee, Florida;Department of Computer and Information Sciences, Ibaraki University, Nakanarusawa, Hitachi, Ibaraki, Japan
Venue:
IH'06 Proceedings of the 8th international conference on Information hiding
Year:
2006

Citing 6
Cited 1

A universal algorithm for homophonic coding

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Provably Secure Steganography

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
An Information-Theoretic Approach to Steganography and Watermarking

IH '99 Proceedings of the Third International Workshop on Information Hiding
The method of types [information theory]

IEEE Transactions on Information Theory
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide construction of steganographic schemes secure against adaptive chosen stegotext attacks. Our constructions achieve embedding rate equals to the Shannon entropy bound on steganographic channel capacity. Further the covertext distribution can be given as either an integrable probability function or as a random covertext sampler. We also introduce steganographic codes that are of interests in constructing other steganographic protocols such as steganographic secret sharing or steganographic distributed computations.