Security evaluation of generalized patchwork algorithm from cryptanalytic viewpoint

Authors:
Tanmoy Kanti Das;Hyoung Joong Kim;Subhamoy Maitra
Affiliations:
Applied Statistics Unit, Indian Statistical Institute, Kolkata, India;Department of Control and Instrumentation Engineering, Kangwon National University, Chunchon, Korea;Applied Statistics Unit, Indian Statistical Institute, Kolkata, India
Venue:
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Year:
2005

Citing 8
Cited 1

Attacks on Copyright Marking Systems

Proceedings of the Second International Workshop on Information Hiding
An Analysis of One of the SDMI Candidates

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Cryptanalysis of Discrete-Sequence Spread Spectrum Watermarks

IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Evaluation of Copyright Marking Systems

ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
A note on the limits of collusion-resistant watermarks

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Cryptanalysis of optimal differential energy watermarking (DEW) and a modified robust scheme

IEEE Transactions on Signal Processing
On the limits of steganography

IEEE Journal on Selected Areas in Communications
Secure spread spectrum watermarking for multimedia

IEEE Transactions on Image Processing

A new load distribution strategy for linear network with communication delays

Mathematics and Computers in Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a cryptanalysis of the generalized patchwork algorithm under the assumption that the attacker possesses only a single copy of the watermarked image. In the scheme, watermark is inserted by modifying randomly chosen DCT values in each block of the original image. Towards the attack we first fit low degree polynomials (which minimize the mean square error) on the data available from each block of the watermarked content. Then we replace the corresponding DCT data of the attacked image by the available data from the polynomials to construct an attacked image. The technique nullifies the modification achieved during watermark embedding. Experimental results show that recovery of the watermark becomes difficult after the attack.