AU2021102700A4 - A system for reversible data hiding in encrypted images - Google Patents
A system for reversible data hiding in encrypted images Download PDFInfo
- Publication number
- AU2021102700A4 AU2021102700A4 AU2021102700A AU2021102700A AU2021102700A4 AU 2021102700 A4 AU2021102700 A4 AU 2021102700A4 AU 2021102700 A AU2021102700 A AU 2021102700A AU 2021102700 A AU2021102700 A AU 2021102700A AU 2021102700 A4 AU2021102700 A4 AU 2021102700A4
- Authority
- AU
- Australia
- Prior art keywords
- bit
- message
- encrypted
- image
- embedding
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Ceased
Links
- 230000002441 reversible effect Effects 0.000 title claims abstract description 28
- 238000000034 method Methods 0.000 claims abstract description 57
- 238000000605 extraction Methods 0.000 claims description 15
- 230000002708 enhancing effect Effects 0.000 claims description 6
- 238000007781 pre-processing Methods 0.000 claims description 6
- 230000007246 mechanism Effects 0.000 abstract description 5
- PJHPFAFEJNBIDC-UHFFFAOYSA-N 1-(4-bromophenyl)piperazine Chemical compound C1=CC(Br)=CC=C1N1CCNCC1 PJHPFAFEJNBIDC-UHFFFAOYSA-N 0.000 abstract description 2
- 230000008901 benefit Effects 0.000 description 9
- 238000010586 diagram Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 4
- 238000011084 recovery Methods 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 230000006835 compression Effects 0.000 description 2
- 238000007906 compression Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000002372 labelling Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/32203—Spatial or amplitude domain methods
- H04N1/32219—Spatial or amplitude domain methods involving changing the position of selected pixels, e.g. word shifting, or involving modulating the size of image components, e.g. of characters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/32267—Methods relating to embedding, encoding, decoding, detection or retrieval operations combined with processing of the image
- H04N1/32272—Encryption or ciphering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/32347—Reversible embedding, i.e. lossless, invertible, erasable, removable or distorsion-free embedding
-
- G—PHYSICS
- G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
- G09C—CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY
- G09C5/00—Ciphering apparatus or methods not provided for in the preceding groups, e.g. involving the concealment or deformation of graphic data such as designs, written or printed messages
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Editing Of Facsimile Originals (AREA)
- Image Processing (AREA)
Abstract
The present disclosure relates to a system for reversible data hiding encrypted images.
The disclosure presents RDH in an encrypted cover image. Embedding of information is done on
the pivot pixels of the interpolated image. The experiment is conducted on image size of
256X256 gray scale and color images. The experiment is evaluated using the MATLAB software
with randomly generated bits as the message to be embedded. Each bit of message is embedded
using plus/minus one embedding mechanism. The embedding is performed in the encrypted
image after interpolation. The experimental results have proved its efficacy by allowing a
payload of up to 4 bpp. The Result shows that the proposed method is no where comparable with
the existing techniques. This is possible because of embedding not done using conventional
expansion techniques.
15
Receiver
ContentOwner
DataHiderata OrignalImage
b ~Ma rked extato
Original Ercrypted Ercrypted
Eneg ImageImagSecret Message
ErrrytionRecoverlrig
the Cover
Figure 3
Input Image Perform Embedding
cover M Encryption Interpolation using+/-1 MarkedImage
Image technique
Oscardthe Image Output MarkedImage Extractmessage ine Deryton ou r
rows &colurmns Image
Figure 4
i1 12 8 i4
1 0 0 1 0 0 0 1
PsI Ps2 P53 Ps4
a) Pivot pixel (Pi)
PS1I Ps2 Ps3 Ps4j 1 1i i 3 i4
b) Wmered pixel(11h)
Figure 5
Description
Receiver ContentOwner
DataHiderata OrignalImage
b ~Ma rked extato
Original Ercrypted Ercrypted
Eneg ImageImagSecret Message
ErrrytionRecoverlrig the Cover
Figure 3
Input Image Perform Embedding cover M Encryption Interpolation using+/-1 MarkedImage Image technique
Oscardthe Image Output MarkedImage Extractmessage ine Deryton ou r rows &colurmns Image
Figure 4
i1 12 8 i4 1 0 0 1 0 0 0 1
PsI Ps2 P53 Ps4
a) Pivot pixel (Pi)
PS1I Ps2 Ps3 Ps4j 1 1i i 3 i4
b) Wmered pixel(11h)
Figure 5
The present disclosure relates to a system for reversible data hiding in encrypted images.
RDH is a technique in which the secret message is extracted and also the cover signal is recovered completely without a single bit error. Most of the early works in RDH were carried out in compressed domain, spatial domain and frequency domain. But, necessity for RDH has emerged with the internet technology getting developed rapidly and cloud storage functions. Lot of images need to be uploaded on to a cloud server, followed by the embedding of message and also other processing steps. The data should not be manipulated by the CP, mainly when it comes to private and most sensitive data like medical reports or images and military images which relate to national security. In order to make the data secure, RDH in encrypted domain has emerged. More research have been carried out to maximize the payload and to ensure security. The existing RDH in encrypted images (RDHEI) can be mainly divided into two categories: One is Vacating Room Before Encryption (VRBE) where the embedding is performed initially on the cover image and encryption mechanism is done later and the second is Vacating Room After Encryption in which the encryption is carried out on the cover image first, later embedding is performed on the encrypted image.
In one existing solution a first RDH algorithm was proposed. It was by embedding the authentication information into a digital medium. Earlier RDH was carried out in spatial domain, frequency domain and in compressed domain.
In another existing solution a separable reversible data hiding for JPEG bit stream in encrypted images has been introduced. This scheme was constructed by reserving room before encryption and the bit stream was modified with less distortion so that the content owner will get enough space for embedding the data. The original image was modified with minimal distortion so that to provide more space for embedding data. A lossless compression algorithm was also designed which was better than the arithmetic coding method for the two bit LSB biased bits stream. At the receiver side, extracting the data and decryption procedure are independent. It was also proved that the receiver was able to extract the embedded information and the cover JPEG bit stream.
In another existing solution a technique called binary block reversible data embedding in encrypted images has been presented. It was achieved by embedding binary bit in lower bit planes of the cover image into higher bit planes so that by reserving lower bit planes they embedded secret information. A bit level scrambling process was also employed to spread the embedded data to the entire encrypted stego image. It was also proved that binary block embedding is reversible.
In another existing solution a separable reversible data hiding has been also presented. Parametric binary tree labelling methodology was adopted to embed secret information in encrypted images. In order to achieve embedding, the spatial redundancy present in small block of image was explored. It was also proved that the secret information and the cover image can be extracted losslessly and independently with an average embedding rate of 1.75 bpp for a block size of 2x2.
In another existing solution an RDH scheme which was separable and has higher embedding capacity has been proposed. The Hamming code was used for exploiting the payload efficiently using a half toned image.
In another existing solution an RDH scheme has been proposed with higher capacity utilizing the bit plane operations and adaptive embedding in encrypted images.
In another existing solution an RDH method by mirroring ciphertext group by using probabilistic and homomorphic properties in encrypted images have been proposed. This was achieved by randomly selecting a group of pixels and reversible embedding was performed on the remaining pixels.
In another existing solution a reversible data hiding scheme for encrypted images has been proposed. An efficient sparse block coding scheme has been developed, which makes use of the redundancy transfer. A special encryption method was adopted and also bit plane disordering block scrambling followed by pixel scrambling. An exchanging MSB planes were performed with LSB planes and embedded additional data by means of sparse matrix compression method. It also proved privacy protection of content by adopting adaptive embedding strategy with block selection techniques.
In one prior art solution Embodiments of the invention are directed toward reversible/invertible and lossless, image data hiding that can imperceptibly hide data into digital images and can reconstruct the original image without any distortion after the hidden data have been extracted in various digital image formats including, but not limited to Joint Photographic Experts Group (JPEG). In particular, embodiments of the invention provide a lossless data hiding technique for JPEG images based on histogram pairs. that embeds data into the JPEG quantized 8x8 block DCT coefficients and achieves good performance in terms of peak signal-to-noise ratio (PSNR) versus payload through manipulating histogram pairs with optimum threshold and optimum region of the JPEG DCT coefficients. Furthermore, the invented technology is expected to be able to apply to the I-frame of Motion Picture Experts Group (MPEG) video for various applications including annotation, authentication, and forensics.
In another prior art solution a method was proposed including identifying at least two subsets of pixels within a block of an image; forming a plurality of pixel groups from the at least two subsets of pixels, each pixel group having at least one pixel from a first of the at least two subsets and at least one pixel from a second of the at least two subsets; producing a plurality of difference values, each pixel group providing one of said difference values, each difference value being based on differences between pixel values of pixels within one of the pixel groups; and modifying pixel values of pixels in less than all of the at least two subsets, thereby embedding a bit value into the block.
In another prior art solution a JPEG image bit stream encryption domain reversible data hiding method is characterized in that a user carries out exclusive OR encryption on expansion bits of all entropy encodings in each image block in a JPEG bit stream according to an encryption key, carries out pseudo-random scrambling on the other alternating current coefficients except the last non-zero alternating current coefficient, and carries out pseudo-random scrambling on all image block entropy encodings; the cloud end carries out histogram translation on the alternating current coefficient in the bit stream cipher text according to the hidden key to embed additional information, and can carry out lossless extraction; and the receiver performs pseudorandom scrambling recovery on all ciphertext image block entropy codes in the bit stream ciphertext according to the encryption key, and then performs alternating current coefficient scrambling recovery and extended bit XOR decryption in each ciphertext image block entropy code to obtain a decrypted bit stream which is the same as the original JPEG bit stream. The method not only realizes the encryption of the expansion bit of the entropy coding, but also encrypts the Huffman coding of the entropy coding; the capacity of steganography is large, and the safety is high.
However, to ensure the safety and security of electronic files, date must be recorded and stored in the encryption domain during the cloud storage mechanism where the user does not permit the cloud provider (CP) to access the information and the CP must insert extra information in the data. Hence Reversible Data Hiding in Encryption domain (RDHE) techniques has emerged. Therefore in order to avoid the aforementioned drawback there is a need for a system for reversible data hiding in encrypted images.
The present disclosure relates to a system for reversible data hiding in encrypted images. The present disclosure presents RDH in an encrypted cover image. Additional columns are interpolated into the encrypted image to preserve the information required for reversibility. Embedding of information is done on the pivot pixels of the interpolated image. Each bit of message is embedded using plus/minus one embedding mechanism. The experimental results have proved its efficacy by allowing a payload of up to 4 bpp. The comparison metric shows that the proposed method is no where comparable with the existing techniques.
The present disclosure seeks to provide a system for reversible data hiding in encrypted images. The system comprises: a transmitter end and a receiver end, wherein the transmitter end comprises of: a collection module for collecting an input image data, wherein the input image data undergoes a pre-processing for enhancing a plurality of pixels of the input image data; an encryption module connected to the collection module for encrypting the pixels of the collected image using a benchmark encryption technique, wherein the encrypted image under goes an interpolation of columns using an interpolation technique; a data embedding module connected to the encryption module for receiving an encrypted image and embedding a message in the encrypted pixels, wherein the encrypted pixels are paired and each pair is assigned a symbol for storing at least a message; wherein the receiver end comprises of: an extraction module connected to the data embedding module for receiving a marked message and extracting an original message from the embedded marked message, wherein the interpolated columns and rows of the pixels are discarded; and a decryption module connected to the extraction module for decrypting the encrypted image and obtaining the original image at a receiver end.
The present disclosure also seeks to provide a method for reversible data hiding in encrypted images. The method comprises: collecting an input image data using a collection module, wherein the input image data undergoes pre-processing for enhancing a plurality of pixels of the input image data; encrypting the pixels of the collected image by a benchmark encryption technique using an encryption module connected to the collection module, wherein the encrypted image under goes an interpolation of columns using an interpolation technique; receiving an encrypted image using a data embedding module connected to the encryption module and embedding a message in the encrypted pixels, wherein the encrypted pixels are paired and each pair is assigned a symbol for storing at least a message; receiving a marked message using an extraction module connected to the data embedding module and extracting an original message from the embedded marked message, wherein the interpolated columns and rows of the pixels are discarded; and decrypting the encrypted image using a decryption module connected to the extraction module and obtaining the original image at a receiver end.
An objective of the present disclosure is to propose a system and method for reversible data hiding in encrypted images.
Another object of the present disclosure is to presents RDH in an encrypted cover image.
Another object of the present disclosure is to interpolate columns into the encrypted image to preserve the information required for reversibility.
Another object of the present disclosure is to do Embedding of information on the pivot pixels of the interpolated image.
Another object of the present disclosure is to use plus/minus one embedding mechanism to embed each bit of message.
Yet, another object of the present disclosure is to prove the efficacy through the experimentalresults.
To further clarify advantages and features of the present disclosure, a more particular description of the invention will be rendered by reference to specific embodiments thereof, which is illustrated in the appended drawings. It is appreciated that these drawings depict only typical embodiments of the invention and are therefore not to be considered limiting of its scope. The invention will be described and explained with additional specificity and detail with the accompanying drawings.
These and other features, aspects, and advantages of the present disclosure will become better understood when the following detailed description is read with reference to the accompanying drawings in which like characters represent like parts throughout the drawings, wherein:
Figure 1 illustrates a block diagram of a system for reversible data hiding in encrypted images in accordance with an embodiment of the present disclosure;
Figure 2 illustrates a flow chart of a method for reversible data hiding in encrypted images in accordance with an embodiment of the present disclosure;
Figure 3 illustrates the General block diagram of RDH in encrypted image in accordance with an embodiment of the present disclosure;
Figure 4 illustrates the Block diagram of proposed embedding and extraction in accordance with an embodiment of the present disclosure;
Figure 5 illustrates the encrypted pivot pixel and interpolated pixel in accordance with an embodiment of the present disclosure;
Figure 6 illustrates a table of embedding strategy in accordance with an embodiment of the present disclosure;
Further, skilled artisans will appreciate that elements in the drawings are illustrated for simplicity and may not have been necessarily been drawn to scale. For example, the flow charts illustrate the method in terms of the most prominent steps involved to help to improve understanding of aspects of the present disclosure. Furthermore, in terms of the construction of the device, one or more components of the device may have been represented in the drawings by conventional symbols, and the drawings may show only those specific details that are pertinent to understanding the embodiments of the present disclosure so as not to obscure the drawings with details that will be readily apparent to those of ordinary skill in the art having benefit of the description herein.
For the purpose of promoting an understanding of the principles of the invention, reference will now be made to the embodiment illustrated in the drawings and specific language will be used to describe the same. It will nevertheless be understood that no limitation of the scope of the invention is thereby intended, such alterations and further modifications in the illustrated system, and such further applications of the principles of the invention as illustrated therein being contemplated as would normally occur to one skilled in the art to which the invention relates.
It will be understood by those skilled in the art that the foregoing general description and the following detailed description are exemplary and explanatory of the invention and are not intended to be restrictive thereof.
Reference throughout this specification to "an aspect", "another aspect" or similar language means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present disclosure. Thus, appearances of the phrase "in an embodiment", "in another embodiment" and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment.
The terms "comprises", "comprising", or any other variations thereof, are intended to cover a non-exclusive inclusion, such that a process or method that comprises a list of steps does not include only those steps but may include other steps not expressly listed or inherent to such process or method. Similarly, one or more devices or sub-systems or elements or structures or components proceeded by "comprises...a" does not, without more constraints, preclude the existence of other devices or other sub-systems or other elements or other structures or other components or additional devices or additional sub-systems or additional elements or additional structures or additional components.
Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The system, methods, and examples provided herein are illustrative only and not intended to be limiting.
Embodiments of the present disclosure will be described below in detail with reference to the accompanying drawings.
Figure 1 illustrates a block diagram of a system for reversible data hiding in encrypted images in accordance with an embodiment of the present disclosure. The system 100 includes a transmitter end 102, wherein transmitter end comprises of: a collection module 104 for collecting an input image data, wherein the input image data undergoes a pre-processing for enhancing a plurality of pixels of the input image data; an encryption module 106 which is connected to the collection module for encrypting the pixels of the collected image using a benchmark encryption technique, wherein the encrypted image under goes an interpolation of columns using an interpolation technique; a data embedding module 108 which is connected to the encryption module for receiving an encrypted image and embedding a message in the encrypted pixels, wherein the encrypted pixels are paired and each pair is assigned a symbol for storing at least a message.
In an embodiment the system includes a receiver end 110, wherein the receiver end comprises of: an extraction module 112 which is connected to the data embedding module for receiving a marked message and extracting an original message from the embedded marked message, wherein the interpolated columns and rows of the pixels are discarded; and a decryption module 114 which connected to the extraction module for decrypting the encrypted image and obtaining the original image at a receiver end.
Figure 2 illustrates a flow chart of a method for reversible data hiding in encrypted images in accordance with an embodiment of the present disclosure. At step 202 the method 200 includes collecting an input image data using a collection module, wherein the input image data undergoes pre-processing for enhancing a plurality of pixels of the input image data.
At step 204 the method 200 includes encrypting the pixels of the collected image by a benchmark encryption technique using an encryption module connected to the collection module, wherein the encrypted image under goes an interpolation of columns using an interpolation technique.
At step 206 the method 200 includes receiving an encrypted image using a data embedding module connected to the encryption module and embedding a message in the encrypted pixels, wherein the encrypted pixels are paired and each pair is assigned a symbol for storing at least a message.
At step 208 the method 200 includes receiving a marked message using an extraction module connected to the data embedding module and extracting an original message from the embedded marked message, wherein the interpolated columns and rows of the pixels are discarded.
At step 210 the method 200 includes decrypting the encrypted image using a decryption module connected to the extraction module and obtaining the original image at a receiver end.
Figure 3 illustrates the General block diagram of RDH in encrypted image in accordance with an embodiment of the present disclosure. The figure explains the general representation of RDH in encrypted images. In the proposed method, the image is interpolated to incorporate additional space for recovery of the cover image and creating space in the pivot pixels for embedding the data.
Figure 4 illustrates the Block diagram of proposed embedding and extraction in accordance with an embodiment of the present disclosure. An input cover image is encrypted using a benchmark encryption algorithm (e.g. AES) and the encrypted image under goes an interpolation of columns only. The interpolated columns are not estimated using the averaging technique followed in most of the interpolation schemes. Embedding is performed in the pivot encrypted pixels. After performing interpolation on the encrypted cover image, the size of the image doubles with respect to column and number of rows remains the same as of the cover image. This is performed to provide room for embedding and to incorporate the additional information required for the reversibility of the encrypted cover image.
Figure 5 illustrates the encrypted pivot pixel and interpolated pixel in accordance with an embodiment of the present disclosure. Message will be embedded in the encrypted pixels. The encrypted pixels are paired and each pair is assigned a symbol represented by Ps. The assigned symbol is recorded in the neighbouring interpolated pixel positioned as IP 7 to IP 4 . The bits in position 7,5,3,1 of the encrypted cover pixels are recorded in IP 3 to IPo. The format of the encrypted pivot pixel and the interpolated pixels are shown this figure. In this way all the interpolated pixels in alternate columns of each row is formatted.
Figure 6 illustrates a table of embedding strategy in accordance with an embodiment of the present disclosure. Embedding is performed in the encrypted pivot pixels. Every bit of the encrypted pivot pixels carries a message bit. Eight message bits are embedded in each encrypted pivot pixels. The embedding strategy used for embedding message bits in each bit of the encrypted pivot pixel is shown in this table. If the bit is '0' it is considered as even bit and the bit positions in the encrypted pivot pixel 6,4,2,0 are considered as even positions. Similarly if the bit is'1' it is considered as odd bit and the bit positions in 7,5,3,1 are considered as odd positions.
If the bit value By and bit position Bp are both same and the message to be embedded is '0' then the marked bit will be the reverse of the original bit. Then if the bit value By and the bit position Bp are not same for an embeddable message of bit '0' then the marked bit remains the same as that of the original bit. For a third possible condition if the bit value By and bit position Bp are both same and the message to be embedded is '1' then the marked bit will be the same as that of the original bit. Final condition if the bit value By and the bit position Bp are not same for an embeddable message of bit '1' then the marked will be the reverse of the original bit.
The drawings and the forgoing description give examples of embodiments. Those skilled in the art will appreciate that one or more of the described elements may well be combined into a single functional element. Alternatively, certain elements may be split into multiple functional elements. Elements from one embodiment may be added to another embodiment. For example, orders of processes described herein may be changed and are not limited to the manner described herein. Moreover, the actions of any flow diagram need not be implemented in the order shown; nor do all of the acts necessarily need to be performed. Also, those acts that are not dependent on other acts may be performed in parallel with the other acts. The scope of embodiments is by no means limited by these specific examples. Numerous variations, whether explicitly given in the specification or not, such as differences in structure, dimension, and use of material, are possible. The scope of embodiments is at least as broad as given by the following claims.
Benefits, other advantages, and solutions to problems have been described above with regard to specific embodiments. However, the benefits, advantages, solutions to problems, and any component(s) that may cause any benefit, advantage, or solution to occur or become more pronounced are not to be construed as a critical, required, or essential feature or component of any or all the claims.
Claims (8)
1. A system for reversible data hiding in encrypted images, the system comprises of: a transmitter end; a receiver end; wherein the transmitter end comprises of: a collection module for collecting an input image data, wherein the input image data undergoes a pre-processing for enhancing a plurality of pixels of the input image data;
an encryption module connected to the collection module for encrypting the pixels of the collected image using a benchmark encryption technique, wherein the encrypted image under goes an interpolation of columns using an interpolation technique;
a data embedding module connected to the encryption module for receiving an encrypted image and embedding a message in the encrypted pixels, wherein the encrypted pixels are paired and each pair is assigned a symbol for storing at least a message;
wherein the receiver end comprises of:
an extraction module connected to the data embedding module for receiving a marked message and extracting an original message from the embedded marked message, wherein the interpolated columns and rows of the pixels are discarded; and
a decryption module connected to the extraction module for decrypting the encrypted image and obtaining the original image at a receiver end.
2. The system as claimed in claim 1, wherein the size of the embedded image doubles with respect to the column, whereas number of rows remains the same as of the collected image.
3. The system as claimed in claim 1, wherein the symbol comprises of binary values and the symbol assigned during embedding is recorded in a neighboring interpolated pixel, wherein all the interpolated pixels in alternate columns of each row is formatted.
4. The system as claimed 1, wherein embedding is performed in an encrypted pivot pixel, wherein at least eight message bits are embedded in each encrypted pivot pixels.
5. The system as claimed in claim 1, wherein the embedding technique comprises steps of:
When the bit is '0' the bit is considered as even bit and the bit positions in the encrypted pivot pixel 6,4,2,0 is considered as even positions; and
when the bit is'1' the bit is considered as odd bit and the bit positions in 7,5,3,1 is considered as odd positions.
6. The system as claimed in claim 1, wherein the embedding technique for marking the message comprises steps of: When a bit value and a bit position are both same and the message to be embedded is '0' then the marked message bit is the reverse of the original message bit;
when the bit value and the bit position are not same for the embedded message of bit '0' then the marked message bit remains the same as that of the original bit; when the bit value and the bit position are both same and the message to be embedded is '1' then the marked message bit is be the same as that of the original message bit; and
when the bit value and the bit position are not same for an embeddable message of bit '1' then the marked is be the reverse of the original bit.
7. The system as claimed in claim 1, wherein a key for extracting the message bit and recovering the original encrypted pixels is present in the interpolated pixels.
8. A method for reversible data hiding in encrypted images, the method comprises of:
collecting an input image data using a collection module, wherein the input image data undergoes pre-processing for enhancing a plurality of pixels of the input image data;
encrypting the pixels of the collected image by a benchmark encryption technique using an encryption module connected to the collection module, wherein the encrypted image under goes an interpolation of columns using an interpolation technique;
receiving an encrypted image using a data embedding module connected to the encryption module and embedding a message in the encrypted pixels, wherein the encrypted pixels are paired and each pair is assigned a symbol for storing at least a message;
receiving a marked message using an extraction module connected to the data embedding module and extracting an original message from the embedded marked message, wherein the interpolated columns and rows of the pixels are discarded; and decrypting the encrypted image using a decryption module connected to the extraction module and obtaining the original image at a receiver end.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| AU2021102700A AU2021102700A4 (en) | 2021-05-19 | 2021-05-19 | A system for reversible data hiding in encrypted images |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| AU2021102700A AU2021102700A4 (en) | 2021-05-19 | 2021-05-19 | A system for reversible data hiding in encrypted images |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| AU2021102700A4 true AU2021102700A4 (en) | 2021-11-04 |
Family
ID=78488430
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| AU2021102700A Ceased AU2021102700A4 (en) | 2021-05-19 | 2021-05-19 | A system for reversible data hiding in encrypted images |
Country Status (1)
| Country | Link |
|---|---|
| AU (1) | AU2021102700A4 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116431846A (en) * | 2023-06-14 | 2023-07-14 | 泰山学院 | Student sensitive information storage system and method |
-
2021
- 2021-05-19 AU AU2021102700A patent/AU2021102700A4/en not_active Ceased
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116431846A (en) * | 2023-06-14 | 2023-07-14 | 泰山学院 | Student sensitive information storage system and method |
| CN116431846B (en) * | 2023-06-14 | 2023-08-18 | 泰山学院 | Student sensitive information storage system and method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Puyang et al. | Reversible data hiding in encrypted images with two-MSB prediction | |
| Fu et al. | Effective reversible data hiding in encrypted image with adaptive encoding strategy | |
| Xu et al. | Separable and error-free reversible data hiding in encrypted images | |
| Yu et al. | Reversible data hiding with hierarchical embedding for encrypted images | |
| Yin et al. | Reversible data hiding in encrypted images based on pixel prediction and bit-plane compression | |
| Zhang | Separable reversible data hiding in encrypted image | |
| US20020176602A1 (en) | Method of integrating a watermark into a compressed image | |
| CN111861844A (en) | Reversible watermarking method based on image block authentication | |
| Malik et al. | Reversible data hiding in homomorphically encrypted image using interpolation technique | |
| CN110110535B (en) | Low-distortion steganography method based on pixel matrix | |
| AU2021102700A4 (en) | A system for reversible data hiding in encrypted images | |
| Agham et al. | A novel approach towards separable reversible data hiding technique | |
| Gao et al. | High capacity reversible data hiding in encrypted image based on image encoding and POB | |
| CN116437019A (en) | Ciphertext domain reversible information hiding method of all-0 row and all-0 column codes | |
| Puteaux et al. | High-capacity reversible data hiding in encrypted images using MSB prediction | |
| Liu et al. | A reversible data hiding algorithm based on image camouflage and bit-plane compression | |
| Prabhakaran et al. | A new cryptic steganographic approach using video steganography | |
| Li et al. | High-capacity reversible data hiding in encrypted images by information preprocessing | |
| Raj et al. | A survey on reversible data hiding in encrypted image | |
| Sivadasan | A survey paper on various reversible data hiding techniques in encrypted images | |
| Vaish et al. | A systematic review on various reversible data hiding techniques in digital images | |
| Neetha et al. | An Efficient Image Encryption Reversible Data Hiding Technique to Improve Payload and High Security in Cloud Platforms | |
| Rathika et al. | Survey on reversible data hiding techniques | |
| Yi et al. | Reversible data hiding method in encrypted images using secret sharing and Huffman coding | |
| Khare et al. | A Survey on Reversible Image Data Hiding Using the Hierarchical Block Embedding Technique |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FGI | Letters patent sealed or granted (innovation patent) | ||
| MK22 | Patent ceased section 143a(d), or expired - non payment of renewal fee or expiry |