Reversible Data Hiding Scheme with High Embedding Capacity Using Semi-Indicator-Free Strategy

A novel reversible data-hiding scheme is proposed to embed secret data into a side-matched-vector-quantization- (SMVQ-) compressed image and achieve lossless reconstruction of a vector-quantization- (VQ-) compressed image. The rather random distributed histogram of a VQ-compressed image can be relocated to locations close to zero by SMVQ prediction. With this strategy, fewer bits can be utilized to encode SMVQ indices with very small values. Moreover, no indicator is required to encode these indices, which yields extrahiding space to hide secret data. Hence, high embedding capacity and low bit rate scenarios are deposited. More specifically, in terms of the embedding rate, the bit rate, and the embedding capacity, experimental results show that the performance of the proposed scheme is superior to those of the former data hiding schemes for VQ-based, VQ/SMVQ-based, and search-order-coding- (SOC-) based compressed images

A Survey on Data Hiding and Compression Schemes

ABSTRACT: Data hiding has a vital role to play in information security. Using a data hiding technique, secret information is hidden into cover digital content. Compression techniques and data hiding techniques received much less attention from the research community and from industry than cryptography. In past research many data hiding and image compression techniques has been developed, it works independent module in both sender and server side. These method cause low efficiency, less security and also the low bit rate scheme requires more time to encode. Both image compression and data hiding (EJDHC) using residual codebooks with side match vector quantization (SMVQ). In this survey is to discuss on data hiding schemas and compression techniques such as JPEG, JPEG 2000, vector quantization, VQ compression and SMVQ. KEYWORDS: Data hiding, image compression, side match vector quantization I.INTRODUCTION Data hiding is a process to hide data into cover media. The data hiding process links two sets of data and a set of the embedded data and another set of the cover media data. The relationship between these two sets of data characterizes different applications. In authentication phase embedded data are closely related to the cover media. High Data hiding in images [1] 8-bit grayscale images are selected as the cover media called as cover images. Cover images with the secret messages embedded in the images. For data hiding methods, the image quality refers to the quality of the images. Most of the hiding techniques is based on manipulating the least-signi7cant-bit (LSB) planes by directly replacing the LSBs of the cover image with the message bits. LSB methods typically achieve high capacity. Another technique introduced in Data hiding [6] also can be classified into three domains, namely, spatial, transformative, and compression. In the spatial domain each pixel in the cover image is modified to hide the secret information. In the transformative domain the cover image is transformed into coefficients using well-known transform techniques the integer wavelet transform and the integer discrete cosine transform. Then to embed the secret information, these coefficients are altered. In the compression domain, the cover image is compressed to save the storage and the bandwidth space of the embedded image. Then, the image-compressed codes are processed to hide the secret information. Many image-compressed data hiding schemes have been noted in the literature because the sizes of the compressed images will be much smaller than those of the original images before and after data hiding. Various compression techniques JPEG block truncatio

Bit Plane Coding Based Steganography Technique for JPEG2000 Images and Videos

In this paper, a Bit Plane Coding (BPC) based steganography technique for JPEG2000 images and Motion JPEG2000 video is proposed. Embedding in this technique is performed in the lowest significant bit planes of the wavelet coefficients of a cover image. In JPEG2000 standard, the number of bit planes of wavelet coefficients to be used in encoding is dependent on the compression rate and are used in Tier-2 process of JPEG2000. In the proposed technique, Tier-1 and Tier-2 processes of JPEG2000 and Motion JPEG2000 are executed twice on the encoder side to collect the information about the lowest bit planes of all code blocks of a cover image, which is utilized in embedding and transmitted to the decoder. After embedding secret data, Optimal Pixel Adjustment Process (OPAP) is applied on stego images to enhance its visual quality. Experimental results show that proposed technique provides large embedding capacity and better visual quality of stego images than existing steganography techniques for JPEG2000 compressed images and videos. Extracted secret image is similar to the original secret image

Paperless Transfer of Medical Images: Storing Patient Data in Medical Images

Medical images have become an integral part ofpatient diagnosis in recent years. With the introduction of HealthInformation Management Systems (HIMS) used for the storageand sharing of patient data, as well as the use of the PictureArchiving and Communication Systems (PACS) formanipulating and storage of CT Scans, X-rays, MRIs and othermedical images, the security of patient data has become a seriousconcern for medical professionals. The secure transfer of theseimages along with patient data is necessary for maintainingconfidentiality as required by the Data Protection Act, 2011 inTrinidad and Tobago and similar legislation worldwide. Tofacilitate this secure transfer, different digital watermarking andsteganography techniques have been proposed to safely hideinformation in these digital images. This paper focuses on theamount of data that can be embedded into typical medical imageswithout compromising visual quality. In addition, ExploitingModification Direction (EMD) is selected as the method of choicefor hiding information in medical images and it is compared tothe commonly used Least Significant Bit (LSB) method.Preliminary results show that by using EMD there little to nodistortion even at the highest embedding capacity

