A Steganography Based on Optimal Multi-Threshold Block Labeling

Hiding secret data in digital images is one of the major research fields in information security. Recently, reversible data hiding in encrypted images has attracted extensive attention due to the emergence of cloud services. This paper proposes a novel reversible data hiding method in encrypted images based on an optimal multi-threshold block labeling technique (OMTBL-RDHEI). In our scheme, the content owner encrypts the cover image with block permutation, pixel permutation, and stream cipher, which preserve the in-block correlation of pixel values. After uploading to the cloud service, the data hider applies the prediction error rearrangement (PER), the optimal threshold selection (OTS), and the multi-threshold labeling (MTL) methods to obtain a compressed version of the encrypted image and embed secret data into the vacated room. The receiver can extract the secret, restore the cover image, or do both according to his/her granted authority. The proposed MTL labels blocks of the encrypted image with a list of threshold values which is optimized with OTS based on the features of the current image. Experimental results show that labeling image blocks with the optimized threshold list can efficiently enlarge the amount of vacated room and thus improve the embedding capacity of an encrypted cover image. Security level of the proposed scheme is analyzed and the embedding capacity is compared with state-of-the-art schemes. Both are concluded with satisfactory performance.     

Reversible data hiding for high quality images exploiting interpolation and direction order mechanism

Reversible data hiding can restore the original image from the stego image without any distortion after the embedded secret message is exactly extracted. In this paper, a novel, reversible, data hiding scheme for high quality images is proposed in spatial domain. To increase embedding capacity and enhance image quality, the proposed scheme classifies all pixels as wall pixels and non-wall pixels. For wall pixel, the interpolation error is used to embed secret data over the interpolation prediction method. In contrast, the difference value between the non-wall pixel and its parent pixel, which is defined by the direction order, is computed to hide secret data based on the histogram shifting. The experimental results demonstrate that our scheme provides a larger payload and a better image quality than some existing schemes. Moreover, the performance of the proposed scheme is more stable for different images.     

密文域高嵌入率图像全位面可逆数据隐藏

目的 针对现有的加密域可逆信息隐藏算法未能充分利用图像的全部位平面的问题,提出了一种密文域高嵌入率图像全位面可逆数据隐藏。方法 对载体图像进行加密,然后将隐蔽信息嵌入到加密图像中,进行隐蔽传输,发送给接收者。本文将灰度图像的8个位平面都用来进行数据嵌入,并把每个位平面划分成不重叠的块,分为非连续块（块内像素值0,1都存在）和连续块（块内为全0或全1像素值）,按块进行重排列且将排列前的块标签嵌入到重排列图像中,使用流密码对图像进行加密。在数据嵌入阶段,提出了带修正信息的像素预测方法用于非连续块的嵌入。连续块中,保持块内右下角像素值不变,用于连续块的恢复,其他位置嵌入数据;非连续块中,对预测正确的像素嵌入数据,预测错误的像素保持不变。结果 实验过程实现了多种密文域可逆数据隐藏算法,本文进行大量对比实验,并在BOSSbase和BOWS-2数据集上进行验证,与其他方法比较,本文方法在BOSSbase和BOWS-2数据集上的嵌入率分别提升了42.1%和43.3%。结论 提出的加密图像可逆数据隐藏方案,通过对不同性质的块采用不同方法进行数据嵌入,利用图像全位面信息,使得方案能够获得更高的嵌入率,表明了本文方法的有效性。     

基于同态加密的密文域可逆信息隐藏技术研究

为了提高嵌入容量和实现解密与提取信息的可分离性,文章将希尔伯特曲线和同态加密的特性运用到密文域可逆信息隐藏中。首先,图像拥有者对原始图像进行预处理,并在加密后构造密文镜像点。然后,信息隐藏者通过同态加法对目标像素点进行秘密信息嵌入。最后,接收方不仅可以提取秘密信息,还可以无损地恢复原始图像。实验证明,文章方案不但能够实现解密与提取信息的可分离性,而且在保证图像质量的前提下,最大嵌入容量可达到69120bits.     

结合Kd-树和熵编码的密文图像可逆数据隐藏

目的 密文图像可逆数据隐藏技术既可以保证载体内容不被泄露,又可以传递秘密信息,在军事、医疗等方面发挥着重要的作用。然而,以往的大多数方法存在图像冗余未被充分利用、数据嵌入容量不足等问题。为解决这些问题,提出了一种结合Kd-树和熵编码的高容量密文图像可逆数据隐藏算法。方法 该方法在图像加密之前需要对图像应用中值边缘检测(median-edge detector,MED)算法计算预测误差,并把得到的预测误差绝对值图像划分为两个区域:S0区域和S1区域。根据Kd-树标签算法和熵编码生成辅助信息,在对图像使用加密密钥K_e加密之后嵌入辅助信息,生成加密图像;在秘密数据嵌入阶段,根据附加信息和数据隐藏密钥嵌入秘密数据,生成载密图像;在解密阶段可以根据附加信息、图像加密密钥和数据隐藏密钥提取秘密数据并无损恢复图像。结果 实验测试了BOWS-2(break our watermarking system 2nd)数据集,平均嵌入容量为3.910 bit/像素。与现有的几种方法进行比较,该算法可以获得更高的秘密数据嵌入容量。结论 该方法在图像加密前腾出空间,与相关算法相比,实现了更高的嵌入容量,并且可以实现原始图像的无损恢复。     

