REVERSIBLE DATA HIDING IN ENCRYPTED IMAGE

Kailasam Selvaraj Joel Abraham A Lourdu Arul Ruban P

Department of InformationTechnology,
Kalasalingam Academy of Research
and Institution
Anand Nagar, Krishnankoil,
Tamilnadu.
s.kailasam@klu.ac.in
Department of InformationTechnology,
Kalasalingam Academy of Research
and Institution
Anand Nagar, Krishnankoil, Tamilnadu
joelabraham175@gmail.com
Department of InformationTechnology,
Kalasalingam Academy of Research
and Institution
Anand Nagar, Krishnankoil, Tamilnadu
brockruban@gmail.com

Manoj Kumar G Shankar Dayan S

Department of InformationTechnology,
Kalasalingam Academy of Research
and Institution
Anand Nagar, Krishnankoil, Tamilnadu
manojselvam82@gmail.com
Department of InformationTechnology,
Kalasalingam Academy of Research
and Institution
Anand Nagar, Krishnankoil,Tamilnadu
shankardayan5552@gmail.com

.Abstract: RDH is used to hide secret information within
some multimedia files.This data hiding is used for medical
or military instruction. In this project, we create a web-
based application for military network. In that application,
commander will add soldier details. if any messages are
transfered into soldier means, commander will send the
request to image provider. Because they need image to hide
the content into that image. Image provider will send the
image with encrypted format and secret key(shared one
key) using cryptographic algorithm. Then commander will
send the messages as encrypted format inside that
encrypted image. If the soldier will login to the site, they
give private key and secret key. If the keys are matched
then image and hidden messages are decrypted and they
get original messages.So this project is used to secure
information in military network.
Keywords:
Least Significant Bit (LSB), Reversible Data Hiding
(RDH), Payload, Data Bit Embedding, Steganography
I. INTRODUCTION
"New Reversible Information Hidden in Encrypted Image
Based on Multiple Secret Sharing and Lightweight Encryption
Algorithms" is a research paper that proposes a new approach
to reverse information hidden in encrypted images. The
proposed method combines multi-secret sharing and
lightweight encryption algorithms to provide a secure and
efficient solution for hiding recoverable information in
encrypted images.
The research paper provides a detailed overview of the
proposed approach and its implementation using ASP.NET, a
web app framework developed by Microsoft. ASP.NET
provides a robust and scalable platform for developing web
applications and is widely used by developers around the
world.
The proposed approach is designed to address the limitations
of existing reversible data hiding techniques, such as the
inability to input large amounts of data or the need for the
original image to be available for data extraction. Using
multiple secret sharing and lightweight encryption algorithms,
the proposed approach provides a secure and efficient solution
to hide the reversible information of encrypted images.
Overall, the study fully presents the proposed approach and its
implementation using ASP.NET. The proposed approach can
be a valuable tool for developers and researchers involved in
information security and image processing.
II. LITERATURE REVIEW
Reversible data hiding in encrypted images using private
sharing Signal data Processing, vol. 143, pp. 269–281, 2021.
X. Wu, J. Weng, and W. Yan. In this study, we encrypted
pictures is substituted for secret sharing. First, a fundamental
paradigm for reversible data hiding in encrypted images
using secret sharing is presented. A suggested image
encryption algorithm then makes use of Shamir's secret
sharing. The suitability of the shares produced by the
suggested encryption method for data embedding is
supported by theoretical analysis. Finally, two fundamental
approaches utilising difference histogram shifting and
difference expansion are presented along with some
extensions. Experimental findings are used to show the
benefits of the suggested approaches, including their high
embedding and low computational complexity.
Mirroring the ciphertext group enables reversible data
concealment in a homomorphic restated sphere.X. Luo and S.
Xiang pages. 3099–3110 in IEEE Deals on Circuits and
Systems for Video Technology, vol. 28, no. 11, 2021 a novel
RDH strategy was proposed by restated images which makes
use of the homomorphic and probabilistic Paillier
cryptosystem parcels. To create space for data impacted, the
proposed system randomly names and reversibly beds groups
of contiguous pixels into the rest of the image. A reference
element and a large number of host elements are present in colour Each pixel may use one of the 256(28) colours from a
each blockIn alike a way, the adjustment on MCGs for data palette or colour reference. argentine-scale 8-bit audio For any
coverlet will not beget any elements overfilled in plaintext particular image, any of the 256(28) argentine tones may be
sphere and the bedded information will be directly pulled used. It is feasible to alter the LSBs of an 8-bit picture or the
taken away the restated sphere. LSBs of 24-bit images with colour by inserting LSBs. Steps
For 24-bit filmland, the easiest LSB addition adds 3 bits per
A novel, adaptable framework for spherical data hiding frame. Since there are 24 bits per image, we can use 24 data
movement.Y.-Q. Shi, J. Huang, and F. Huang. IEEE Deals on bits and 3 hidden bits to conceal 1/8 of the hidden bits.
Information Forensics and Security, issue 11, number 12, Content Data Hider
Owner
2019, pages 2777–2789. To create the outline of the picture,
the basic pixels were first separated into sub-blocks of size m Encryption key Data Hiding
Key
n. The same crucial sluice byte is used to modify the pixels in
Image
the same sub-block after creating a crucial sluice using an Original image Encryption Data Hiding Secret
encryption key. Following gate encryption, a permutation key Information

