Diophantine Equations for Enhanced Security in Watermarking Scheme for Image Authentication

2017 ◽  
pp. 205-229
Author(s):  
Padma T ◽  
Jayashree Nair
Keyword(s):  
Diophantine Equation ◽  
Diophantine Equations ◽  
Image Authentication ◽  
Authentication Scheme ◽  
Content Authentication ◽  
Image Content ◽  
Polynomial Time Algorithms ◽  
Mathematical Problems ◽  
Watermarking Scheme

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.

Secure Watermarking using Diophantine Equations for Authentication and Recovery

2015 ◽  
Vol 3 (2) ◽  
Author(s):  
Jayashree Nair ◽  
T. Padma
Keyword(s):  
Diophantine Equation ◽  
Diophantine Equations ◽  
Jpeg Compression ◽  
Authentication Scheme ◽  
Original Image ◽  
Invariant Features ◽  
Jpeg2000 Compression ◽  
Frequency Properties ◽  
Visual Authentication

This paper describes an authentication scheme that uses Diophantine equations based generation of the secret locations to embed the authentication and recovery watermark in the DWT sub-bands. The security lies in the difficulty of finding a solution to the Diophantine equation. The scheme uses the content invariant features of the image as a self-authenticating watermark and a quantized down sampled approximation of the original image as a recovery watermark for visual authentication, both embedded securely using secret locations generated from solution of the Diophantine equations formed from the PQ sequences. The scheme is mildly robust to Jpeg compression and highly robust to Jpeg2000 compression. The scheme also ensures highly imperceptible watermarked images as the spatio –frequency properties of DWT are utilized to embed the dual watermarks.

QUANTIZATION-BASED FRAGILE WATERMARKING USING BLOCK-WISE AUTHENTICATION AND PIXEL-WISE RECOVERY SCHEME FOR TAMPERED IMAGE

2013 ◽  
Vol 13 (02) ◽  
pp. 1340002 ◽  
Author(s):  
DURGESH SINGH ◽  
SHIVENDRA SHIVANI ◽  
SUNEETA AGARWAL
Keyword(s):  
Fragile Watermarking ◽  
Content Authentication ◽  
Image Content ◽  
Recovery Scheme ◽  
Tamper Recovery ◽  
Tampered Image ◽  
Watermarking Scheme ◽  
Content Recovery ◽  
Least Significant Bits

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.

A watermarking scheme based on rotating vector for image content authentication

2019 ◽  
Vol 24 (8) ◽  
pp. 5755-5772
Author(s):  
Jianjing Fu ◽  
Jiafa Mao ◽  
Dawen Xue ◽  
Deren Chen
Keyword(s):  
Content Authentication ◽  
Image Content ◽  
Watermarking Scheme

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
Keyword(s):  
Content Authentication ◽  
Image Content ◽  
Verification Scheme

scholarly journals Comparison of Multicast Algorithm Evaluation Results in Low and High Multicast Saturation Environments

2019 ◽  
Vol 3 ◽  
pp. 3-7
Author(s):  
Krzysztof Stachowiak ◽  
Piotr Zwierzykowski
Keyword(s):  
Quality Of Service ◽  
Computational Complexity ◽  
Optimization Methods ◽  
The Other ◽  
Ongoing Research ◽  
Mathematical Problems ◽  
Point To Point ◽  
Difficult Challenge ◽  
Entire Network

The multicast quality of service-enabled routing is a computationally challenging task. Despite ongoing research efforts, the associated mathematical problems are still considered to be NP-hard. In certain applications, computational complexity of finding the optimal connection between a set of network devices may be a particularly difficult challenge. For example, connecting a small group of participants of a teleconference is not much more complex than setting up a set of mutual point-to-point connections. On the other hand, satisfying the demand for such services as IPTV, with their receivers constituting the majority of the network, requires applying appropriate optimization methods in order to ensure real system execution. In this paper, algorithms solving this class of problems are considered. The notion of multicast saturation is introduced to measure the amount of multicast participants relative to the entire network, and the efficiency of the analyzed algorithms is evaluated for different saturation degrees.

scholarly journals Encryption Based Image Watermarking Algorithm in 2DWT-DCT Domains

Sensors ◽  
2021 ◽  
Vol 21 (16) ◽  
pp. 5540
Author(s):  
Nayeem Hasan ◽  
Md Saiful Islam ◽  
Wenyu Chen ◽  
Muhammad Ashad Kabir ◽  
Saad Al-Ahmadi
Keyword(s):  
Signal To Noise Ratio ◽  
Image Watermarking ◽  
Similarity Index ◽  
Structural Similarity ◽  
Reconstructed Image ◽  
Discrete Wavelet ◽  
Signal To Noise ◽  
Noise Ratio ◽  
Watermarking Scheme

This paper proposes an encryption-based image watermarking scheme using a combination of second-level discrete wavelet transform (2DWT) and discrete cosine transform (DCT) with an auto extraction feature. The 2DWT has been selected based on the analysis of the trade-off between imperceptibility of the watermark and embedding capacity at various levels of decomposition. DCT operation is applied to the selected area to gather the image coefficients into a single vector using a zig-zig operation. We have utilized the same random bit sequence as the watermark and seed for the embedding zone coefficient. The quality of the reconstructed image was measured according to bit correction rate, peak signal-to-noise ratio (PSNR), and similarity index. Experimental results demonstrated that the proposed scheme is highly robust under different types of image-processing attacks. Several image attacks, e.g., JPEG compression, filtering, noise addition, cropping, sharpening, and bit-plane removal, were examined on watermarked images, and the results of our proposed method outstripped existing methods, especially in terms of the bit correction ratio (100%), which is a measure of bit restoration. The results were also highly satisfactory in terms of the quality of the reconstructed image, which demonstrated high imperceptibility in terms of peak signal-to-noise ratio (PSNR ≥ 40 dB) and structural similarity (SSIM ≥ 0.9) under different image attacks.

Sign in / Sign up

Export Citation Format

Share Document