A Novel Verification Scheme for Watermarking Based Image Content Authentication Systems

2008 ◽  
Vol 67 (19) ◽  
pp. 1777-1790 ◽  
Author(s):  
C. Cruz-Ramos ◽  
R. Reyes-Reyes ◽  
J. Mendoza-Noriega ◽  
Mariko Nakano-Miyatake ◽  
Hector Manuel Perez-Meana
2013 ◽  
Vol 13 (02) ◽  
pp. 1340002 ◽  
Author(s):  
DURGESH SINGH ◽  
SHIVENDRA SHIVANI ◽  
SUNEETA AGARWAL

This paper suggests an efficient fragile watermarking scheme for image content authentication along with altered region restoration capability. In this scheme, image is divided into nonoverlapping blocks of size 2 × 2 and for each block, eight bits for image content recovery data and four bits for authentication data from five most significant bits (MSBs) of each pixel, are generated. These 12 bits are embedded into the least significant bits (LSBs) of the pixels which are placed in its corresponding mapping block. At the receiver end by comparing the recalculated and extracted authentication data, the tampered blocks can easily be identified and using recovery data, one can easily restore the tampered block. Results of experiments demonstrate that the proposed scheme is effective enough for alteration detection as well as tamper recovery of the image.


Author(s):  
Li Weng ◽  
Geert Braeckman ◽  
Ann Dooms ◽  
Bart Preneel ◽  
Peter Schelkens

Author(s):  
Padma T ◽  
Jayashree Nair

Hard mathematical problems having no polynomial time algorithms to determine a solution are seemly in design of secure cryptosystems. The proposed watermarking system used number theoretic concepts of the hard higher order Diophantine equations for image content authentication scheme with three major phases such as 1) Formation of Diophantine equation; 2) Generation and embedding of dual Watermarks; and 3) Image content authentication and verification of integrity. Quality of the watermarked images, robustness to compression and security are bench-marked with two peer schemes which used dual watermarks.


Sign in / Sign up

Export Citation Format

Share Document