Digital rights management techniques for H.264 video

This work aims to present a number of low-complexity digital rights management (DRM) methodologies for the H.264 standard. Initially, requirements to enforce DRM are analyzed and understood. Based on these requirements, a framework is constructed which puts forth different possibilities that can be explored to satisfy the objective. To implement computationally efficient DRM methods, watermarking and content based copy detection are then chosen as the preferred methodologies. The first approach is based on robust watermarking which modifies the DC residuals of 4×4 macroblocks within I-frames. Robust watermarks are appropriate for content protection and proving ownership. Experimental results show that the technique exhibits encouraging rate-distortion (R-D) characteristics while at the same time being computationally efficient. The problem of content authentication is addressed with the help of two methodologies: irreversible and reversible watermarks. The first approach utilizes the highest frequency coefficient within 4×4 blocks of the I-frames after CAVLC en- tropy encoding to embed a watermark. The technique was found to be very effect- ive in detecting tampering. The second approach applies the difference expansion (DE) method on IPCM macroblocks within P-frames to embed a high-capacity reversible watermark. Experiments prove the technique to be not only fragile and reversible but also exhibiting minimal variation in its R-D characteristics. The final methodology adopted to enforce DRM for H.264 video is based on the concept of signature generation and matching. Specific types of macroblocks within each predefined region of an I-, B- and P-frame are counted at regular intervals in a video clip and an ordinal matrix is constructed based on their count. The matrix is considered to be the signature of that video clip and is matched with longer video sequences to detect copies within them. Simulation results show that the matching methodology is capable of not only detecting copies but also its location within a longer video sequence. Performance analysis depict acceptable false positive and false negative rates and encouraging receiver operating charac- teristics. Finally, the time taken to match and locate copies is significantly low which makes it ideal for use in broadcast and streaming applications

Security issues on digital watermarking algorithms

This paper gives a general introduction to the digital watermarking procedures and their security aspects. The first issue is to clarify unifying and differentiating properties of steganography and watermarking. Then the most important aspects of digital watermarking are reviewed by studying application, requirement and design problems. We put emphasis on the importance of digital watermark as an effective technology to protect intellectual property rights and legitimate use of digital images. In the paper we provide an overview of the most popular digital watermarking methods for still images available today. The watermarking algorithms are divided into two major categories of spatial and transform domains. Because of outstanding robustness and imperceptibility the transform domain algorithms are the mainstream of research. Popular transforms of images include the DFT (Discrete Fourier Transform) ([1, 2, 3, 4, 5]), DCT (Discrete Cosine Transform) ([1, 3, 6, 5]) and DWT (Discrete Wavelet Transform) ([1, 3, 4, 7, 6, 5]). In the paper we emphasize the advantageous features of DWT such as local time-frequency and multi-scale analysis, preserving the quality of host image and ensuring high robustness of watermark. Finally, we present three algorithms which are based on the combination of DWT and some other transformations like DFT ([4]), DCT ([6]) and the Arnold transform ([7, 6]). Finally, we discuss security requirements and possible attacks on the watermarking systems

A Survey on Image Encryption and Decryption using Blowfish & Watermarking

Internet means International Network. In the present era, to send and receive information, the internet is the main media. This information may be text, audio, graphics and video etc. There are many advantages of internet. Internet provides quickest data delivery services, security of data is major concern for all internet users. There is always a sense of insecurity amongst internet user after sending data or image until he gets an acknowledgment from the opposite side informing that they have received the data safely, that too without any manipulation in its content. The confidentiality, non-repudiation, validation, reliability, of the information (data or image) should be checked properly otherwise data manipulation can have big problem. We can get these objectives with cryptography which is simply the science of securing sensitive and confidential information as it is stored on media or transmitted through communication network paths. Here, images are considered with an aim to secure them during its storage and transmission. Blowfish Algorithm, a type of symmetric key cryptography is the best solution for this. The two processes, encryption and decryption together form the cryptographic process. For ensuring security, the images are encrypted by the sender before transmitting them and are decrypted by the receiver after receiving them so that only the sender and the intended person can see the content in the image. The blowfish algorithm is safe against unauthorized attack and runs faster than the popular accessible algorithms. For double protection, after the blowfish process, the encrypted image tends to go through a water marking process which is used to hide a secret or personal message to protect a products copyright or to demonstrate data integrity Watermarking is the process of embedding new data into image, audio or video. We perform watermarking on different types of images say JPEG, BMP etc. The anticipated work is designed and implemented using MATLAB. DOI: 10.17762/ijritcc2321-8169.150516