Embedding capacity raising in reversible data hiding based on prediction of difference expansion

Most of the proposed methods of reversible data hiding based on difference expansion require location maps to recover cover images. Although the location map can be compressed by a lossless compression algorithm, this lowers embedding capacity and increases computational cost during the procedures of embedding and extracting. The study presents an adaptive reversible data scheme based on the prediction of difference expansion. Since each cover pixel generally resembles its surrounding pixels, most of the difference values between the cover pixels and their corresponding predictive pixels are small; therefore, the proposed scheme gains from embedding capacity by taking full advantage of the large quantities of smaller difference values where secret data can be embedded. The proposed scheme offers several advantages, namely, (1) the location map is no more required, (2) the embedding capacity can be adjusted depending on the practical applications, and (3) the high embedding capacity with minimal visual distortion can be achieved. Moreover, the experimental results demonstrate that the proposed scheme yields high embedding capacity by comparing the related schemes that are proposed recently.     

Lossless data hiding algorithm for encrypted images with high capacity

In this paper, a novel reversible data hiding algorithm for encrypted images is proposed. In encryption phase, chaotic sequence is applied to encrypt the original image. Then the least significant bits (LSBs) of pixels in encrypted image are losslessly compressed to leave place for secret data. With auxiliary bit stream, the lossless compression is realized by the Hamming distance calculation between the LSB stream and auxiliary stream. At receiving terminal, the operation is flexible, that is, it meets the requirement of separation. With the decryption key, a receiver can get access to the marked decrypted image which is similar to the original one. With data-hiding key, the receiver can successfully extract secret data from the marked encrypted image. With both keys, the receiver can get secret data and the exactly original image. Compared with existing methods, experiments show the feasibility and efficiency of the proposed method, especially in aspect of embedding capacity, embedding quality and error-free recovery with increasing payload.     

A high-capacity reversible data hiding scheme based on sorting and prediction in digital images

In this paper, a new reversible data hiding method based on sorting and prediction in digital images is proposed. The proposed method can embed two bits in the 3 × 1 sub-block at maximum by dividing into two groups - min and max groups. The pixel pairs of the min group and max group are firstly predicted and then are modified to embed the secret bits. The reversibility is guaranteed since the order of pixel pairs of the sub-block is not changed after embedding a secret bit into two groups. The experimental results show that the proposed method provides high embedding capacity than the previous works.     

Reversibility of image with balanced fidelity and capacity upon pixels differencing expansion

Reversible data hiding has attracted considerable attention in recent years. Being reversible, the decoder can extract hidden data and recover the original image completely, and the difference expansion (DE) scheme can lead to a lossless pixel after secret data exacting. Furthermore, despite achieving pixel reversibility based on the concept of expanded differencing, the difference expansion scheme can cause enormous image distortion because of the size of the difference. The proposed scheme in this paper describes a novel prediction for achieving predictive error based reversible data hiding by considering the relation between a pixel and its neighboring pixel and using the predictor to identify the projected difference in pixel value. Experimental results show that the proposed scheme is capable of providing great embedding capacity without causing noticeable distortion by selecting the minimal predictor based on pixel expansion. In multilevel cases, this proposed method performs better than other existing methods. Moreover, the proposed scheme is able to pass the Chi-square test, a test used to find whether an image utilizes LSB for data hiding.     

A high capacity reversible data hiding scheme with edge prediction and difference expansion

To enhance the embedding capacity of a reversible data hiding system, in this paper, a novel multiple-base lossless scheme based on JPEG-LS pixel value prediction and reversible difference expansion will be presented. The proposed scheme employs a pixel value prediction mechanism to decrease the distortion caused by the hiding of the secret data. In general, the prediction error value tends to be much smaller in smooth areas than in edge areas, and more secret data embedded in smooth areas still meets better stego-image quality. The multiple-base notational system, on the other hand, is applied to increase the payload of the image. With the system, the payload of each pixel, determined by the complexity of its neighboring pixels, can be very different. In addition, the cover image processed by the proposed scheme can be fully recovered without any distortion. Experimental results, as shown in this paper, have demonstrated that the proposed method is capable of hiding more secret data while keeping the stego-image quality degradation imperceptible.     

Separable reversible data hiding in encrypted images based on flexible preservation of the differences

To better protect the security of users’ private data in the cloud environment, the technology for separable reversible data hiding in encrypted images has been attracting increasing attention from researchers. In this paper, we propose a separable reversible data hiding scheme in encrypted images based on the flexible preservation of differences. This scheme has three parts: 1) For the content owner, the original image is divided into non-overlapping blocks, for which block-mean is computed. Then the differences between the values of every pixel and the block-mean are obtained and an initial label map is generated. Because most of the differences tend to concentrate around 0, we use two bits to dynamically record the range of the differences to vacate space for hiding. Further, introducing the block-mean differences also serves to vacate more space, for which the label map is amended accordingly. Finally, the image with free space is encrypted into the encrypted image using an encryption key. 2) For the data hider, the secret bits are embedded into the encrypted image by directly replacing the spare bits without obtaining any information of the original image. 3) For the receiver, he/she can achieve the desired information according to the key in his/her possession. Experimental results show that our proposed scheme is able to achieve an average embedding capacity as large as 1.785 bpp and 1.709 bpp when block size is set to 2?×?2 and 2?×?4, respectively. Comparison with those of previous schemes, the proposed scheme has excellent embedding capacity, especially for smoother images.

     

基于自适应MSB与差值预测的大容量密文域可逆信息隐藏算法

为提高密文域可逆信息隐藏（reversible data hiding in encrypted images,RDH-EI）的嵌入容量,提出了一种基于自适应MSB（most significant bit）与差值预测的RDH-EI方案。首先将图像进行分块,然后进行块级加密和置乱以抵抗对于加密图像的分析。在嵌入数据阶段,对于自适应MSB预测的方法进行改进,将没有嵌入数据的块,利用部分块内像素之间差值很小的特点采用自适应差值预测的方法嵌入数据,以块中左上角像素为目标像素,用于预测其他像素从而腾出更多的嵌入空间。实验结果表明,所提方法具有可逆性和可分离性,并且在自适应MSB预测方法的基础上进一步提高了嵌入容量,对于512×512大小的灰度图像,平均嵌入容量提高了大约7 445 bit。     

基于图像秘密共享的密文域可逆信息隐藏算法

针对当前密文域可逆信息隐藏算法嵌入秘密信息后的携密密文图像的容错性与抗灾性不强,一旦遭受攻击或损坏就无法重构原始图像与提取秘密信息的问题,提出了一种基于图像秘密共享的密文域可逆信息隐藏算法,并分析了该算法在云环境下的应用场景。首先,将加密图像分割成大小相同的n份不同携密密文图像。然后,在分割的过程中将拉格朗日插值多项式中的随机量作为冗余信息,并建立秘密信息与多项式各项系数间的映射关系。最后,通过修改加密过程的内置参数,实现秘密信息的可逆嵌入。当收集k份携密密文图像时,可无损地恢复原始图像与提取秘密信息。实验结果表明,所提算法具有计算复杂度低、嵌入容量大和完全可逆等特点。在（3,4）门限方案中,所提算法的最大嵌入率可达4 bpp;在（4,4）门限方案中,其最大嵌入率可达6 bpp。所提算法充分发挥了秘密共享方案的容灾特性,在不降低秘密共享安全性的基础上,增强了携密密文图像的容错性与抗灾性,提高了算法的嵌入容量与云环境应用场景下的容灾能力,保证了载体图像与秘密信息的安全。     

Separable reversible data hiding in encrypted images based on scalable blocks

This paper proposes a new separable reversible data hiding method for encrypted images. Proposed scheme employs the pixel redundancy of natural images to construct embedding space. First, cover image is divided into multiple blocks with different scales. According to the pixel average value of each block, the lowest two bits of every pixel are vacated as reserved rooms. Subsequently, the whole image is encrypted by using stream cipher and the secret messages are finally embedded into the reserved rooms by the embedding key. Proposed scheme is separable in the sense that the recipient can achieve different function by the following ways: (a) If the recipient has only decryption key, an approximation plaintext image containing the embedded information can be obtained. (b) If the recipient has only embedded key, secret messages can be extracted correctly. (c) If the recipient has both decryption key and embedded key, he can not only extract the secret messages, but recover the original cover image perfectly. Extensive experiments are performed to show that our proposed schemes outperform existing reversible data hiding schemes in terms of visual quality, embedding capacity and security performance, even if a large-scale image database is used.

     

基于预测误差双重编码的大容量密文域可逆信息隐藏算法

针对目前密文域可逆信息隐藏算法嵌入容量较小的问题,提出了基于预测误差双重编码的大容量密文域可逆可分离信息隐藏算法。首先为了预留秘密信息的嵌入空间,图像拥有者利用基于预测误差的哈夫曼编码及扩展游程编码对图像进行预处理,然后加密图像;数据嵌入者在加密后的图像中嵌入秘密信息;接收者根据信息隐藏密钥可以准确无误地提取秘密信息,根据解密密钥可以无损恢复图像,两者无顺序要求。实验结果表明,预测误差双重编码的应用有效地提高了嵌入容量。     

Prediction-based reversible data hiding

For some applications such as satellite and medical images, reversible data hiding is the best solution to provide copyright protection or authentication. Being reversible, the decoder can extract the hidden data and recover the original image without distortion. In this paper, a reversible data hiding scheme based on prediction error expansion is proposed. The predictive value is computed by using various predictors. The secret data is embedded in the cover image by exploiting the expansion of the difference between a pixel and its predictive value. Experimental results show that our method is capable of providing a great embedding capacity without making noticeable distortion. In addition, the proposed scheme is also applicable to various predictors.     

High-payload completely reversible data hiding in encrypted images by an interpolation technique

We present a new high-payload joint reversible data-hiding scheme for encrypted images. Instead of embedding data in the encrypted image directly, the content owner first uses an interpolation technique to estimate whether the location can be used for embedding and generates a location map before encryption. Next, the data hider embeds the additional data through flipping the most significant bits (MSBs) of the encrypted image according to the location map. At the receiver side, before extracting the additional data and reconstructing the image, the receiver decrypts the image first. Experimental results demonstrate that the proposed method can achieve real reversibility, which means data extraction and image recovery are free of error. Moreover, our scheme can embed more payloads than most existing reversible data hiding schemes in encrypted images.     

基于自适应哈夫曼编码的密文可逆信息隐藏算法

随着云存储和隐私保护的发展,密文域可逆信息隐藏作为一种可以在密文中嵌入秘密信息,保证嵌入后的信息可以无错误提取,并能无损恢复原始明文图像的技术,越来越受到人们的关注.本文提出了一种基于自适应哈夫曼编码的密文域可逆信息隐藏算法,对不同的图像采用不同的哈夫曼码字编码腾出空间来嵌入秘密信息.首先利用自然图像相邻像素间的相关性对原始明文图像进行像素值预测,从最高有效位到最低有效位,对原始像素值和预测像素值的相同比特位进行自适应的哈夫曼编码标记.然后,利用流密码对原始明文图像进行加密.最后在腾出的空间,通过位替换来自适应的嵌入秘密信息.由于哈夫曼编码和解码的可逆性,合法接收者可以对原始明文图像和秘密信息实现分离的无损恢复和提取.实验结果表明,与现有的几种方法相比,本文提出的方法具有更好的安全性和更高的嵌入率,在BOSSBase、BOWS-2和UCID三个数据集上的平均嵌入率比MPHC算法分别提高了0.09bpp、0.062 bpp和0.06bpp,在最佳情况下比MPHC算法能分别高出0.958 bpp、0.797 bpp和0.320 bpp,最差情况下的嵌入率比MPHC算法也分别高出了 0.01 bpp、0.039 bpp和0.061 bpp.     

Reversible data hiding scheme based on neighboring pixel differences

In this paper, we propose a reversible data hiding algorithm for grayscale images. Specifically, our algorithm is based on the histogram modification technique. The premise of this algorithm is that a histogram is constructed from the differences between each pixel and its neighbors. In the data embedding process, a modified histogram shifting scheme is used to embed a secret message into the pixels whose pixel difference is located at the peak value within the histogram. Experimental results show that our algorithm can achieve higher embedding capacity and imperceptible distortion. Performance comparisons with other existing algorithms are also provided to demonstrate the feasibility of our proposed algorithm in reversible data hiding.     

基于码分多址复用的双重加密可逆信息隐藏

针对多数密文域可逆信息隐藏算法嵌入容量小、加密算法单一的问题,提出一种双重加密的方法,并利用码分多址复用（CDMA）的思想嵌入秘密信息。加密时将图像分块,先对像素块进行多粒度置乱加密,再对块中每个像素的中间2位用流密码加密。信息嵌入采用码分多址的思想,选取k个长为4的相互正交的矩阵嵌入k层秘密信息,利用矩阵的正交性实现秘密信息多层嵌入,在提高嵌入容量的同时保证了对像素点的较小改变。对不满足嵌入条件的像素块嵌入伪比特,可避免使用位置图。拥有信息提取密钥的合法接收者可以提取秘密信息;拥有图像解密密钥可以近似恢复原始图像;拥有两种密钥既可提取秘密信息又可无损恢复原始图像。实验结果表明,512×512灰度图像Lena在峰值信噪比（PSNR）大于36 dB时最大嵌入容量133 313 bit。所提算法增强了加密图像安全性,在保证可逆性的同时大大提高密文域可逆信息隐藏嵌入容量。