A Lightweight Privacy Preserved Buyer Seller Watermarking Protocol Based on Priced Oblivious Transfer

replacing traditional selling of digital products (such as songs, videos,movies, software, books, documents, images, etc.) through shops. This mode of sale can bring the product price down as infrastructure cost in setting up shops and retail chain is reduced. On downside, however, this may increase problem of piracy as digital data can be easily copied, manipulated and transmitted. To protect copyright of owner, establish right of buyer on purchased copy and yet check data piracy, it is required that a rusted e-distribution system be built. Such a system should be able to ensure secure transaction between buyer and seller, check ownership and track the origin of unauthorized copies..The buyer seller watermarking protocols are heavyweight protocols.These protocols require large computation power and network bandwidth.The heavyweight protocols could not be used for the resource constrained devices since the devices does not support battery power.A lightweight protocol has been proposed which is best suited for the resource constrained devices. The protocol is based on a fast asymmetric encryption with novel simplification.In this approach the seller authenticates the buyer but does not learn which items are purchased. The protocol is designed in such a way that the buyers pay the right price without disclosing the purchased item, and the sellers are able to identify buyers that released pirated copies. The protocol is constructed based on the priced oblivious transfer and the existing techniques for asymmetric watermark embedding. Index Terms- Buyer–seller watermarking protocol, fair exchange, priced oblivious transfer (POT). B I

A New Copyright Protection for Vector Map using FFT-based Watermarking

This study proposed a new approach of copyright protection for vector map using robust watermarking on FFT algorithm. A copyright marker inserted in vector map as the watermark. In addition to data origin authentication capabilities watermark, RSA cryptographic algorithm is used when generating the watermark. Quality measurement of the results was based on the three characteristics of digital watermarking: (1) invisibility using RMSE calculations, (2) fidelity with the farthest distance and (3) NC calculation and gemotrical level of robustness against attacks. Result of experiments showed that the approach used in this study succeeded in inserting copyright as watermark on vector maps. Invisibility test showed good results, demonstrated by RMSE close to zero. Fidelity of the watermarked map was also maintained. Level of watermark robustness against geometric attacks on vector map results has been maintained within the limits that these attacks do not affect the watermark bit value directly

An Asymmetric Public Detection Watermarking Technique

International audienceThe new watermarking technique presented in this paper is an example of an asymmetric public detection scheme

Improved digital watermarking schemes using DCT and neural techniques

The present thesis investigates the copyright protection by utilizing the digital watermarking of images. The basic spatial domain technique DCT based frequency based technique were studied and simulated. Most recently used Neural Network based DCT Scheme is also studied and simulated. The earlier used Back Propagation Network (BPN) is replaced by Radial Basis Function Neural Network (RBFNN) in the proposed scheme to improve the robustness and overall computation requirements. Since RBFNN requires less number of weights during training, the memory requirement is also less as compared to BPN. Keywords : Digital Watermarking, Back Propagation Network (BPN), Hash Function, Radial Basis Function Neural Network (RBFNN), and Discrete Cosine Transform (DCT). Watermarking can be considered as a special technique of steganography where one message is embedded in another and the two messages are related to each other in some way. The most common examples of watermarking are the presence of specific patterns in currency notes, which are visible only when the note is held to light, and logos in the background of printed text documents. The watermarking techniques prevent forgery and unauthorized replication of physical objects. In digital watermarking a low-energy signal is imperceptibly embedded in another signal. The low-energy signal is called the watermark and it depicts some metadata, like security or rights information about the main signal. The main signal in which the watermark is embedded is referred to as the cover signal since it covers the watermark. In recent years the ease with which perfect copies can be made has lead large-scale unauthorized copying, which is a great concern to the music, film, book and software publishing industries. Because of this concern over copyright issues, a number of technologies are being developed to protect against illegal copying. One of these technologies is the use of digital watermarks. Watermarking embeds an ownership signal directly into the data. In this way, the signal is always present with the data. Analysis Digital watermarking techniques were implemented in the frequency domain using Discrete Cosine Transform (DCT). The DCT transforms a signal or image from the spatial domain to the frequency domain. Also digital watermarking was implemented using Neural Networks such as: 1. Back Propagation Network (BPN) 2. Radial Basis Function Neural Network (RBFNN) Digital watermarking using RBFNN was proposed which improves both security and robustness of the image. It is based on the Cover’s theorem which states that nonlinearly separable patterns can be separated linearly if the pattern is cast nonlinearly into a higher dimensional space. RBFNN contains an input layer, a hidden layer with nonlinear activation functions and an output layer with linear activation functions. Results The following results were obtained:- 1. The DCT based method is more robust than that of the LSB based method in the tested possible attacks. DCT method can achieve the following two goals: The first is that illegal users do not know the location of the embedded watermark in the image. The second is that a legal user can retrieve the embedded watermark from the altered image. 2. The RBFNN network is easier to train than the BPN network. The main advantage of the RBFNN over the BPN is the reduced computational cost in the training stage, while maintaining a good performance of approximation. Also less number of weights are required to be stored or less memory requirements for the verification and testing in a later stage

Printed document integrity verification using barcode

