One-Time Hash Steganography
In this paper we first generalize the steganography system model
which Christian Cachin proposed, and specialize it to be suitable for
computer oriented steganography systems.
Download this paper in PostScript format or gzipped PostScript format.
Based on this model, we introduce a new perfectly secure steganography scheme,
one-time hash steganography, with which one can hide a secret bit
cover-data that satisfies certain condition (partial recomputability).
we prove that
there exists a perfectly secure steganography system with given cover-data source if and only if
the cover-data source is partially recomputable to its sender.
This paper is copyrighted by Springer-Verlag.
Last modified: Tue Mar 14 02:13:35 JST 2000