Reversible Data Hiding using Visual Cryptography: A Review

ABSTRACT: Data security and data integrity are the two challenging areas for research. There are so many research is progressing on the field like internet security, steganography, cryptography. Data hiding are a group of techniques used to put a secure data in a host media with small deterioration in host and the means to extract the secure data afterwards. Reversible data hiding is a technique to embed additional message into some distortion-unacceptable cover media, such as military or medical images, with a reversible manner so that the original cover content can be perfectly restored after extraction of the hidden message. The reversibility means not only embedding data but also original image can be precisely recovered in the extracting stage. Most hiding techniques perform data embedding by altering the contents of a host media. These types of data hiding techniques are thus irreversible. However in a number of domains such as military, legal and medical imaging although some embedding distortion is admissible, permanent loss of signal fidelity is undesirable. This highlights the need for Reversible (Lossless) data embedding techniques. This paper gives a review on various reversible data hiding techniques and also proposes a novel approach for reversible data hiding using visual cryptography. This involves no use of keys thus keeping the computation cost for encryption/decryption low. This scheme applies a method of vacating the room for data prior to the image encryption used to hide the secret data. By reversing the order of encryption and data hiding we overcome the difficulty of finding the room for data from already encrypted image

A DATA HIDING SCHEME BASED ON CHAOTIC MAP AND PIXEL PAIRS

Information security is one of the most common areas of study today. In the literature, there are many algorithms developed in the information security. The Least Significant Bit (LSB) method is the most known of these algorithms. LSB method is easy to apply however it is not effective on providing data privacy and robustness. In spite of all its disadvantages, LSB is the most frequently used algorithm in literature due to providing high visual quality. In this study, an effective data hiding scheme alternative to LSB, 2LSBs, 3LSBs and 4LSBs algorithms (known as xLSBs), is proposed. In this method, random numbers which are to be used as indices of pixels of the cover image are obtained from chaotic maps and data hiding process is applied on the values of these pixels by using modulo function. Calculated values are embedded in cover image as hidden data. Success of the proposed data hiding scheme is assessed by Peak Signal-to-Noise Ratio (PSNR), payload capacity and quality

Using a Novel Variable Block Size Image Compression Algorithm for Hiding Secret Data

This paper presents a data hiding scheme that hides the data in the compression domain of a digital image. A quadtree decomposition algorithm decomposes the host image into blocks of variable sizes according to histogram analysis of the block residuals. Variable block sizes are then encoded at different rates based on their visual activity levels. The majority of secrete data are embedded into the smooth area of the image, while a small portion of the secret data are hidden in the compression codes of the high detailed blocks. Experimental results confirm that the proposed scheme can embed a large amount of data in the compressed file while maintaining satisfactory image quality

Information Hiding in Lossy Compression Gray Scale Image

[[abstract]]We propose an information hiding technique which based on pixels’ block. We used pixels contractive relation to hide the information that we want to embed. The characteristic of our method is that to use pixels contractive relation to assist lossy compression process in reducing the image size. There exists many hiding techniques, but most of the techniques cannot tolerate the destruction of lossy compression. Compression will speed up the transmission of the image with the hiding data.We achieve something others cannot do, to implement compression into the transmission of images in order to speed up the process. Besides, in our method it is easy to hide and extract the hiding data when implemented.We show that our method can extract the data efficiently and correctly, even with JPEG (Joint Picture Expert Group) compression. Our proposed technique tallies with the transmitted image on the Internet and it is a secure and efficient method.[[notice]]補正完畢[[incitationindex]]E

Deja Q: Using Dual Systems to Revisit q-Type Assumptions

After more than a decade of usage, bilinear groups have established their place in the cryptographic canon by enabling the construction of many advanced cryptographic primitives. Unfortunately, this explosion in functionality has been accompanied by an analogous growth in the complexity of the assumptions used to prove security. Many of these assumptions have been gathered under the umbrella of the uber-assumption, yet certain classes of these assumptions -- namely, q-type assumptions -- are stronger and require larger parameter sizes than their static counterparts. In this paper, we show that in certain groups, many classes of q-type assumptions are in fact implied by subgroup hiding (a well-established, static assumption). Our main tool in this endeavor is the dual-system technique, as introduced by Waters in 2009. As a case study, we first show that in composite-order groups, we can prove the security of the Dodis-Yampolskiy PRF based solely on subgroup hiding and allow for a domain of arbitrary size (the original proof only allowed a polynomially-sized domain). We then turn our attention to classes of q-type assumptions and show that they are implied -- when instantiated in appropriate groups -- solely by subgroup hiding. These classes are quite general and include assumptions such as q-SDH. Concretely, our result implies that every construction relying on such assumptions for security (e.g., Boneh-Boyen signatures) can, when instantiated in appropriate composite-order bilinear groups, be proved secure under subgroup hiding instead