is used to randomly permute the translated m nsub-blocks.

The majority of the RDH methods that were initially
suggested can be applied directly to the translated picture \
Data
because the connection between the neighbouring pixels in Extract Secret
Extraction
information
each sub-block can be kept well.

Data
A data hiding method for high dynamic level of photos was Encryption
hiding
key
published by T. Li, N. C. Huang, and C. M. Wang in the key

International Journal of Innovation Computing, Inf. and

Control, volume 7, issue 5, in May 2019. For HDR photos,
Reconstructed Image
Li et al. suggested a data-hiding strategy that enhances image Recovery

Cheng and Wang's scheme's embedding capability. Lietal

used an High Dynamic Range image decrypted. The sign and
exponent fields are finished when the secret dispatches are
bedded into the mantissa field. They presented three data
hiding algorithms based on the optimal pixel adaptation
process (OPAP), which provide an High embedding capacity
and tone-colluded stego picture quality are perfectly
balanced. Their approach advocated using pixels as
embedding units and provided an embedding rate of 26 bpps
on average.
"Medical image protection using a double-encrypted
opposition-based optimisation algorithm," It was proposed in
a research by AvudaiappanT., BalasubramanianR.,
PandiyanS.S., SaravananM., LakshmanaprabuS.K., and
ShankarK. that was released in 2015(23). For medical picture
encryption procedures, both full and special confusion-based
encryption is suitable. The two phases, which are based on
looking, reorganise and reorganise items as well as
encompass information about the image using chaotic maps.
Through simulation, a more effective form of the proposed
strategy is developed. This strategy also provides protection
against intrusions for continuing private picture
communication.
III. METHODOLOGY
RGB 24-bit Each of the 224 hues, each of which uses 8 bits
to represent a distinct mix of the primary colours red, green,
and blue, can represent one of the 224 pixels. in eight pieces,
Receiver
Fig 1. Proposed Architecture Diagram
We would also hide 2 bits of the encoded information for
every 8 bits of the cover picture. We could get the following
by adding a third piece: 3/8 hidden bits per data bit = 24 data
bits per pixel x 9 hidden bits per pixel.acquiring encoded bits
at a data rate for each picture's bit.
The data rate for insertion in bit images is 1 LSB insertions, or
1 embedded bit every 8 cover bits.
By calculating the amount of cover bytes necessary to
transmit an embedded byte, we can tackle the problem from a
new perspective.
We found that these SNK methods incorporate the message
using the homomorphic evaluation property, and preserve
picture privacy using Paillier encryption (or other extra
homomorphic encryption). To meet the aforementioned
requirements, we substitute secret sharing, which also benefits
from homomorphicevaluation in some respects, for some of
the Paillier encryption. We present an abstraction of those
SNK algorithms before introducing our approach.
IV. RESULTS AND DISCUSSION
Key Generation
Use to generate a key from pseudo random algorithm. After
getting an n-bit input and an n-bit random key, PRF
generates an output. Before supplying names, it must first
generate a secret at random. The private key is ultimately
 created and stored in the database. It uses the same method
but different IDs to produce noticeably more variation.
Image Encryption
In the process encrypt the image and the image was converted
into error image. Then, the error message was again encrypted
this method is known as double encryption. Thus, the
encryption encrypts the message in the error image, when
applying a key in encryption and will get secret message.

Data Embedding

It breaks up the secret information into various chunks. Then

generate a second share without the need for a key in order to Fig.3.Key given to extract the data
embed a unit, using the method to insert the message into the
encrypted pixels.

Fig. 2.Data encryption and embedding into the image
Image Decryption
Decryption means decrypt the process with the help of keys,in
the process have to decrypt the image into message with the
help of similar keys.Decrypt the message from the error
image.
Data extraction
The encryption key, the data-hiding key, or both keys could
be in the possession of a recipient in this area. The values of
the parameters can first be obtained from the MSB of the
selected encrypted pixels if the recipient only has access to the
data-hiding secret and the encrypted picture with encoded
data. The receiver rearranges and groups the leftover pixels
after which he extracts the embedded bits from the MSB plane
of each group. It should be observed that the parameter values
or pixel-groups cannot be accessed by an attacker without the
data-hiding passcode, making it difficult to retrieve the
encoded data. The diversity and what appears to be haphazard
selection of pictures is what causes this.Furthermore, even
though the recipient has the data-hiding keyis able to
effectively extract the embedded data, he is unable to learn
anything about the original image's content.
Fig.4.Extract the data from image
V. CONCLUSION
shared-one-key is a novel class of reversible data that conceals
itself in encrypted pictures. (SOK). Only the image provider
and the receiver in this class share a secret key, and anyone
who is aware of the embedding process can conceal in
particular. SOK is significantly less flexible than SNK. The
SNK schemes that are currently in use, however, depend on
additive homomorphism encryption. To improve productivity
and maintain the overall size, we build our Shared Only Key
scheme using secret sharing as its fundamental component.
Then, an Shared No Key plan with a few characteristics is
transformed into a Shared Only Key version. We give a
thorough explanation of the Shared Only Key scheme derived
from the Shared No Key schemes to show the efficacy.
Finally, we suggest a general SOK is converted into SIK
scheme because we want to perform a follow-up study.
REFERENCES
[1] T.Filler, J.Judas, J.Fridrich, Minimizing Additive
Distortion in Steganography Using Syndrome-Trellis Codes,
Information Forensics and Security, IEEE Transactions on, 6,
920-935 (2021).