Design and Analysis of Reversible Data Hiding Using Hybrid Cryptographic and Steganographic approaches for Multiple Images

Data concealing is the process of including some helpful information on images. The majority of sensitive applications, such sending authentication data, benefit from data hiding. Reversible data hiding (RDH), also known as invertible or lossless data hiding in the field of signal processing, has been the subject of a lot of study. A piece of data that may be recovered from an image to disclose the original image is inserted into the image during the RDH process to generate a watermarked image. Lossless data hiding is being investigated as a strong and popular way to protect copyright in many sensitive applications, such as law enforcement, medical diagnostics, and remote sensing. Visible and invisible watermarking are the two types of watermarking algorithms. The watermark must be bold and clearly apparent in order to be visible. To be utilized for invisible watermarking, the watermark must be robust and visibly transparent. Reversible data hiding (RDH) creates a marked signal by encoding a piece of data into the host signal. Once the embedded data has been recovered, the original signal may be accurately retrieved. For photos shot in poor illumination, visual quality is more important than a high PSNR number. The DH method increases the contrast of the host picture while maintaining a high PSNR value. Histogram equalization may also be done concurrently by repeating the embedding process in order to relocate the top two bins in the input image's histogram for data embedding. It's critical to assess the images after data concealment to see how much the contrast has increased. Common picture quality assessments include peak signal to noise ratio (PSNR), relative structural similarity (RSS), relative mean brightness error (RMBE), relative entropy error (REE), relative contrast error (RCE), and global contrast factor (GCF). The main objective of this paper is to investigate the various quantitative metrics for evaluating contrast enhancement. The results show that the visual quality may be preserved by including a sufficient number of message bits in the input photographs

Digital watermarking and novel security devices

EThOS - Electronic Theses Online ServiceGBUnited Kingdo

A secure audio steganography approach

A wide range of steganography techniques has been described in this paper. Beside the evaluation of embedding parameters for the existing techniques, two problems -weaknesses- of substitution techniques are investigated which if they could be solved, the large capacity - strength- of substitution techniques would be practical. Furthermore, a novel, principled approach to resolve the problems is presented. Using the proposed genetic algorithm, message bits are embedded into multiple, vague and higher LSB layers, resulting in increased robustness

An Adaptive Spread Spectrum (SS) Synchronous Data Hiding Strategy for Scalable 3D Terrain Visualization

International audienceThe diversity of clients in today's network environment compels us to think about solutions that more than satisfy their needs according to their resources. For 3D terrain visualization this translates into two main requirements, namely the scalability and synchronous unification of a disparate data that requires at least two files, the texture image and its corresponding digital elevation model (DEM). In this work the scalability is achieved through the multiresolution discrete wavelet transform (DWT) of the JPEG2000 codec. For the unification of data, a simple DWT-domain spread spectrum (SS) strategy is employed in order to synchronously hide the DEM in the corresponding texture while conserving the JPEG2000 standard file format. Highest possible quality texture is renderable due to the reversible nature of the SS data hiding. As far as DEM quality is concerned, it is ensured through the adaptation of synchronization in embedding that would exclude some highest frequency subbands. To estimate the maximum tolerable error in the DEM according to a given viewpoint, a human visual system (HVS) based psycho-visual analysis is being presented. This analysis is helpful in determining the degree of adaptation in synchronization