Audio watermarking using transformation techniques

Watermarking is a technique, which is used in protecting digital information like images, videos and audio as it provides copyrights and ownership. Audio watermarking is more challenging than image watermarking due to the dynamic supremacy of hearing capacity over the visual field. This thesis attempts to solve the quantization based audio watermarking technique based on both the Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT). The underlying system involves the statistical characteristics of the signal. This study considers different wavelet filters and quantization techniques. A comparison is performed on diverge algorithms and audio signals to help examine the performance of the proposed method. The embedded watermark is a binary image and different encryption techniques such as Arnold Transform and Linear Feedback Shift Register (LFSR) are considered. The watermark is distributed uniformly in the areas of low frequencies i.e., high energy, which increases the robustness of the watermark. Further, spreading of watermark throughout the audio signal makes the technique robust against desynchronized attacks. Experimental results show that the signals generated by the proposed algorithm are inaudible and robust against signal processing techniques such as quantization, compression and resampling. We use Matlab (version 2009b) to implement the algorithms discussed in this thesis. Audio transformation techniques for compression in Linux (Ubuntu 9.10) are applied on the signal to simulate the attacks such as re-sampling, re-quantization, and mp3 compression; whereas, Matlab program for de-synchronized attacks like jittering and cropping. We envision that the proposed algorithm may work as a tool for securing intellectual properties of the musicians and audio distribution companies because of its high robustness and imperceptibility

An enhanced method based on intermediate significant bit technique for watermark images

Intermediate Significant Bit digital watermarking technique (ISB) is a new approved technique of embedding a watermark by replacing the original image pixels with new pixels. This is done by ensuring a close connection between the new pixels and the original, and at the same time, the watermark data can be protected against possible damage. One of the most popular methods used in watermarking is the Least Significant Bit (LSB). It uses a spatial domain that includes the insertion of the watermark in the LSB of the image. The problem with this method is it is not resilient to common damage, and there is the possibility of image distortion after embedding a watermark. LSB may be used through replacing one bit, two bits, or three bits; this is done by changing the specific bits without any change in the other bits in the pixel. The objective of this thesis is to formulate new algorithms for digital image watermarking with enhanced image quality and robustness by embedding two bits of watermark data into each pixel of the original image based on ISB technique. However, to understand the opposite relationship between the image quality and robustness, a tradeoff between them has been done to create a balance and to acquire the best position for the two embedding bits. Dual Intermediate Significant Bits (DISB) technique has been proposed to solve the existing LSB problem. Trial results obtained from this technique are better compared with the LSB based on the Peak Signal to Noise Ratio (PSNR) and Normalized Cross Correlation (NCC). The work in this study also contributes new mathematical equations that can study the change on the other six bits in the pixel after embedding two bits

Data Hiding and Its Applications

Data hiding techniques have been widely used to provide copyright protection, data integrity, covert communication, non-repudiation, and authentication, among other applications. In the context of the increased dissemination and distribution of multimedia content over the internet, data hiding methods, such as digital watermarking and steganography, are becoming increasingly relevant in providing multimedia security. The goal of this book is to focus on the improvement of data hiding algorithms and their different applications (both traditional and emerging), bringing together researchers and practitioners from different research fields, including data hiding, signal processing, cryptography, and information theory, among others

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

Public street surveillance: A psychometric study on the perceived social risk

Public street surveillance, a domain of Closed Circuit Television (CCTV), has grown enormously and is becoming common place with increasing utilization in society as an all-purpose security tool. Previous authors (Ditton, 1999; Davies, 1998; Horne, 1998; Tomkins, 1998) have raised concern over social, civil and privacy issues, but there has been limited research to quantify these concerns. There are a number of core aspects that could relocate the risk perception and therefore, social support of public street surveillance. This study utilized the psychometric paradigm to quantitatively measure the social risk perception of public street surveillance. The psychometric paradigm is a method that presents risk perception in a two factor representation, being dread risk and familiarity to risk. Four additional control activities and technologies were tested, being radioactive waste, drinking water chlorination, coal mining disease and home swimming pools. Analysis included spatial representation, and multidimensional scaling (MDS) Euclidean and INDSCAL methods. The study utilized a seven point Likert scale, pre and post methodology, and had a target population of N=2106, with a sample of N=135 (alpha=0.7)

Side-Informed Steganography for JPEG Images by Modeling Decompressed Images

Side-informed steganography has always been among the most secure approaches in the field. However, a majority of existing methods for JPEG images use the side information, here the rounding error, in a heuristic way. For the first time, we show that the usefulness of the rounding error comes from its covariance with the embedding changes. Unfortunately, this covariance between continuous and discrete variables is not analytically available. An estimate of the covariance is proposed, which allows to model steganography as a change in the variance of DCT coefficients. Since steganalysis today is best performed in the spatial domain, we derive a likelihood ratio test to preserve a model of a decompressed JPEG image. The proposed method then bounds the power of this test by minimizing the Kullback-Leibler divergence between the cover and stego distributions. We experimentally demonstrate in two popular datasets that it achieves state-of-the-art performance against deep learning detectors. Moreover, by considering a different pixel variance estimator for images compressed with Quality Factor 100, even greater improvements are obtained.Comment: 13 pages, 7 figures, 1 table, submitted to IEEE Transactions on Information Forensics & Securit

Fractal-based models for internet traffic and their application to secure data transmission

This thesis studies the application of fractal geometry to the application of covert communications systems. This involves the process of hiding information in background noise; the information being encrypted or otherwise. Models and methods are considered with regard to two communications systems: (i) wireless communications; (ii) internet communications. In practice, of course, communication through the Internet cannot be disassociated from wireless communications as Internet traffic is 'piped' through a network that can include wireless communications (e.g. satellite telecommunications). However, in terms of developing models and methods for covert communications in general, points (i) and (ii) above require different approaches and access to different technologies. With regard to (i) above, we develop two methods based on fractal modulation and multi-fractal modulation. With regard to (ii), we implement a practical method and associated software for covert transmission of file attachments based on an analysis of Internet traffic noise. In both cases, however, two fractal models are considered; the first is the standard Random Scaling Fractal model and the second is a generalisation of this model that incorporates a greater range of spectral properties than the first—a Generalised Random Scaling Fractal Model. [Continues.