[2] IEEE Trans. Circuits Syst. Video Technol., vol. 13, no. 8,
pp. 890-896, August 2020. J. Tian, "Reversible data
embedding using a difference expansion."
[3] Lossless generalised-LSB data embedding, IEEE Trans.
Image Process., vol. 14, no. 2, pp. 253-266, Feb. 2021. M. U.
Celik, G. Sharma, A. M. Tekalp, and E. Saber.
[4] Z. Ni, Y.-Q. Shi, N.Ansari, and W. Su, “Reversible
data hiding,” IEEE Trans. Circuits Syst., Video Technol., vol.
16, no. 3, pp. 354–362, 2019.
[5] L. Luo, Z. Chen, M. Chen, X. Zeng, and Z. Xiong,
“Reversible image watermarking using interpolation
technique,” IEEE Trans. Inf. Forensics Secur., vol. 5, no. 1,
pp. 187–193, 2019.
[6] X. Zhang, “Reversible data hiding in encrypted image,”
IEEE.Signal Process. Lett.,vol. 18, no. 4, pp. 255–258, Apr.
2018.
[17] P. Tsai, Y.-C. Hu, and H.-L. Yeh, “Reversible image
hiding scheme using predictive coding and histogram
shifting,” Signal Processing, vol. 89, no. 6, pp. 1129–1143,
2019.
[18] D. M. Thodi and J. J. Rodr´ ıguez, “Expansion
embedding techniques for reversible watermarking,” IEEE
transactions on image processing, vol. 16, no. 3, pp. 721–730,
2018.
[19] Avudaiappan T., Balasubramanian R., Pandiyan S.S.,
Saravanan M., LakshmanaprabuS.K.,and Shankar K.,
“Medical Image Security Using Dual Encryption with
Oppositional Based Optimization Algorithm”, Journal of
Medical Systems, Vol. 58, no.3, pp. 777-780,2018.

[7] X. Zhang, C. Qin, and G. Sun, “Reversible data hiding in

encrypted images using pseudorandom sequence modulation,”
in Proc. IWDW 2020, LNCS, vol. 7809, pp. 358–367, 2020.

[8] W. Hong, T.-S. Chen, and H.-Y. Wu, “An improved

reversible data hiding in encrypted images using side match,”
IEEE Signal Process. Lett. vol. 19, no. 4, pp. 199– 202, Apr.
2019.

[9] W. Hong, T.-S. Chen, J. Chen, Y.-H. Kao, H.-Y. Wu, and
M.C. Wu, “Reversible data embedment for encrypted
cartoon images using unbalanced bit flipping,” in Proc.
ICSI 2019, LNCS, vol. 7929, pp. 208–214, 2019.

[11] J. Tian, “Reversible data embedding using a difference

expansion,” IEEE transactions on circuits and systems for
video technology, vol. 13, no. 8, pp. 890–896, 2021.

[12] Z. Ni, Y.-Q. Shi, N. Ansari, and W. Su, “Reversible data

hiding,” IEEE Transactions on circuits and systems for video
technology, vol. 16, no. 3, pp. 354–362, 2006.

[13] W. Hong, “Adaptive reversible data hiding method based

on error energy control and histogram shifting,” Optics
Communications, vol. 285, no. 2, pp. 101–108, 2022.

[14] W. Hong and T.-S. Chen, “A local variance-controlled

reversible data hiding method using prediction and histogram-
shifting,” Journal of Systems and Software, vol. 83, no. 12,
pp. 2653–2663, 2020.

[15] S.-W. Jung, S.-J. Ko et al., “A new histogram

modification based reversible data hiding algorithm
considering the human visual system,” IEEE Signal
Processing Letters, vol. 18, no. 2, pp. 95–98, 2021.

[16] Y.-Y. Tsai, D.-S. Tsai, and C.-L. Liu, “Reversible data
hiding scheme based on neighboring pixel differences,”
Digital Signal Processing, vol. 23, no. 3, pp. 919–927, 2019.