A HYBRID REVERSIBLE DATA

HIDING SCHEMES FOR ENCRYPTED

IMAGES USING IMAGE SHARING
TECHNIQUES

ABSTRACT

This paper proposes a lossless, a reversible, and a

combined data hiding schemes for ciphertext images
encrypted by public key cryptosystems with probabilistic
and homomorphic properties.
In the lossless scheme, the ciphertext pixels are replaced
with new values to embed the additional data into several
LSB-planes of ciphertext pixels by multi-layer wet paper
coding.
Then, the embedded data can be directly extracted from
the encrypted domain, and the data embedding operation
does not affect the decryption of original plaintext image.

OBJECTIVES

To propose a lossless, a reversible, and a combined data hiding

schemes for ciphertext images encrypted by public key
cryptosystems with probabilistic and homomorphic properties.
To embed the additional datas into the encrypted images in
reversible and lossless mode of Data hiders.
To extract the embedded data directly extracted from the
encrypted domain.

To extract the additional data from the plaintext domain.

To recover the original plaintext image without any error.

EXISTING SYSTEM

In Lossy compression of encrypted image by

compressing sensing technique a compressive sensing
mechanism is introduced to achieve the lossy
compression of encrypted images, and a basis pursuit
algorithm is used to enable joint decompression and
decryption.
In the Lossy compression and iterative reconstruction
for encrypted image the original gray image is
encrypted by pixel permutation; then, the encrypted
data are compressed by discarding the excessively rough
and fine information of coefficients generated from
orthogonal transform.

EXISTING DRAWBACKS

The ratedistortion performance in Lossy compression

of encrypted image by compressing sensing technique
is low, and there is a leakage of statistical information.
In Lossy compression and iterative reconstruction for
encrypted image since only the pixel positions are
shuffled and the pixel values are not asked in the
encryption phase.
The problem in existing scheme is that data is highly
sensitive to noise and is easily destroyed. Furthermore,
image quality may be degraded by the watermark

PROPOSED SYSTEM

This paper proposes a lossless, a reversible, and a combined

data hiding schemes for public-key-encrypted images by
exploiting the probabilistic and homomorphic properties of
cryptosystems.
With these schemes, the pixel division/reorganization is
avoided and the encryption/decryption is performed on the
cover pixels directly, so that the amount of encrypted data and
the computational complexity are lowered.
In the lossless scheme, due to the probabilistic property,
although the data of encrypted image are modified for data
embedding, a direct decryption can still result in the original
plaintext image while the embedded data can be extracted in
the encrypted domain.

PROPOSED SYSTEM BLOCK DIAGRAM

Input
Image

Image
Encryption

Encrypted
Image

Image
Decryption

Reconstructed
Image

Data Hiding

Data
Embedded
Image

Data
Extraction

Extracted
data

PROPOSED SYSTEM TECHNIQUE

LOSSLESS DATA HIDING SCHEME
REVERSIBLE DATA HIDING SCHEME

PROPOSED SYSTEM ADVANTAGES

The recovered image quality is high.
The data embedding operation does not affect the
decryption of original plaintext image.
The original plaintext image can be recovered without
any error.
Act as a robust scheme.
The amount of encrypted data and the computational
complexity are lowered

SOFTWARE REQUIREMENTS

MATLAB 7.14 Version R2012

APPLICATIONS
Data Protection from Hackers
Copyright protection
Used in scenarios such as securely sharing secret
images