Print ISSN: 1681-6900

Online ISSN: 2412-0758

Keywords : watermark

Encrypted Image Watermark in Audio Files Using Homogenous Deffie-Hellman with Chebyshev Polynomial

Hala B. Abdul Wahab; Abdul-Mohssen J. Abdul-Hossen; Sana Ahmed Kadhom

Engineering and Technology Journal, 2016, Volume 34, Issue 6, Pages 894-900

Due to the expanding utilization of advanced media, the assurance of protected innovation rights issue has turned into an essential issue. Digital watermarking is currently drawing consideration as another technique for shielding media content from unapproved duplicating. In this paper, watermarking image (logo) will be encrypted using a key constructed by a proposed homogenous method of Diffie-Hellman and chebyshev polynomial. The encrypted watermark will be embedded in different samples from the transformed file (DCT) of audio. The embedding process will depend on binary similarity between the audio and watermark bits which reduces the effect of embedded data. The proposed method for the key generation is more secure and complicated since it combines the strength factors of both Diffie-Hellman and Chebyshev polynomial. The effect of the embedding is nonperceptibile and nondetectable.

Watermarking for Relational Database by using Threshold Generator

Bashar Saadoon Mahdi; Yossra H. Ali

Engineering and Technology Journal, 2011, Volume 29, Issue 1, Pages 33-43

Providing ownership on relational database is a crucial issue in today
internet-based application environments and in many content distribution
applications.This paper provides the effective watermarking technique to protect
valuable numeric relational data from illegal duplications and redistributions as
well as to claim ownership,the robustness of proposed system depending on using
new hybrid techniques ,first technique MAC(Message Authentication Code) that
used one way hash function SHA1 ,second technique is threshold generator base
on simple combination of odd number of register and by using secret key in
proposed system. Detecting the watermark neither requires access to neither the
original data nor the watermark. The watermark can be detected even in a small
subset of a watermarked relation as long as the sample contains some of the marks.
The finally stage is the analysis of technique that used, our extensive analysis
shows that the proposed technique is robust against various forms of malicious
attacks and updates to the data