A novel reversible data hiding scheme based on difference-histogram modification and optimal EMD algorithm

Nguyen, Thai-Son; Chang, Chin‐Chen; Huynh, Ngoc-Tu

doi:10.1016/j.jvcir.2015.10.008

Cited by 27 publications

(9 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To date, many RDH methods that work with plaintext images have been proposed. The basic ideas of these methods are different expansion (DE) [5,6], histogram shift (HS) [7,8], pixel value ordering (PVO) [9,10] and the modification of prediction errors [11,12]. All of these methods use the spatial correlation and the redundancy of plaintext images to embed additional bits.…”

Section: Introductionmentioning

confidence: 99%

Real-Time Error-Free Reversible Data Hiding in Encrypted Images Using (7, 4) Hamming Code and Most Significant Bit Prediction

Chen

Chang

2019

Symmetry

Self Cite

View full text Add to dashboard Cite

In this paper, a novel, real-time, error-free, reversible data hiding method for encrypted images has been proposed. Based on the (7, 4) Hamming code, we designed an efficient encoding scheme to embed secret data into the least significant bits (LSBs) of the encrypted image. For reversibility, we designed a most significant bit (MSB) prediction scheme that can recover a portion of the modified MSBs after the image is decrypted. These MSBs can be modified to accommodate the additional information that is used to recover the LSBs. After embedding the data, the original image can be recovered with no error and the secret data can be extracted from both the encrypted image and the decrypted image. The experimental results proved that compared with existing methods, the proposed method can achieve higher embedding rate, better quality of the marked image and less execution time of data embedding. Therefore, the proposed method is suitable for real-time applications in the cloud.

show abstract

Section: Introductionmentioning

confidence: 99%

Real-Time Error-Free Reversible Data Hiding in Encrypted Images Using (7, 4) Hamming Code and Most Significant Bit Prediction

Chen

Chang

2019

Symmetry

Self Cite

View full text Add to dashboard Cite

show abstract

“…For each value of m (i.e., 3, 4, 5, 6, 7), the value of T gradually increases from a sufficiently small value of 1 to 50 at most with step size of 1 until the Equation (17) is not satisfied. For each combination (m, T) that satisfies Equation (17), we can obtain the PER by using Equation (16). Finally, we select an optimal combination (m, T) to achieve the maximum PER of an image.…”

Section: Parameters Of Maximum Embedding Ratementioning

confidence: 99%

“…Based on the DE method, some improved reversible data hiding algorithms were proposed in [10][11][12][13]. Another classic reversible data-hiding algorithm is histogram shifting (HS) [14][15][16][17][18][19][20][21]. HS methods aim to generate a sharp histogram by counting pixel values [14], pixel difference [15,16], or prediction errors [17][18][19][20][21].…”

Section: Introductionmentioning

confidence: 99%

Reversible Data Hiding in Encrypted Image Based on Multi-MSB Embedding Strategy

Wang

Zhang

et al. 2020

Applied Sciences

View full text Add to dashboard Cite

In this paper, a reversible data hiding method in encrypted image (RDHEI) is proposed. Prior to image encryption, the embeddable pixels are selected from an original image according to prediction errors due to adjacent pixels with strong correlation. Then the embeddable pixels and the other pixels are both rearranged and encrypted to generate an encrypted image. Secret bits are directly embedded into the multiple MSBs (most significant bit) of the embeddable pixels in the encrypted image to generate a marked encrypted image during the encoding phase. In the decoding phase, secret bits can be extracted from the multiple MSBs of the embeddable pixels in the marked encrypted image. Moreover, the original embeddable pixels are restored losslessly by using correlation of the adjacent pixels. Thus, a reconstructed image with high visual quality can be obtained only when the encryption key is available. Since exploiting multiple MSBs of the embeddable pixels, the proposed method can obtain a very large embedding capacity. Experimental results show that the proposed method is able to achieve an average embedding rate as large as 1.7215 bpp (bits per pixel) for the BOW-2 database.Nowadays, RDHEI has received increasing attention in the research community, in which both the original image and secret data need to be protected. In RDHEI, image encryption and data embedding are accomplished by different users separately. The content-owner first encrypts the original image to a noise-like one according to encryption key, then the data hider embeds secret data into the encrypted image using a data-hiding key without knowing its original content. The receiver can perform different operations according to the available keys. This can be applied in many scenarios such as Cloud storage, medical image management system.In general, RDHEI can be divided into two categories, namely, vacating room after encryption (VRAE) [22][23][24][25][26][27][28][29][30][31] or reserving room before encryption (RRBE) [32][33][34][35][36][37][38][39]. Puech et al. [22] used an AES (advanced encryption standard) encryption algorithm to encrypt the original image, and then randomly selected a location in each 4×4 pixel block to embed the secret bits. In order to extract secret bits during the decryption phase, they performed a local standard deviation analysis of the marked image. The embedding rate (ER) of this method is very small, i.e., only 0.0625 bpp. Zhang [23] encrypted the original image using the stream cipher firstly and then divided the encrypted image into blocks and each pixel block was divided into two parts. In one part, the three LSBs of each pixel were flipped to embed a secret bit. On the receiver side, a fluctuation function was designed for data extraction and image recovery. Yu et al. [24] improves the method of Zhang et al. [23], so that the visual quality of decrypted images is improved. Wu et al.[25] adopted a prediction error to introduce two RDH methods in the encryption domain, namely, joint method and separable method. In or...

show abstract

“…Nguyen et al [8] proposed a new reversible hiding scheme based on optimal exploiting modification direction matrix to embed large amount of secrets without causing distortion to images. Advantages of the scheme includes increased secret embedding capacity and prevention of image quality.…”

Section: G Ulutas Et Al [7]mentioning

confidence: 99%

A Novel Scheme for Image Authentication and Secret Data Sharing

Lone¹,

Lone²,

Uddin³

2016

IJCNIS

View full text Add to dashboard Cite

Privacy protection is of extreme importance especially in security sensitive environments. Neither cryptography nor steganography comes up with ultimate solution for privacy preservation in open systems. However, combination of steganography and cryptography can greatly increase the security of communication and is usually considered a good practice for securing security driven communication environments. In this paper we propose a novel scheme for image authentication and secret data sharing based on three level security model viz: Compression, steganography and cryptography. Compression optimizes the resource usage, steganography conceals the existence of message and cryptography is used to achieve confidentiality and authentication.

show abstract

A novel reversible data hiding scheme based on difference-histogram modification and optimal EMD algorithm

Cited by 27 publications

References 26 publications

Real-Time Error-Free Reversible Data Hiding in Encrypted Images Using (7, 4) Hamming Code and Most Significant Bit Prediction

Real-Time Error-Free Reversible Data Hiding in Encrypted Images Using (7, 4) Hamming Code and Most Significant Bit Prediction

Reversible Data Hiding in Encrypted Image Based on Multi-MSB Embedding Strategy

A Novel Scheme for Image Authentication and Secret Data Sharing

Contact Info

Product

Resources

About