Share Email Print

Proceedings Paper

Wet paper codes with improved embedding efficiency
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Construction of steganographic schemes in which the sender and the receiver do not share the knowledge about the location of embedding changes requires wet paper codes. Steganography with non-shared selection channels empowers the sender as now he is able to embed secret data by utilizing arbitrary side information, including a high-resolution version of the cover object (perturbed quantization steganography), local properties of the cover (adaptive steganography), and even pure randomness, e.g., coin flipping, for public key steganography. In this paper, we propose a new approach to wet paper codes using random linear codes of small codimension that at the same time improves the embedding efficiency-the number of message bits embedded per embedding change. We describe a practical algorithm, test its performance experimentally, and compare the results to theoretically achievable bounds. We point out an interesting ripple phenomenon that should be taken into account by practitioners. The proposed coding method can be modularly combined with most steganographic schemes to allow them to use non-shared selection channels and, at the same time, improve their security by decreasing the number of embedding changes.

Paper Details

Date Published: 16 February 2006
PDF: 12 pages
Proc. SPIE 6072, Security, Steganography, and Watermarking of Multimedia Contents VIII, 607215 (16 February 2006); doi: 10.1117/12.640110
Show Author Affiliations
Jessica Fridrich, SUNY Binghamton (United States)
Miroslav Goljan, SUNY Binghamton (United States)
David Soukal, SUNY Binghamton (United States)

Published in SPIE Proceedings Vol. 6072:
Security, Steganography, and Watermarking of Multimedia Contents VIII
Edward J. Delp III; Ping Wah Wong, Editor(s)

© SPIE. Terms of Use
Back to Top