Printed documents are still relevant in our daily life and information in it must be protected from threats and attacks such as forgery, falsification or unauthorized modification. Such threats make the document lose its integrity and authenticity. There are several techniques that have been proposed and used to ensure authenticity and originality of printed documents. But some of the techniques are not suitable for public use due to its complexity, hard to obtain special materials to secure the document and expensive. This paper discuss several techniques for printed document security such as watermarking and barcode as well as the usability of two dimensional barcode in document authentication and data compression with the barcode. A conceptual solution that are simple and efficient to secure the integrity and document sender's authenticity is proposed that uses two dimensional barcode to carry integrity and authenticity information in the document. The information stored in the barcode contains digital signature that provides sender's authenticity and hash value that can ensure the integrity of the printed document

Dynamic block encryption with self-authenticating key exchange

One of the greatest challenges facing cryptographers is the mechanism used for key exchange. When secret data is transmitted, the chances are that there may be an attacker who will try to intercept and decrypt the message. Having done so, he/she might just gain advantage over the information obtained, or attempt to tamper with the message, and thus, misguiding the recipient. Both cases are equally fatal and may cause great harm as a consequence. In cryptography, there are two commonly used methods of exchanging secret keys between parties. In the first method, symmetric cryptography, the key is sent in advance, over some secure channel, which only the intended recipient can read. The second method of key sharing is by using a public key exchange method, where each party has a private and public key, a public key is shared and a private key is kept locally. In both cases, keys are exchanged between two parties. In this thesis, we propose a method whereby the risk of exchanging keys is minimised. The key is embedded in the encrypted text using a process that we call `chirp coding', and recovered by the recipient using a process that is based on correlation. The `chirp coding parameters' are exchanged between users by employing a USB flash memory retained by each user. If the keys are compromised they are still not usable because an attacker can only have access to part of the key. Alternatively, the software can be configured to operate in a one time parameter mode, in this mode, the parameters are agreed upon in advance. There is no parameter exchange during file transmission, except, of course, the key embedded in ciphertext. The thesis also introduces a method of encryption which utilises dynamic blocks, where the block size is different for each block. Prime numbers are used to drive two random number generators: a Linear Congruential Generator (LCG) which takes in the seed and initialises the system and a Blum-Blum Shum (BBS) generator which is used to generate random streams to encrypt messages, images or video clips for example. In each case, the key created is text dependent and therefore will change as each message is sent. The scheme presented in this research is composed of five basic modules. The first module is the key generation module, where the key to be generated is message dependent. The second module, encryption module, performs data encryption. The third module, key exchange module, embeds the key into the encrypted text. Once this is done, the message is transmitted and the recipient uses the key extraction module to retrieve the key and finally the decryption module is executed to decrypt the message and authenticate it. In addition, the message may be compressed before encryption and decompressed by the recipient after decryption using standard compression tools

Spread spectrum-based video watermarking algorithms for copyright protection

Merged with duplicate record 10026.1/2263 on 14.03.2017 by CS (TIS)Digital technologies know an unprecedented expansion in the last years. The consumer can now benefit from hardware and software which was considered state-of-the-art several years ago. The advantages offered by the digital technologies are major but the same digital technology opens the door for unlimited piracy. Copying an analogue VCR tape was certainly possible and relatively easy, in spite of various forms of protection, but due to the analogue environment, the subsequent copies had an inherent loss in quality. This was a natural way of limiting the multiple copying of a video material. With digital technology, this barrier disappears, being possible to make as many copies as desired, without any loss in quality whatsoever. Digital watermarking is one of the best available tools for fighting this threat. The aim of the present work was to develop a digital watermarking system compliant with the recommendations drawn by the EBU, for video broadcast monitoring. Since the watermark can be inserted in either spatial domain or transform domain, this aspect was investigated and led to the conclusion that wavelet transform is one of the best solutions available. Since watermarking is not an easy task, especially considering the robustness under various attacks several techniques were employed in order to increase the capacity/robustness of the system: spread-spectrum and modulation techniques to cast the watermark, powerful error correction to protect the mark, human visual models to insert a robust mark and to ensure its invisibility. The combination of these methods led to a major improvement, but yet the system wasn't robust to several important geometrical attacks. In order to achieve this last milestone, the system uses two distinct watermarks: a spatial domain reference watermark and the main watermark embedded in the wavelet domain. By using this reference watermark and techniques specific to image registration, the system is able to determine the parameters of the attack and revert it. Once the attack was reverted, the main watermark is recovered. The final result is a high capacity, blind DWr-based video watermarking system, robust to a wide range of attacks.BBC Research & Developmen

Modified algorithm for image watermarking using 2D-DCT and elgamal cryptosystem / Nur Azien Yazid, Kamilah Abdullah and Suhaila Abd Halim

Image watermarking embeds identifying information in an image in such a manner that it cannot easily be removed. For the past several years, image digital watermarking has become a necessary element used for hid ing secret image and enabling secured communication such as privacy, confidentiality, authentication and data integrity. Although numerous watermarking schemes are present in grayscale images, the present work focuses on the RGB color image. This study proposed a new hybrid method that would satisfy the essential needs of modern image watermarking. The color image watermarking is based on the 2D Discrete Cosine Transform and Egamal cryptosystem.The 2D Discrete Cosine Transform depends on the matrix products, while the ElGamal cryptosystem depends on the discrete logarithm problem. The cryptosystem is combined with existing Arnold transform in watermarking algorithm to enhance the security of secret image. Value of Peak Signal to Noise Ratio was taken as performance evaluation parameters. On the whole, the performance evaluation shows that combining the two algorithms improved the performance of image watermarking