Share Email Print
cover

Proceedings Paper

Security analysis of robust data-hiding with geometrically structured codebooks
Author(s): E. Topak; Sviatoslav Voloshynovskiy; Oleksiy Koval; M. K. Mihcak; Thierry Pun
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In digital media transfer, geometrical transformations desynchronize the communications between the encoder and the decoder. Therefore, an attempt to decode the message based on the direct output of the channel with random geometrical state fails. The main goal of this paper is to analyze the conditions of reliable communications based on structured codebooks in channels with geometrical transformations. Structured codebooks include codewords that have some features or statistics designed for synchronization purposes. In the design of capacity approaching data-hiding codes, host interference problem should be resolved. The solution to this problem is to perform the message coding based on random binning dependent on host-state. On the other hand, to achieve robustness to geometrical transformations, the codewords should have host independent statistics and encoding should be performed using random coding. To satisfy these conflicting requirements we propose Multiple Access Channel (MAC) framework where the message is split between two encoders designed based on the random binning and random coding principles. The message encoded according to random coding additionally serves for synchronization purposes. Sequentially, all existing methods that are proposed for reliable communications in channels with geometrical transformations are analyzed within the proposed MAC set-up. Depending on the particular codebook design, we classify these methods into two main groups: template-based codebooks and redundant codebooks. Finally, we perform the analysis of security leaks of each codebook structure in terms of complexity of the worst case attack.

Paper Details

Date Published: 21 March 2005
PDF: 12 pages
Proc. SPIE 5681, Security, Steganography, and Watermarking of Multimedia Contents VII, (21 March 2005); doi: 10.1117/12.586278
Show Author Affiliations
E. Topak, Univ. of Geneva (Switzerland)
Sviatoslav Voloshynovskiy, Univ. of Geneva (Switzerland)
Oleksiy Koval, Univ. of Geneva (Switzerland)
M. K. Mihcak, Microsoft Corp. (United States)
Thierry Pun, Univ. of Geneva (Switzerland)


Published in SPIE Proceedings Vol. 5681:
Security, Steganography, and Watermarking of Multimedia Contents VII
Edward J. Delp; Ping W. Wong, Editor(s)

© SPIE. Terms of Use
Back to Top