CN113190807A - Ciphertext domain reversible information hiding method based on image secret sharing - Google Patents
Ciphertext domain reversible information hiding method based on image secret sharing Download PDFInfo
- Publication number
- CN113190807A CN113190807A CN202110600347.XA CN202110600347A CN113190807A CN 113190807 A CN113190807 A CN 113190807A CN 202110600347 A CN202110600347 A CN 202110600347A CN 113190807 A CN113190807 A CN 113190807A
- Authority
- CN
- China
- Prior art keywords
- secret
- image
- ciphertext
- information
- carrying
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 230000002441 reversible effect Effects 0.000 title claims abstract description 19
- 230000008569 process Effects 0.000 description 13
- 238000005516 engineering process Methods 0.000 description 12
- 230000006835 compression Effects 0.000 description 9
- 238000007906 compression Methods 0.000 description 9
- 238000011084 recovery Methods 0.000 description 9
- 238000000605 extraction Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 5
- 230000008901 benefit Effects 0.000 description 4
- 239000011159 matrix material Substances 0.000 description 3
- 230000011218 segmentation Effects 0.000 description 3
- 230000000007 visual effect Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 208000011580 syndromic disease Diseases 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
- G06F21/16—Program or content traceability, e.g. by watermarking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
- G06T1/0021—Image watermarking
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Multimedia (AREA)
- Technology Law (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- General Engineering & Computer Science (AREA)
- Image Processing (AREA)
- Editing Of Facsimile Originals (AREA)
Abstract
The invention discloses a ciphertext domain reversible information hiding method based on image secret sharing, which comprises the following steps: encrypting the original image to obtain a ciphertext image; embedding two layers of secret information through the redundancy of polynomials and the homomorphism property of secret sharing to obtain a secret image; by obtaining a second key corresponding to the second layer secret information; directly extracting second-layer secret information from the second secret-carrying ciphertext image through a second secret key; collecting a plurality of different second secret-carrying ciphertext images; performing homomorphic decryption on the second secret-carrying text image after recovering the secret by using a Lagrange interpolation polynomial; and after homomorphic decryption, recovering the original image and extracting the first layer of secret information by adopting a first key corresponding to the first layer of secret information and a third key corresponding to the ciphertext image. The invention enhances the fault tolerance and disaster resistance of the encrypted ciphertext image, improves the embedding capacity of the reversible information hiding algorithm of the ciphertext domain, and ensures the safety of the carrier image and the secret information.
Description
Technical Field
The invention relates to the field of image processing, in particular to a ciphertext domain reversible information hiding method based on image secret sharing.
Background
Ciphertext domain Reversible information hiding (RDH-ED) is an important branch of an information hiding technology, secret information can be embedded in ciphertext data, and an original carrier can be recovered without damage. The method organically integrates the ciphertext domain information processing technology and the information hiding technology, realizes the dual functions of information encryption protection and secret information transmission, and provides a method for the fields of military affairs, medical treatment and the like which require carrier safety and guarantee carrier distortion-free recovery.
The existing ciphertext domain reversible information hiding technology is mainly divided into three categories: and a ciphertext domain embedding scheme for generating redundancy based on encryption, generating redundancy based on encryption and generating redundancy based on encryption process. The method for generating redundancy after encryption mainly utilizes a ciphertext lossless compression technology or a homomorphic encryption technology to generate redundancy in a ciphertext domain, and has the problems of low embedding rate, poor separability and the like. The method for generating redundancy before encryption mainly generates redundancy through complex preprocessing operation before encryption, in practical application, an image owner is difficult to be required to execute related operation, certain application limitation exists, and a representative algorithm mainly comprises the following steps: based on lossless compression techniques and pixel-based prediction techniques. The method for encrypting process redundancy mainly utilizes redundancy to make an embedding strategy by exploring redundant information existing in the encrypting process.
Secret Sharing (SSS) is an important encryption technology and is widely used in many fields such as key management, digital watermarking, and distributed storage. The secret sharing scheme is introduced into reversible information hiding of a ciphertext domain and has important significance, the existing algorithm mainly utilizes the technology of difference value expansion and difference value histogram translation to embed secret information into a shadow image, but separability of image decryption and secret extraction cannot be realized, and meanwhile, the technical advantage of secret sharing cannot be reserved.
Image Secret sharing (SIS) is an extended application of Secret sharing, in which a Secret image is divided into a plurality of shadow images and distributed to different participants, and the Secret image can be losslessly restored only when a sufficient number of shadow images are collected. The method mainly comprises two categories: visual cryptography-based and polynomial-based image secret sharing schemes. The scheme based on visual cryptography is that a plurality of shadow images are overlapped and recovered by human eyes, and the image visual quality is not high. The polynomial-based scheme can not only realize secret segmentation and compression of the image, but also recover the secret image without loss. Many advantages of secret sharing of images are worth using information hiding, for example, SIS has the requirement of lossless recovery of images, and meets the reversibility of RDH-ED, there is a lot of redundant information after SIS compression, and meets the redundancy of RDH-ED. However, the current image secret sharing and information hiding are not tightly combined, and the correctness and integrity of the shadow image are verified mainly by using a digital watermark.
In summary, the conventional RDH-ED algorithm mainly uses redundancy of the carrier image to reversibly embed the secret information, and the embeddability is limited by the original carrier. Meanwhile, when the ciphertext is attacked or damaged, the embedded information cannot be accurately extracted and the original image cannot be restored without loss.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a ciphertext domain reversible information hiding method based on image secret sharing.
In order to achieve the purpose, the invention adopts the following technical scheme:
a ciphertext domain reversible information hiding method based on image secret sharing comprises the following steps:
encrypting the original image to obtain a ciphertext image;
embedding first-layer secret information into the ciphertext image through polynomial redundancy to obtain a secret image;
dividing the secret image into a plurality of first secret-carrying ciphertext images;
and respectively embedding second-layer secret information into the multiple first secret carrying text images by utilizing the homomorphism property of secret sharing so as to obtain multiple second secret carrying text images.
The further technical scheme is as follows: the method further comprises the following steps:
acquiring a second key corresponding to the second layer secret information;
directly extracting second-layer secret information from the second secret-carrying ciphertext image through a second secret key;
and the number of the first and second groups,
collecting a plurality of different second secret-carrying ciphertext images;
performing homomorphic decryption on the second secret-carrying text image after recovering the secret by using a Lagrange interpolation polynomial;
and after homomorphic decryption, recovering the original image and extracting the first layer of secret information by adopting a first key corresponding to the first layer of secret information and a third key corresponding to the ciphertext image.
The further technical scheme is as follows: in the step of embedding the first layer of secret information into the ciphertext image through the redundancy of a polynomial to obtain the secret image, the polynomial is:
F(x)=a1+...+awxw-1+b1xw+...+bk-wxk-1(modq); wherein, a1,...,awAs ciphertext image pixels, b1,...,bk-wIs the first layer secret information.
The further technical scheme is as follows: in the step of dividing the secret image into a plurality of first secret-carrying ciphertext images, the secret image division needs to satisfy the following equation set:
wherein, a1,...,awAs ciphertext image pixels, b1,...,bk-wIs first layer secret information, xiFor sharing secret Key SIS Keyi,F(xi) Is the first secret carrying ciphertext image.
The further technical scheme is as follows: in the step of respectively embedding the second layer of secret information into the multiple first secret carrying text images by utilizing the homomorphic property of secret sharing to obtain the multiple second secret carrying text images, the homomorphic embedding of the second layer of secret information needs to meet the following equation set;
wherein, F (x)i) Namely the first secret-carrying character image, F' (x)i) Is the second secret carrying ciphertext image.
The further technical scheme is as follows: in the step of recovering the original image and extracting the first layer of secret information by adopting the first key corresponding to the first layer of secret information and the third key corresponding to the ciphertext image after homomorphic decryption, the recovered polynomial and the second secret-carrying image need to satisfy the following equation set;
wherein e is1,f1,g1,h1Is a constant, F' (x), associated with the second layer secret informationi) Is the second secret carrying ciphertext image.
Compared with the prior art, the invention has the beneficial effects that: the method and the device utilize the characteristics of the image secret sharing scheme to divide the secret image into a plurality of secret-carrying text images, and when part of the secret-carrying text images are damaged or lost, the lossless recovery and extraction can be still carried out through other k secret-carrying text images, so that the original image and the secret information have stronger fault tolerance. The first layer of secret information is embedded by using redundant parameters in the encryption process, the second layer of secret information is carried out by using the homomorphism characteristic of the encryption algorithm, the embedding capacity of the algorithm is effectively improved, and the embedding capacity of the algorithm is not limited by the carrier image. The secret image is divided into a plurality of shares by the characteristics of the secret sharing scheme and then stored by different participants, so that the secret is prevented from being excessively concentrated, and the secret is safely stored and risk is dispersed. In addition, each information hiding participant holds different secret-carrying images, the secret-carrying images can be respectively and independently embedded for the second time, and the embedded secret-carrying images do not influence the extraction of the embedded secret information and the recovery of the original image for the first time. In addition, according to the addition homomorphism characteristics of a two-layer embedding mode and a secret sharing scheme, secret information can be extracted without errors before and after decryption of the secret carrying text image, the separability of the algorithm is realized, the expansion of the secret text is reduced under the condition of ensuring high embedding capacity, the compression characteristic of an image secret sharing technology is utilized, the secret carrying text image generated by segmentation is compressed to half of the original image, the space for storing the secret text is effectively saved, and meanwhile, the high embedding capacity of the algorithm is also ensured.
The foregoing description is only an overview of the technical solutions of the present invention, and in order to make the technical means of the present invention more clearly understood, the present invention may be implemented according to the content of the description, and in order to make the above and other objects, features, and advantages of the present invention more apparent, the following detailed description will be given of preferred embodiments.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a flowchart of an embodiment of a ciphertext domain invertible information hiding method based on secret sharing of an image according to the present invention;
FIG. 2 is a diagram of an algorithm framework of the present invention;
FIG. 3 is a schematic diagram of the secret information embedding process of the present invention;
FIG. 4 is a diagram illustrating the process of secret information extraction and original image restoration according to the present invention;
FIG. 5 is a schematic view of an image organization structure of the ciphertext of the present invention;
FIG. 6 is a Lena image restored before and after homomorphic decryption according to the present invention;
FIG. 7 is a first ciphertext image of the present invention embedded with a first layer of secret information;
FIG. 8 is a second secret carrying ciphertext image embedded with a second layer of secret information according to the present invention;
FIG. 9 is a graph of embedding rate for various parameters of the present invention;
FIG. 10 is a chart showing the effect of twice embedding information on the image security of a Lena carrier according to the present invention;
fig. 11 is a graph of the quality of the restored image before and after homomorphic decryption.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to specific embodiments of the present invention, and it should be understood that the described embodiments are a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the specification of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
The key idea of the invention is to solve the problems that the current ciphertext domain reversible information hiding algorithm can not meet the information hiding requirement of multiple users, the fault tolerance and disaster resistance of the image carrying the ciphertext is not strong, the original image can not be reconstructed and the secret information can not be recovered once the ciphertext is attacked or damaged, and the like, and the invention aims to fully combine the technical advantages of image secret sharing with the ciphertext domain reversible information hiding algorithm, enhance the fault tolerance and disaster resistance of the image carrying the ciphertext by utilizing the disaster tolerance characteristic of the secret sharing technology, and improve the embedding capacity of the ciphertext domain reversible information hiding algorithm; by utilizing the addition homomorphism characteristic, the separability of extracting the secret information before and after decrypting the image of the secret-carrying text is realized, and the safety of the carrier image and the secret information is ensured. The invention is described below by means of specific examples.
Referring to fig. 1, a ciphertext domain reversible information hiding method based on image secret sharing includes the following steps:
s10, encrypting the original image to obtain a ciphertext image;
s20, embedding the first layer of secret information into the ciphertext image through the redundancy of the polynomial to obtain a secret image;
s30, dividing the secret image into a plurality of first secret carrying ciphertext images;
and S40, respectively embedding second-layer secret information into the multiple first secret-carrying text images by utilizing the homomorphism property of secret sharing to obtain multiple second secret-carrying text images.
S50, acquiring a second key corresponding to the second-layer secret information;
s60, directly extracting second-layer secret information from the second secret-carrying ciphertext image through the second key;
and the number of the first and second groups,
s70, collecting a plurality of different second secret-carrying ciphertext images;
s80, recovering the secret by using Lagrange interpolation polynomial and then homomorphically decrypting the second secret-carrying image;
and S90, after homomorphic decryption, recovering the original image and extracting the first-layer secret information by using the first key corresponding to the first-layer secret information and the third key corresponding to the ciphertext image.
Specifically, steps S10-S40 are encryption processes, steps S50-S60 are decryption processes performed when only one second encrypted ciphertext image is collected, and steps S70-S90 are decryption processes performed when multiple second encrypted ciphertext images are collected. Referring to fig. 4, fig. 4 is a frame diagram of the algorithm of the present invention, wherein the symbols in the diagram specifically mean: i is an original image; i iseIs a ciphertext image; msgaFor secret information to be embedded (i.e. the first in the above-mentioned method steps)Layer secret information); msgb={Msgb-1,Msgb-2,...,Msgb-nThe secret information to be embedded of n hidden participants (namely the second-layer secret information in the steps of the method); keAn image encryption key (i.e., the third key in the above method steps); kdHiding the key for the information (i.e. the first key in the above method step); kds={Kds-1,...,Kds-nInformation hiding keys (i.e. second keys in the above method steps) for n hidden participants; SIS Key ═ SIS Key1,...,SIS KeynIs participant attribute label; i isem={Iem-1,Iem-2,...,Iem-nN pieces of secret-carrying ciphertext images (namely the first secret-carrying ciphertext image in the steps of the method) after polynomial embedding;k parts of encrypted ciphertext images after homomorphic embedding; i isems={Iems-1,Iems-2,...,Iems-nAnd the n homomorphic embedded secret carrying images are the n homomorphic embedded secret carrying images (namely the second secret carrying image in the steps of the method).
Referring to FIG. 2, the image owner encrypts the original image I and sends the ciphertext image I using any symmetric encryption algorithmeTo the information-hiding person. The message-concealer first embeds the secret message Msg using polynomial redundancyaAnd dividing the secret image into multiple secret text images Iem={Iem-1,Iem-2,...,Iem-nEmbedding secret information Msg by using homomorphic property of secret sharing of a plurality of information hiding participantsb={Msgb-1,Msgb-2,...,Msgb-nGet the image I of the secret text embedded twiceems={Iems-1,Iems-2,...,Iems-n}. The receiver follows the corresponding key KdsCan be directly selected from IemsExtracting Msg from the extractbHowever, to recover I or extract secret information MsgaThen k different images of the secret-carrying text need to be collected firstRecovering the secret by utilizing Lagrange interpolation polynomial, then performing homomorphic decryption, and finally respectively using an image encryption key KeWith information hiding key KdRestoring the original image and extracting the secret information Msga。
Fig. 3 shows the process of embedding secret information: the embedding of the secret information is divided into two stages, firstly, the information is embedded in the redundancy of a polynomial by using a secret sharing method, a ciphertext image and the secret information are divided into a plurality of secret carrying ciphertext images and distributed to different users, and the method needs to extract the information after the secret is recovered; secondly, each user can independently carry out homomorphic embedding on the image of the secret-carrying text managed by the user, and the extraction of the information is completed before the secret recovery. The embedding of the information does not affect the restoration of the original image, i.e. the reconstructed image is distortion-free.
For the first stage, first, in the finite field GF (2)8) The Shamir (k, n) threshold image secret sharing scheme is constructed, and a k-1 degree polynomial F (x) a is generated0+a1x+...+nk-1xk-1(modq) having k available coefficients, assigning a replacement coefficient to the ciphertext image and the secret information based on the image compression coefficient w, and combining the ciphertext image I with the secret informationeAnd secret information MsgaEmbedded in the polynomial coefficients:
F(x)=a1+...+awxw-1+b1xw+...+bk-wxk-1(modq); wherein, a1,...,awAs a ciphertext pixel, b1,...,bk-wSecret information MsgaThe secret information is usually hidden with an information hiding key K before embeddingdAnd (4) encrypting.
Hiding a shared secret Key SISKey of a participant according to informationiDividing the secret to obtain multiple different secret-carrying text images Iem-iAnd distributed to the corresponding information hider pi. When secret is divided, the following equation system is satisfied:
wherein x isiFor sharing secret Key SIS Keyi,F(xi) Image I of secret text embedded in polynomialem-i。
By using homomorphism property of secret sharing technology, through carrying secret text image IemThe homomorphic addition operation of the secret information is realized. When embedding, secret information Msg is transformed using function ψ (·)bThen, with Iem-iPerforming homomorphic addition to obtain a secondary embedded secret carrying text Iems:
In order to improve the embedding efficiency, namely embedding secret information as much as possible by less modification, a steganography method of matrix coding is adopted. The embedding process is as follows: constructing a corresponding matrix code from a (7, 4) error correction code, from Iem-iThe 7 bits of a selected block of pixels form a group x ═ (x)1,...,x7)TAs an embedding carrier, the embedded message m ═ (m ═ is1,...,m4)TAnd calculating the syndrome s as m-Hx, finding the corresponding coset leader e in the decoding table, and satisfying the following conditions: he ═ s ═ m-Hx; and calculating y as x + e to obtain the embedded grouping y.
Fig. 4 shows a secret information extraction process, which can be mainly divided into the following two cases according to the different number of secret-carrying images involved in recovery:
only 1 secret-carrying ciphertext image I is collectedems-iThen, the secret key K is hidden according to the informationds-iSecret information Msg can be extractedb-iThe image I of the secret text can be recovered by the auxiliary informationem-i。
From the embedded packet y and the check matrix H, the embedded message m can be extracted:
Hy=H(x+e)=Hx+He
=m-s+s
=m;
collecting k partsImage carrying secret textFirstly, constructing Lagrange interpolation polynomial recovery secret by using attribute tag SISKey of information hiding participant to obtain ciphertext image I containing noisee' with secret information Msga'; then, according to the side information, homomorphic decryption is performed to remove noise.
According to the addition homomorphism characteristic of secret sharing, the recovered polynomial and the secret carrying text I after secondary embeddingemsThe following relationship is satisfied:
wherein e is1,f1,g1,h1As secret information MsgbThe associated constants can be determined by the following equation dimension one:
wherein psi (m)i) As secret information Msgb-iDue to (x)1,x2,...,xn) Are different from each other and therefore have a uniquely defined solution to the system of equations.
FIG. 5 is an image I of a ciphertextemsThe texture structure of (1) is mainly composed of two parts, namely, dense text pixelsAnd auxiliary information. In the homomorphic embedding process, with IemEmbedded as carrier to obtain portable pixelsAuxiliary information is generated at the same time.
The method and the device utilize the characteristics of the image secret sharing scheme to divide the secret image into a plurality of secret-carrying text images, and when part of the secret-carrying text images are damaged or lost, the lossless recovery and extraction can be still carried out through other k secret-carrying text images, so that the original image and the secret information have stronger fault tolerance. The first layer of secret information is embedded by using redundant parameters in the encryption process, the second layer of secret information is carried out by using the homomorphism characteristic of the encryption algorithm, the embedding capacity of the algorithm is effectively improved, and the embedding capacity of the algorithm is not limited by the carrier image. The secret image is divided into a plurality of shares by the characteristics of the secret sharing scheme and then stored by different participants, so that the secret is prevented from being excessively concentrated, and the secret is safely stored and risk is dispersed. In addition, each information hiding participant holds different secret-carrying images, the secret-carrying images can be respectively and independently embedded for the second time, and the embedded secret-carrying images do not influence the extraction of the embedded secret information and the recovery of the original image for the first time. In addition, according to the addition homomorphism characteristics of a two-layer embedding mode and a secret sharing scheme, secret information can be extracted without errors before and after decryption of the secret carrying text image, the separability of the algorithm is realized, the expansion of the secret text is reduced under the condition of ensuring high embedding capacity, the compression characteristic of an image secret sharing technology is utilized, the secret carrying text image generated by segmentation is compressed to half of the original image, the space for storing the secret text is effectively saved, and meanwhile, the high embedding capacity of the algorithm is also ensured.
Fig. 6 shows Lena images restored before and after homomorphic decryption, in which (a) is an original image, (b) is a noise-containing image restored before homomorphic decryption, and (c) is an image which is restored after homomorphic decryption and has noise removed, and the method is completely the same as the original image, and the method has complete reversibility of image restoration.
Based on the Shamir (3,4) threshold and the image compression ratio is 50%, fig. 7 and 8 respectively show the portable ciphertext images after embedding the secret information for the first time and the second time. FIG. 9 shows embedding rates under different parameters, where n represents the total number of shares into which a secret is divided, k represents the minimum value to reach the threshold, and 1/w represents the compression rate of the divided secret. Fig. 10 shows the influence of twice embedded information on the security of Lena carrier images, and compared with the PSNR and the information entropy of ciphertext images, the twice embedded secret-carrying images both conform to the characteristics of the ciphertext images, and no information related to the carrier images is leaked, thereby ensuring the security of the carrier images. Fig. 11 shows the quality of the restored image before and after homomorphic decryption, and the original image can be restored only by the image after homomorphic decryption.
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (6)
1. The ciphertext domain reversible information hiding method based on image secret sharing is characterized by comprising the following steps:
encrypting the original image to obtain a ciphertext image;
embedding first-layer secret information into the ciphertext image through polynomial redundancy to obtain a secret image;
dividing the secret image into a plurality of first secret-carrying ciphertext images;
and respectively embedding second-layer secret information into the multiple first secret carrying text images by utilizing the homomorphism property of secret sharing so as to obtain multiple second secret carrying text images.
2. The method for hiding reversible information in ciphertext domain based on image secret sharing according to claim 1, further comprising:
acquiring a second key corresponding to the second layer secret information;
directly extracting second-layer secret information from the second secret-carrying ciphertext image through a second secret key;
and the number of the first and second groups,
collecting a plurality of different second secret-carrying ciphertext images;
performing homomorphic decryption on the second secret-carrying text image after recovering the secret by using a Lagrange interpolation polynomial;
and after homomorphic decryption, recovering the original image and extracting the first layer of secret information by adopting a first key corresponding to the first layer of secret information and a third key corresponding to the ciphertext image.
3. The method according to claim 1, wherein the step of embedding the first layer of secret information into the ciphertext image through redundancy of a polynomial to obtain the secret image includes:
F(x)=a1+...+awxw-1+b1xw+...+bk-wxk-1(modq); wherein, a1,...,awAs ciphertext image pixels, b1,...,bk-wIs the first layer secret information.
4. The reversible information hiding method for ciphertext domain based on image secret sharing according to claim 1, wherein in the step of dividing the secret image into the plurality of first secret-carrying ciphertext images, the secret image division needs to satisfy the following equation set:
5. The reversible information hiding method for the ciphertext domain based on the image secret sharing as claimed in claim 1, wherein in the step of respectively embedding the second layer of secret information into the plurality of first secret-carrying images by using homomorphic property of the secret sharing to obtain the plurality of second secret-carrying images, homomorphic embedding of the second layer of secret information needs to satisfy the following equation set;
6. The method for hiding reversible information in ciphertext domain based on image secret sharing according to claim 2, wherein in the step of recovering the original image and extracting the first layer of secret information by using the first key corresponding to the first layer of secret information and the third key corresponding to the ciphertext image after the homomorphic decryption, the recovered polynomial and the second ciphertext-carrying image need to satisfy the following equation set;
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110600347.XA CN113190807B (en) | 2021-05-31 | 2021-05-31 | Ciphertext domain reversible information hiding method based on image secret sharing |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110600347.XA CN113190807B (en) | 2021-05-31 | 2021-05-31 | Ciphertext domain reversible information hiding method based on image secret sharing |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113190807A true CN113190807A (en) | 2021-07-30 |
CN113190807B CN113190807B (en) | 2023-05-12 |
Family
ID=76985818
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110600347.XA Active CN113190807B (en) | 2021-05-31 | 2021-05-31 | Ciphertext domain reversible information hiding method based on image secret sharing |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113190807B (en) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113992327A (en) * | 2021-11-16 | 2022-01-28 | 陕西师范大学 | Lossless approximate memory-sharing recovery method and system based on prime number decomposition |
CN114301583A (en) * | 2021-12-22 | 2022-04-08 | 阿里巴巴(中国)有限公司 | Ciphertext compression method, device, equipment and storage medium |
CN115225771A (en) * | 2022-07-08 | 2022-10-21 | 广东技术师范大学 | Method and device for hiding reversible information of encrypted image and computer equipment |
CN115242930A (en) * | 2022-05-26 | 2022-10-25 | 辽宁师范大学 | Cipher text domain extreme prediction double-layer reversible information hiding method based on secret sharing |
GB2617878A (en) * | 2022-04-22 | 2023-10-25 | Beijing Inst Graphic Communication | Halftone secret sharing and extracting method based on optimal data allocation |
CN117240435A (en) * | 2023-11-10 | 2023-12-15 | 广东技术师范大学 | Decoupled multiparty encryption domain reversible information hiding method |
CN117499030A (en) * | 2023-10-31 | 2024-02-02 | 广东技术师范大学 | Ciphertext domain multi-party mobile information hiding method and system based on hybrid encryption |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103414839A (en) * | 2013-07-25 | 2013-11-27 | 太原科技大学 | Graded-and-grouped secret image sharing method |
US20160189325A1 (en) * | 2014-12-30 | 2016-06-30 | University Of Macau | Method for reversible image data hiding |
CN112054900A (en) * | 2020-08-31 | 2020-12-08 | 中国人民武装警察部队工程大学 | Ciphertext domain reversible information hiding method and software and hardware application system |
CN112202984A (en) * | 2020-09-25 | 2021-01-08 | 中国人民武装警察部队工程大学 | Ciphertext domain reversible information hiding method based on error correction redundancy |
-
2021
- 2021-05-31 CN CN202110600347.XA patent/CN113190807B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103414839A (en) * | 2013-07-25 | 2013-11-27 | 太原科技大学 | Graded-and-grouped secret image sharing method |
US20160189325A1 (en) * | 2014-12-30 | 2016-06-30 | University Of Macau | Method for reversible image data hiding |
CN112054900A (en) * | 2020-08-31 | 2020-12-08 | 中国人民武装警察部队工程大学 | Ciphertext domain reversible information hiding method and software and hardware application system |
CN112202984A (en) * | 2020-09-25 | 2021-01-08 | 中国人民武装警察部队工程大学 | Ciphertext domain reversible information hiding method based on error correction redundancy |
Non-Patent Citations (2)
Title |
---|
BHARANIDHAR REDDY: "Reversible data hiding using lagrange’s interpolation in encrypted domain", 《IEEE》 * |
周能等: "基于秘密共享的同态加密图像可逆信息隐藏算法", 《科学技术与工程》 * |
Cited By (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113992327B (en) * | 2021-11-16 | 2023-10-20 | 陕西师范大学 | Lossless approximate split-memory recovery method and system based on prime number decomposition |
CN113992327A (en) * | 2021-11-16 | 2022-01-28 | 陕西师范大学 | Lossless approximate memory-sharing recovery method and system based on prime number decomposition |
CN114301583A (en) * | 2021-12-22 | 2022-04-08 | 阿里巴巴(中国)有限公司 | Ciphertext compression method, device, equipment and storage medium |
CN114301583B (en) * | 2021-12-22 | 2023-10-24 | 阿里巴巴(中国)有限公司 | Ciphertext compression method, ciphertext compression device, ciphertext compression equipment and storage medium |
GB2617878B (en) * | 2022-04-22 | 2024-05-29 | Beijing Inst Graphic Communication | Halftone secret sharing and extracting method based on optimal data allocation |
GB2617878A (en) * | 2022-04-22 | 2023-10-25 | Beijing Inst Graphic Communication | Halftone secret sharing and extracting method based on optimal data allocation |
CN115242930A (en) * | 2022-05-26 | 2022-10-25 | 辽宁师范大学 | Cipher text domain extreme prediction double-layer reversible information hiding method based on secret sharing |
CN115242930B (en) * | 2022-05-26 | 2023-07-07 | 辽宁师范大学 | Secret sharing-based ciphertext domain extreme prediction double-layer reversible information hiding method |
CN115225771B (en) * | 2022-07-08 | 2023-07-28 | 广东技术师范大学 | Method and device for hiding reversible information of encrypted image and computer equipment |
CN115225771A (en) * | 2022-07-08 | 2022-10-21 | 广东技术师范大学 | Method and device for hiding reversible information of encrypted image and computer equipment |
CN117499030A (en) * | 2023-10-31 | 2024-02-02 | 广东技术师范大学 | Ciphertext domain multi-party mobile information hiding method and system based on hybrid encryption |
CN117499030B (en) * | 2023-10-31 | 2024-06-18 | 广东技术师范大学 | Ciphertext domain multi-party mobile information hiding method and system based on hybrid encryption |
CN117240435A (en) * | 2023-11-10 | 2023-12-15 | 广东技术师范大学 | Decoupled multiparty encryption domain reversible information hiding method |
CN117240435B (en) * | 2023-11-10 | 2024-02-09 | 广东技术师范大学 | Decoupled multiparty encryption domain reversible information hiding method |
Also Published As
Publication number | Publication date |
---|---|
CN113190807B (en) | 2023-05-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN113190807B (en) | Ciphertext domain reversible information hiding method based on image secret sharing | |
Yu et al. | Reversible data hiding with hierarchical embedding for encrypted images | |
Qian et al. | Reversible data hiding in encrypted images with distributed source encoding | |
Wu et al. | A high-capacity reversible data hiding method for homomorphic encrypted images | |
Zheng et al. | Lossless data hiding algorithm for encrypted images with high capacity | |
Hajjaji et al. | A Watermarking of Medical Image: Method Based" LSB" | |
Su et al. | A high capacity reversible data hiding in encrypted AMBTC-compressed images | |
CN112054900A (en) | Ciphertext domain reversible information hiding method and software and hardware application system | |
Yin et al. | High capacity reversible steganography in encrypted images based on feature mining in plaintext domain | |
Hua et al. | Reversible data hiding over encrypted images via preprocessing-free matrix secret sharing | |
Gao et al. | High capacity reversible data hiding in encrypted image based on image encoding and POB | |
CN117294799A (en) | Ciphertext domain reversible hiding method based on image secret sharing and hierarchical embedding | |
CN108171665B (en) | Multi-version backup and restrictive dual authentication master key (t, s, k, n) image separate storage method | |
CN117041442A (en) | Image robust steganography method based on adaptive STC-ECC strategy | |
Neetha et al. | An efficient image encryption reversible data hiding technique to improve payload and high security in cloud platforms | |
Teotia et al. | Enhancing audio and video steganography technique using hybrid algorithm | |
Khan et al. | Advancements in reversible data hiding in encrypted images using public key cryptography | |
Shiu et al. | Reversible data hiding in permutation-based encrypted images with strong privacy | |
Abdelsatir et al. | A novel (k, n) secret sharing scheme from quadratic residues for grayscale Images | |
Chang et al. | Meaningful Shadows for Image Secret Sharing with Steganography and Authentication Techniques. | |
Anumol et al. | Enhanced security in medical image steganography-a hybrid approach using spatial and transform domain | |
Xiong et al. | Reversible Data Hiding in Shared Images With Separate Cover Image Reconstruction and Secret Extraction | |
Raju et al. | Modified encryption standard for reversible data hiding using AES and LSB steganography | |
Sharma et al. | An analysis of reversible data hiding algorithms for encrypted domain | |
Lai et al. | High Embedding Capacity Data Hiding Technique Based on Hybrid AMBTC and LSB Substitutions |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |