Pixel grouping of digital images for reversible data hiding

Pixel Grouping (PG) of digital images has been a key consideration in recent development of the Reversible Data Hiding (RDH) schemes. While a PG kernel with neighborhood pixels helps compute image groups for better embedding rate-distortion performance, only horizontal neighborhood pixel group of size 1×3 has so far been considered. In this paper, we formulate PG kernels of sizes 3×1, 2×3 and 3×2 and investigate their effect on the rate-distortion performance of a prominent PG-based RDH scheme. Specially, a kernel of size 3×2 (or 2×3) that creates a pair of pixel-trios having triangular shape and offers a greater possible correlation among the pixels. This kernel thus can be better utilized for improving a PG-based RDH scheme. Considering this, we develop and present an improved PG-based RDH scheme and the computational models of its key processes. Experimental results demonstrated that our proposed RDH scheme offers reasonably better  embedding rate-distortion performance than the original scheme

AN EFFECTIVE REVERSIBLE DATA HIDING METHOD BASED ON PIXEL-VALUE-ORDERING

This paper presents a new effective reversible data hiding method based on pixel-value-ordering (iGePVO-K) which is improvement of a recent GePVO-K method that recently is considered as a PVO-used method having highest embedding capacity. In comparison with GePVO-K method, iGePVO-K has the following advantages. First, the embedding capacity of the new method is higher than that of GePVO-K method by using data embedding formulas reasonably and reducing the location map size. Second, for embedding data, in the new method, each pixel value is modified at most by one, while in GePVO-K method, each pixel value may be modified by two. In fact, in the GePVO-K method, the largest pixels are modified by two for embedding bits 1 and by one for bits 0. This is also true for the smallest pixels. Meanwhile, in the proposed method, the largest pixels are modified by one for embedding bits 1 and are unchanged if embedding bits 0. Therefore, the stego-image quality in proposed method is better than that in GePVO-K method. Theoretical analysis and experiment results show that the proposed method has higher embedding capacity and better stego image quality than GePVO-K method

A Survey on Recent Reversible Watermarking Techniques

Watermarking is a technique to protect the copyright of digital media such as image, text, music and movie. Reversible watermarking is a technique in which watermark can be removed to completely restore the original image. Reversible watermarking of digital content allows full extraction of the watermark along with the complete restoration of the original image. For the last few years, reversible watermarking techniques are gaining popularity due to its applications in important and sensitive areas like military communication, healthcare, and law-enforcement. Due to the rapid evolution of reversible watermarking techniques, a latest review of recent research in this field is highly desirable. In this survey, the performances of different latest reversible watermarking techniques are discussed on the basis of various characteristics of watermarking

Reversible Data Hiding scheme using modified Histogram Shifting in Encrypted Images for Bio-medical images

Existing Least Significant Bit (LSB) steganography system is less robust and the stego-images can be corrupted easily by attackers. To overcome these problems Reversible data hiding (RDH) techniques are used. RDH is an efficient way of embedding confidential message into a cover image. Histogram expansion and histogram shifting are effective techniques in reversible data hiding. The embedded message and cover images can be extracted without any distortion. The proposed system focuses on implementation of RDH techniques for hiding data in encrypted bio-medical images without any loss. In the proposed techniques the bio-medical data are embedded into cover images by reversible data hiding technique. Histogram expansion and histogram shifting have been used to extract cover image and bio- medical data. Each pixel is encrypted by public key of Paillier cryptosystem algorithm. The homomorphic multiplication is used to expand the histogram of the image in encrypted domain. The histogram shifting is done based on the homomorphic addition and adjacent pixel difference in the encrypted domain. The message is embedded into the host image pixel difference. On receiving encrypted image with additional data, the receiver using his private key performs decryption. As a result, due to histogram expansion and histogram shifting embedded message and the host image can be recovered perfectly. The embedding rate is increased in host image than in existing scheme due to adjacency pixel difference

Reversible Data Hiding scheme using modified Histogram Shifting in Encrypted Images for Bio-medical images

Existing Least Significant Bit (LSB) steganography system is less robust and the stego-images can be corrupted easily by attackers. To overcome these problems Reversible data hiding (RDH) techniques are used. RDH is an efficient way of embedding confidential message into a cover image. Histogram expansion and histogram shifting are effective techniques in reversible data hiding. The embedded message and cover images can be extracted without any distortion. The proposed system focuses on implementation of RDH techniques for hiding data in encrypted bio-medical images without any loss. In the proposed techniques the bio-medical data are embedded into cover images by reversible data hiding technique. Histogram expansion and histogram shifting have been used to extract cover image and bio- medical data. Each pixel is encrypted by public key of Paillier cryptosystem algorithm. The homomorphic multiplication is used to expand the histogram of the image in encrypted domain. The histogram shifting is done based on the homomorphic addition and adjacent pixel difference in the encrypted domain. The message is embedded into the host image pixel difference. On receiving encrypted image with additional data, the receiver using his private key performs decryption. As a result, due to histogram expansion and histogram shifting embedded message and the host image can be recovered perfectly. The embedding rate is increased in host image than in existing scheme due to adjacency pixel difference

Generalized PVO‐based dynamic block reversible data hiding for secure transmission using firefly algorithm

In this paper, we proposed a novel generalized pixel value ordering–based reversible data hiding using firefly algorithm (GPVOFA). The sequence of minimum and maximum number pixels value has been used to embed the secret data while prediction and modification are held on minimum, and the maximum number of pixel blocks is used to embed the secret data into multiple bits. The host image is divided into the size of noncoinciding dynamic blocks on the basis of firefly quadtree partition, whereas rough blocks are divided into a larger size; moreover, providing more embedding capacity used small flat blocks size and optimal location in the block to write the information. Our proposed method becomes able to embed large data into a host image with low distortion. The rich experimental results are better, as compared with related preceding arts

Reversible Data Hiding with a New Local Contrast Enhancement Approach

Reversible data hiding schemes hide information into a digital image and simultaneously increase its contrast. The improvements of the different approaches aim to increase the capacity, contrast, and quality of the image. However, recent proposals contrast the image globally and lose local details since they use two common methodologies that may not contribute to obtaining better results. Firstly, to generate vacancies for hiding information, most schemes start with a preprocessing applied to the histogram that may introduce visual distortions and set the maximum hiding rate in advance. Secondly, just a few hiding ranges are selected in the histogram, which means that just limited contrast and capacity may be achieved. To solve these problems, in this paper, a novel approach without preprocessing performs an automatic selection of multiple hiding ranges into the histograms. The selection stage is based on an optimization process, and the iterative-based algorithm increases capacity at embedding execution. Results show that quality and capacity values overcome previous approaches. Additionally, visual results show how greyscale values are better differentiated in the image, revealing details globally and locally

A novel robust reversible watermarking scheme for protecting authenticity and integrity of medical images

It is of great importance in telemedicine to protect authenticity and integrity of medical images. They are mainly addressed by two technologies, which are region of interest (ROI) lossless watermarking and reversible watermarking. However, the former causes biases on diagnosis by distorting region of none interest (RONI) and introduces security risks by segmenting image spatially for watermark embedding. The latter fails to provide reliable recovery function for the tampered areas when protecting image integrity. To address these issues, a novel robust reversible watermarking scheme is proposed in this paper. In our scheme, a reversible watermarking method is designed based on recursive dither modulation (RDM) to avoid biases on diagnosis. In addition, RDM is combined with Slantlet transform and singular value decomposition to provide a reliable solution for protecting image authenticity. Moreover, ROI and RONI are divided for watermark generation to design an effective recovery function under limited embedding capacity. Finally, watermarks are embedded into whole medical images to avoid the risks caused by segmenting image spatially. Experimental results demonstrate that our proposed lossless scheme not only has remarkable imperceptibility and sufficient robustness, but also provides reliable authentication, tamper detection, localization and recovery functions, which outperforms existing schemes for protecting medical image

Privacy-preserving information hiding and its applications

The phenomenal advances in cloud computing technology have raised concerns about data privacy. Aided by the modern cryptographic techniques such as homomorphic encryption, it has become possible to carry out computations in the encrypted domain and process data without compromising information privacy. In this thesis, we study various classes of privacy-preserving information hiding schemes and their real-world applications for cyber security, cloud computing, Internet of things, etc. Data breach is recognised as one of the most dreadful cyber security threats in which private data is copied, transmitted, viewed, stolen or used by unauthorised parties. Although encryption can obfuscate private information against unauthorised viewing, it may not stop data from illegitimate exportation. Privacy-preserving Information hiding can serve as a potential solution to this issue in such a manner that a permission code is embedded into the encrypted data and can be detected when transmissions occur. Digital watermarking is a technique that has been used for a wide range of intriguing applications such as data authentication and ownership identification. However, some of the algorithms are proprietary intellectual properties and thus the availability to the general public is rather limited. A possible solution is to outsource the task of watermarking to an authorised cloud service provider, that has legitimate right to execute the algorithms as well as high computational capacity. Privacypreserving Information hiding is well suited to this scenario since it is operated in the encrypted domain and hence prevents private data from being collected by the cloud. Internet of things is a promising technology to healthcare industry. A common framework consists of wearable equipments for monitoring the health status of an individual, a local gateway device for aggregating the data, and a cloud server for storing and analysing the data. However, there are risks that an adversary may attempt to eavesdrop the wireless communication, attack the gateway device or even access to the cloud server. Hence, it is desirable to produce and encrypt the data simultaneously and incorporate secret sharing schemes to realise access control. Privacy-preserving secret sharing is a novel research for fulfilling this function. In summary, this thesis presents novel schemes and algorithms, including: • two privacy-preserving reversible information hiding schemes based upon symmetric cryptography using arithmetic of quadratic residues and lexicographic permutations, respectively. • two privacy-preserving reversible information hiding schemes based upon asymmetric cryptography using multiplicative and additive privacy homomorphisms, respectively. • four predictive models for assisting the removal of distortions inflicted by information hiding based respectively upon projection theorem, image gradient, total variation denoising, and Bayesian inference. • three privacy-preserving secret sharing algorithms with different levels of generality