CN114666453B - Separable ciphertext domain reversible data hiding method based on bit plane segmentation - Google Patents
Separable ciphertext domain reversible data hiding method based on bit plane segmentation Download PDFInfo
- Publication number
- CN114666453B CN114666453B CN202210316358.XA CN202210316358A CN114666453B CN 114666453 B CN114666453 B CN 114666453B CN 202210316358 A CN202210316358 A CN 202210316358A CN 114666453 B CN114666453 B CN 114666453B
- Authority
- CN
- China
- Prior art keywords
- blocks
- block
- image
- key
- matrix
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 230000002441 reversible effect Effects 0.000 title claims abstract description 26
- 230000011218 segmentation Effects 0.000 title claims abstract description 8
- 239000011159 matrix material Substances 0.000 claims abstract description 76
- 238000011084 recovery Methods 0.000 claims description 6
- 230000006835 compression Effects 0.000 claims description 4
- 238000007906 compression Methods 0.000 claims description 4
- 238000013075 data extraction Methods 0.000 claims description 4
- 238000012163 sequencing technique Methods 0.000 claims description 4
- WYTGDNHDOZPMIW-RCBQFDQVSA-N alstonine Natural products C1=CC2=C3C=CC=CC3=NC2=C2N1C[C@H]1[C@H](C)OC=C(C(=O)OC)[C@H]1C2 WYTGDNHDOZPMIW-RCBQFDQVSA-N 0.000 claims description 3
- 239000000203 mixture Substances 0.000 claims 1
- 238000005516 engineering process Methods 0.000 abstract description 6
- 239000000284 extract Substances 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 8
- 235000002566 Capsicum Nutrition 0.000 description 4
- 239000006002 Pepper Substances 0.000 description 4
- 241000722363 Piper Species 0.000 description 4
- 235000016761 Piper aduncum Nutrition 0.000 description 4
- 235000017804 Piper guineense Nutrition 0.000 description 4
- 235000008184 Piper nigrum Nutrition 0.000 description 4
- 238000000605 extraction Methods 0.000 description 3
- 150000003839 salts Chemical class 0.000 description 3
- 238000010008 shearing Methods 0.000 description 3
- 241001504519 Papio ursinus Species 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 235000012434 pretzels Nutrition 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 238000012827 research and development Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012706 support-vector machine Methods 0.000 description 1
Images
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/44—Secrecy systems
- H04N1/4446—Hiding of documents or document information
-
- 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
- G06T1/005—Robust watermarking, e.g. average attack or collusion attack resistant
- G06T1/0064—Geometric transfor invariant watermarking, e.g. affine transform invariant
-
- 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/32288—Multiple embedding, e.g. cocktail embedding, or redundant embedding, e.g. repeating the additional information at a plurality of locations in the image
- H04N1/32299—Multiple embedding, e.g. cocktail embedding, or redundant embedding, e.g. repeating the additional information at a plurality of locations in the image using more than one embedding method
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2201/00—General purpose image data processing
- G06T2201/005—Image watermarking
- G06T2201/0065—Extraction of an embedded watermark; Reliable detection
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Editing Of Facsimile Originals (AREA)
- Image Processing (AREA)
Abstract
The invention discloses a separable ciphertext domain reversible data hiding method based on bit plane segmentation, which comprises the steps of firstly providing a block classification scrambling algorithm and a traversal matrix encryption algorithm to complete original image encryption; then realizing watermark image encryption by utilizing Hilbert curve encryption; in the ciphertext domain, an all-bit-plane scrambling technology is adopted, bit-plane rotation is firstly implemented, then blocks are classified into continuous blocks and discontinuous blocks, and finally reversible data hiding is realized according to a pixel prediction method. Meanwhile, the invention realizes that the secret keys can be separated, the hidden watermark can be extracted by having the hidden secret key, the original image can be recovered by having the encryption secret key, and the watermark image can be extracted and the original image can be recovered by having the double secret keys. The invention realizes 100% reversibility based on pixel prediction, can extract watermark images without errors, can recover original images by 100%, and has high safety, large capacity, high quality and good robustness.
Description
Technical Field
The invention relates to a reversible data hiding method of a ciphertext domain, in particular to a reversible data hiding method of a separable ciphertext domain based on bit plane segmentation.
Background
The information hiding technology stands out from a plurality of encryption technologies by virtue of the functions of integrity authentication, copyright protection and the like, and reversible data hiding is an information hiding technology capable of recovering an original image in a lossless manner and extracting information without errors. However, the conventional reversible data hiding has a potential safety hazard of exposing an original image, so that the ciphertext-domain reversible data combining the encryption technology and the reversible data hiding is hidden as a hot spot of academic interest.
The ciphertext domain reversible information hiding (Reversible Data Hiding in Encrypted Image, RDHEI) can hide information while protecting the image content from leakage, and a user can decrypt the image content, extract hidden information and recover the original image in a lossless manner according to the owned key types and own requirements, thereby being beneficial to guaranteeing the confidentiality and usability of the image. The original RDHEI algorithm was to make room after image encryption, i.e., reversible information hiding based on VRAE (Vacating Room After Encryption) framework and symmetrically encrypted ciphertext.
As early as 2008, puech et al have hidden additional information in each block by dividing the encrypted image, and finally have completed information extraction and image recovery by using the local standard deviation of the image pixels, but this method has not been focused on by researchers; zhang encrypts an original image by using a stream cipher, then divides the encrypted image into blocks with the same size, and conceals additional information by turning LSBs of part of pixels in the blocks, wherein the algorithm can realize better performance by using natural image pixel correlation; zhou et al propose to use two types of support vector machine classifiers to distinguish image regions during the decoding stage, thereby extracting information and recovering images. However, the above-described classical rdi methods have a common application limitation in that the information extraction and image restoration processes of the algorithm are not separable.
In order to solve the problem, ge and the like scramble the encrypted image blocks by using a stream cipher, then information hiding is realized by adopting a histogram shifting method, and finally, information is extracted at a receiver and the image is restored in a lossless manner according to a scrambling key and an encryption key; zhang et al propose a high-fidelity thumbnail protection encryption scheme, which not only accurately realizes encryption and decryption, but also has a thumbnail closer to the original plaintext image and lower noise; wang et al rearrange and encrypt all pixel blocks and conceal the information by adaptively predicting MSB (Most Significant Bit, MSB), which fully exploits intra-block pixel correlation, improving embedding capacity.
With the continuous improvement of the data security demands at home and abroad, a ciphertext domain reversible information hiding algorithm based on symmetric encryption and RRBE (Reserving Room Before Encryption) frames and public key/homomorphic encryption is widely paid attention to by students. Puteaus et al propose that ciphertext domain information hiding does not need to consider the problem of image visual quality after encryption and hiding, so that additional information is embedded by adopting image highest bit plane substitution, and therefore, a higher effective load is obtained. Chen et al uses a method of combining stream cipher and position scrambling to generate a ciphertext image, and reserves space to embed additional information by a multi-MSB compression method, so that the method can resist various attacks and effectively improve the capacity. Ke et al devised a LSB information hiding method based on key exchange, which realized that information was directly extracted from the encrypted domain without the need of a private key.
However, the VRAE framework has its own limitations, such as error rate may occur in data extraction or image recovery, and complete reversibility cannot be achieved; some are inseparable during information extraction and image retrieval.
Disclosure of Invention
The invention aims to solve the technical problems in the prior art and provides a separable ciphertext domain reversible data hiding method based on bit plane segmentation.
The technical scheme of the invention is as follows: a separable ciphertext domain reversible data hiding method based on bit plane segmentation is characterized by comprising the following steps of:
step 1: block classified scrambling encryption and traversal matrix encryption of original images
Step 1.1, dividing an original image with the size of M×N into p×q non-overlapping sub-blocks with the size of m×n, wherein p=M/M and q=N/N;
step 1.2, dividing the sub-blocks into brightness blocks and darkness blocks according to a formula (1), and marking the brightness blocks with 1 and the darkness blocks with 0 to generate a classification chart B;
in the formula (1), num represents the number of pixels with gray values greater than or equal to 127 in the sub-block, i epsilon (1, 2,3 … p) and j epsilon (1, 2,3 … q);
step 1.3 Huffman compression coding is carried out on the classification chart B, and the coded data is used as a secret key K 1 Preserving;
step 1.4, traversing the classification chart B to rearrange, placing all brightness blocks in front of darkness blocks, rearranging the brightness blocks according to the original sequence, rearranging the darkness blocks in reverse sequence, and obtaining a block classified and scrambled image;
step 1.5 generating a random number sequence L of length m×n using equation (2) 1 3.5699456 in<μ≤4，0<x<1, the random number sequence L 1 Unordered and non-repeating, the initial values μ and x in equation (2) 0 As secret key K 2 Preserving;
x k+1 ＝μx k (1-x k ) (2)
step 1.6 random number sequence L 1 Sequencing, and marking the sequence after sequencing as L 2 According to L 1 And L is equal to 2 Generating a number pair, and constructing a traversal matrix according to the corresponding relation of the number pair;
step 1.7, performing matrix traversing encryption for multiple times by taking the sub-blocks of the image after the block classification scrambling as a unit to obtain a ciphertext image, wherein the matrix traversing encryption is to rearrange pixels in the sub-blocks according to a constructed traversing matrix, and the number of matrix traversing encryption is taken as a secret key K 3 Preserving;
step 2: watermark image encryption
Dividing the watermark image into non-overlapped 8 multiplied by 8 sub-blocks, traversing all the sub-blocks in a serpentine mode preferentially in the horizontal direction, and traversing all pixel points in each sub-block in a non-crossing mode according to a Hilbert curve to generate one-dimensional data;
step 3: the reversible data hiding of the ciphertext domain comprises the following specific steps:
step 3.1: carrying out full-bit plane scrambling on the ciphertext image, namely combining the highest bits of 8 different pixels into a new 1X 8 matrix, combining the seventh bits of 8 different pixels into a new 1X 8 matrix, and the like, finally combining the lowest bits of 8 different pixels into a new 1X 8 matrix, and recombining the 8 new 1X 8 matrices into an 8X 8 matrix to obtain the ciphertext image subjected to full-bit plane scrambling;
step 3.2, respectively forming the first 4 elements and the last 4 elements of the same bit in each row of the new bit plane of the ciphertext image after the full bit plane scrambling into 2X 2 sub-blocks;
step 3.3, scanning all generated 2×2 sub-blocks, and classifying all 2×2 sub-blocks into a continuous block and a discontinuous block, wherein the continuous block is a2×2 sub-block with all pixels in the block being 1 or 0, and the discontinuous block is a2×2 sub-block with pixels in the block having 0 and 1; with 1 representing a continuous block, 0 representing a discontinuous block, generating a block tag matrix, and using the block tag matrix as a key K 4 Preserving;
step 3.4 rearranges all 2×2 sub-blocks according to the order of preceding non-consecutive blocks of consecutive blocks to obtain 8 new bit-plane matrices rearranged based on 2×2 sub-blocks;
step 3.5 for consecutive blocks in the new bit plane matrix, the position of the pos in the block is a reserved position, the remaining three positions are respectively embedded with 1 bit of data to obtain a consecutive block after embedding data, the pos is calculated according to formula (3), wherein MOD (·) is a modulo function, INT (·) is a downward rounding function, K 5 Is a random number as a secret key K 5 Preserving;
pos＝MOD(INT(K 5 3 ),4) (3)
step 3.6, regarding a discontinuous block in the new bit plane matrix, wherein the position of a pos in the block is a predicted position, the value of the predicted position is a predicted value, and the pos is calculated according to a formula (3);
step 3.7, determining the value of the predicted position, i.e. the predicted value p,
when the predicted value is the same as the predicted value, the discontinuous block is an embeddable block, 1 bit of data is embedded in the predicted position, otherwise, the discontinuous block is a non-embeddable block, and the discontinuous block after the data is embedded is obtained; marking embeddable blocks with 1 and non-embeddable blocks with 0, generating a sequence L with the same length as the number of blocks, and taking L as a secret key K 6 Preserving;
step 3.8, all one-dimensional data are embedded into the sub-blocks, and the recording block is embedded into the end position of the label to be used as a secret key K 7 Saving, namely recombining 8bit planes embedded by one-dimensional data into an image to obtain a ciphertext image containing the watermark;
Using encryption key K 1 -K 4 The method for extracting the decrypted image from the ciphertext image containing the watermark comprises the following specific steps:
step 4.1 Using Key K 4 Obtaining a block tag matrix, rearranging blocks to obtain a new bit plane;
step 4.2, performing inverse 90-degree rotation on the new bit plane to obtain an original bit plane;
step 4.3, converting 8-bit binary of each row of the original bit plane into a decimal gray value, and combining all gray values into a ciphertext image;
step 4.4 Using Key K 2 Constructing a traversal matrix;
step 4.5 Using Key K 3 Performing inverse matrix decryption on the ciphertext image to obtain a decrypted image matrix;
step 4.6 Using Key K 1 Rearranging the brightness blocks and darkness blocks to obtain a decrypted image;
using encryption key K 5 -K 7 The watermark image is extracted from the ciphertext image containing the watermark, and the specific steps are as follows:
step 4.7 Using Key K 5 Determining a data embedding position;
step 4.8 Using Key K 7 The reading block is embedded into the label end position;
step 4.9, for the continuous blocks, sequentially reading all values except the determined positions to obtain data embedded into the continuous blocks;
step 4.10 Using Key K 6 Dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.11, extracting a value for determining the data position in the embeddable block to obtain data in the discontinuous block;
step 4.12, decrypting data based on the Hilbert curve to obtain a watermark image;
step 4.13 Using Key K 5 Determining the data embedding position and the reserved position by using the secret key K 7 The reading block is embedded into the label end position;
step 4.14, for the continuous blocks, reading the values of the reserved positions, and replacing all the values in the current block with the reserved position values;
step 4.15, for the non-continuous blocks, dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.16, for the embeddable block, reading the values of three other positions except the embedding position, if the number of 1 in the three values is more, setting the embedding position value as 1, otherwise, setting the embedding position value as 0, and obtaining the restored ciphertext image;
the method adopts double secret keys to extract watermark images from ciphertext images containing the watermark and obtain original images, and comprises the following specific steps:
step 4.17 Using Key K 5 Determining a data embedding position;
step 4.18 Using Key K 7 The reading block is embedded into the label end position;
step 4.19, for the continuous blocks, sequentially reading all values except the determined positions to obtain data embedded in the continuous blocks;
step 4.20 Using Key K 6 Dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.21, extracting a value for determining the data position in the embeddable block to obtain data in the discontinuous block;
step 4.22, decrypting data based on the Hilbert curve to obtain a watermark image;
step 4.23 Using Key K 5 Determining the data embedding position and the reserved position by using the secret key K 7 The reading block is embedded into the label end position;
step 4.24, for the continuous blocks, reading the values of the reserved positions, and replacing all the values in the current block with the reserved position values;
step 4.25, for the non-continuous blocks, dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.26, for the embeddable block, reading the values of three other positions except the embedding position, if the number of 1 in the three values is more, setting the embedding position value as 1, otherwise, setting the embedding position value as 0, and obtaining the restored ciphertext image;
step 4.27 Using Key K 4 Obtaining a block tag matrix, and rearranging blocks of the restored ciphertext image to obtain a new bit plane;
step 4.28, performing inverse 90-degree rotation on the new bit plane to obtain an original bit plane;
step 4.29, converting 8-bit binary of each row of the original bit plane into a decimal gray value, and combining all gray values into a ciphertext image;
step 4.30 Using Key K 2 Constructing a traversal matrix;
step 4.31 Using Key K 3 Performing inverse matrix decryption on the ciphertext image to obtain a decrypted image matrix;
step 4.32 Using Key K 1 And rearranging the brightness blocks and the darkness blocks to obtain an original image.
Firstly, a block classification scrambling algorithm and a traversal matrix encryption algorithm are provided to complete the encryption of an original image; then realizing watermark image encryption by utilizing Hilbert curve encryption; in the ciphertext domain, an all-bit-plane scrambling technology is adopted, bit-plane rotation is firstly implemented, then blocks are classified into continuous blocks and discontinuous blocks, and finally reversible data hiding is realized according to a pixel prediction method. Meanwhile, the invention realizes that the secret keys can be separated, the hidden watermark can be extracted by having the hidden secret key, the original image can be recovered by having the encryption secret key, and the watermark image can be extracted and the original image can be recovered by having the double secret keys. The invention realizes 100% reversibility based on pixel prediction, can extract watermark images without errors, can recover original images by 100%, and has high safety, large capacity, high quality and good robustness.
Drawings
FIG. 1 is a flow chart of an embodiment of the present invention.
Fig. 2 is an original image of an embodiment of the present invention.
FIG. 3 is a block sort scrambling diagram of an embodiment of the present invention.
Fig. 4 is a schematic diagram of a traversing matrix encryption principle according to an embodiment of the present invention.
Fig. 5 is a ciphertext image of an embodiment of the invention.
Fig. 6 is a histogram of an original image according to an embodiment of the present invention.
Fig. 7 is a histogram of a ciphertext image of an embodiment of the invention.
Fig. 8 is a watermark image of an embodiment of the invention.
Fig. 9 is an encryption schematic of a Hilbert curve according to an embodiment of the present invention.
FIG. 10 is a schematic diagram of an embodiment of an all-bit-plane scrambling.
FIG. 11 is a bit-plane block diagram of an embodiment of the present invention.
FIG. 12 is a block diagram of an embodiment of the invention.
FIG. 13 is a schematic diagram of a consecutive block reservation location according to an embodiment of the present invention
FIG. 14 is a schematic diagram of a non-continuous block and embedded position according to an embodiment of the present invention.
Fig. 15 is a decrypted image of an embodiment of the present invention.
Fig. 16 is an original image and an extracted watermark image recovered after a salt and pepper noise attack in accordance with an embodiment of the present invention.
Fig. 17 is a ciphertext image, a recovered original image, and an extracted watermark image after a shear attack in accordance with an embodiment of the invention.
Detailed Description
The separable ciphertext domain reversible data hiding method based on bit plane segmentation, as shown in figure 1, sequentially comprises the following steps:
step 1: block classified scrambling encryption and traversal matrix encryption of original images
Step 1.1 (a-f) 6 standard gray scale raw images of 128×128 size of fig. 2: lena, baboon, boat, pepper, barbara, airplane divided into p×q non-overlapping sub-blocks of size m×n, p=m/M, q=n/N;
step 1.2, dividing the sub-blocks into brightness blocks and darkness blocks according to a formula (1), and marking the brightness blocks with 1 and the darkness blocks with 0 to generate a classification chart B;
in the formula (1), num represents the number of pixels with gray values greater than or equal to 127 in the sub-block, i epsilon (1, 2,3 … p) and j epsilon (1, 2,3 … q);
step 1.3 pairThe classification diagram B carries out Huffman compression coding, and takes coded data as a secret key K 1 Preserving;
step 1.4, traversing the classification chart B to rearrange, placing all brightness blocks in front of darkness blocks, rearranging the brightness blocks according to the original sequence, rearranging the darkness blocks in reverse sequence, and obtaining a block classified and scrambled image;
for example, the original image of 16×16 shown in fig. 3a is divided into non-overlapping 4×4 sub-blocks, the classification matrix and the scrambled matrix are shown in formula B, B', the scrambled image is shown in fig. 3b, where white represents a pixel gray value of 127 (luminance block) or more, and black represents a pixel gray value of 127 (darkness block) or less;
step 1.5 As shown in FIGS. 4a and 4b, matrix traversal encryption is performed with the scrambled image sub-blocks as a unit, and a random number sequence L with a length of m×n is generated by using the formula (2) 1 3.5699456 in<μ≤4，0<x<1, the random number sequence L 1 Unordered and non-repetitive, so that in the process of generating random numbers, if the same data is encountered, the data is regenerated after deletion, and the initial values mu and x in the formula (2) are calculated 0 As secret key K 2 Preserving;
x k+1 ＝μx k (1-x k ) (2)
for example, for a 4×4 sub-block, K 2 Generating a random sequence L with the length of 16 as a secret key 1 Wherein each numbered (i) represents its location:
L 1 ＝{0.4523(1),0.9537(2),0.1698(3),0.5429(4),0.9554(5),0.1639(6),0.5277(7),0.9595(8),0.1495(9),0.4894(10),0.9621(11),0.1405(12),0.4649(13),0.9578(14),0.1557(15),0.5062(16)}；
step 1.6 random number sequence L 1 The sequence of the sequences is carried out,the ordered array is denoted as L 2 I in (i, j) after each number represents the position of its value in the original sequence, j represents the position in the ordered sequence:
L 2 ＝{0.1405(12,1),0.1495(9,2),0.1557(15,3),0.1639(6,4),0.1698(3,5),0.4523(1,6),0.4649(13,7),0.4894(10,8),0.5062(16,9),0.5277(7,10),0.5429(4,11),0.9537(2,12),0.9554(5,13),0.9578(14,14),0.9595(8,15),0.9621(11,16)}；
according to L 1 And L is equal to 2 Generating a pair of numbers, (1, 6) (2, 12) (3, 5) (4, 11) (5, 13) (6, 4) (7, 10) (8, 15) (9, 2) (10, 8) (11, 16) (12, 1) (13, 7) (14, 14) (15, 3) (16, 9)
According to the corresponding relation of the data pairs, the constructed traversal matrix is as follows:
step 1.7, performing matrix traversing encryption for multiple times by taking the image sub-blocks after the block classification scrambling as a unit to obtain a ciphertext image, wherein the matrix traversing encryption is to rearrange pixels in the sub-blocks according to a constructed traversing matrix, the primary matrix traversing encryption matrix and the secondary matrix traversing encryption matrix are respectively shown in fig. 4c and 4d, and the matrix traversing encryption times are used as secret keys K 3 Preserving;
the obtained ciphertext image is shown in fig. 5, and is similar to noise in terms of encryption effect, has low correlation, and cannot acquire original image detail information; FIG. 6 is a histogram of an original image, and FIG. 7 is a histogram of a ciphertext image, wherein the ciphertext image is uniformly distributed in terms of pixel spatial distribution and cannot be fitted to the pixel distribution of the original image;
table 1 shows the information entropy, NPCR, UACI of the original image and the ciphertext image, and the closer the information entropy value is 8, the better the image randomness, and the weaker the pixel correlation.
TABLE 1
As can be seen from table 1, the information entropy of the original image is about 6.7, and the ciphertext image is about 7.9; the NPCR and UACI are used for measuring the distinction between the original image and the ciphertext image, the NPCR value is more than 99 percent, and the UACI value is less than 17 percent; in conclusion, the ciphertext image and the original image have large difference, and the pixel distribution randomness of the ciphertext image is stronger, which indicates that the encryption used for the original image has strong security.
Step 2: watermark image encryption
Dividing the gray watermark image with the size of 64 multiplied by 64 shown in fig. 8 into non-overlapped 8 multiplied by 8 sub-blocks, preferably traversing all the sub-blocks in a serpentine mode in the horizontal direction as shown in fig. 9a-d, and generating one-dimensional data by traversing all pixel points in each sub-block in a Hilbert curve without crossing;
step 3: the reversible data hiding of the ciphertext domain comprises the following specific steps:
step 3.1, as shown in fig. 10a-c, performing full-bit plane scrambling on the ciphertext image, namely combining the highest bits of 8 different pixels into a new 1×8 matrix, combining the seventh bits of 8 different pixels into a new 1×8 matrix, and the like, finally combining the lowest bits of 8 different pixels into a new 1×8 matrix, and then recombining the 8 new 1×8 matrices into an 8×8 matrix to obtain the ciphertext image after full-bit plane scrambling;
step 3.2 as shown in fig. 11, the first 4 elements and the last 4 elements of each row of the same bit in the new bit plane of the ciphertext image after the full bit plane scrambling are respectively formed into 2×2 sub-blocks;
step 3.3 as shown in fig. 12, scanning all 2×2 sub-blocks generated, classifying all 2×2 sub-blocks into a continuous block and a discontinuous block, wherein the continuous block is a2×2 sub-block with all pixels in the block being 1 or 0, and the discontinuous block is a2×2 sub-block with pixels in the block having 0 and 1; with 1 representing a continuous block, 0 representing a discontinuous block, generating a block tag matrix, and using the block tag matrix as a key K 4 Preserving;
step 3.4 rearranges all 2×2 sub-blocks according to the order of preceding non-consecutive blocks of consecutive blocks to obtain 8 new bit-plane matrices rearranged based on 2×2 sub-blocks;
step 3.5 for consecutive blocks in the new bit plane matrix, the position of the pos in the block is a reserved position, the remaining three positions are respectively embedded with 1 bit of data to obtain a consecutive block after embedding data, the pos is calculated according to formula (3), wherein MOD (·) is a modulo function, INT (·) is a downward rounding function, K 5 Is a random number as a secret key K 5 Preserving;
pos＝MOD(INT(K 5 3 ),4) (3)
the reserved positions when pos=0, 1,2,3 are shown in fig. 13;
step 3.6 for non-consecutive blocks in the new bit-plane matrix, the position of the pos in the block is the predicted position, the value of the predicted position is the predicted value, the pos is calculated according to equation (3), assuming K 5 =17, pos=1;
step 3.7, determining the value of the predicted position, i.e. the predicted value p,
when the predicted value is the same as the predicted value, the discontinuous block is an embeddable block, 1 bit of data is embedded in the predicted position, otherwise, the discontinuous block is a non-embeddable block, and the discontinuous block after the data is embedded is obtained; marking embeddable blocks with 1 and non-embeddable blocks with 0, generating a sequence L with the same length as the number of blocks, and taking L as a secret key K 6 Preserving;
in fig. 14a, the black frame is the predicted position, the sum of three pixels surrounding the element is 1, the predicted value is p=0, and the predicted value is the same as the position value, so the block is an embeddable block, that is, the position can be used for embedding information, and the surrounding three pixels can be fully recovered during recovery; in fig. 14b, the black frame is the predicted position, the predicted value is 0, but because the sum of the surrounding three pixels is 1, the predicted value is 1, and the predicted value is not equal to 0, the block is not embeddable; FIG. 14c is a schematic view of a black border in an embeddable position;
step 3.8 embedding all one-dimensional data into sub-blocksRecording block is embedded into the end position of the label as key K 7 Saving, namely recombining 8bit planes embedded by one-dimensional data into an image to obtain a ciphertext image containing the watermark;
table 2 shows the results of capacity analysis of 6 images, and the unit of data in the table is bpp. The capacity of the algorithm is one of important indexes for measuring the performance of the algorithm, the higher the capacity is, the more user requirements can be met, the full-bit plane embedding strategy has obvious advantages in the aspect of embedding capacity, in theory, any pixel is converted into 8bit binary system, every 4 bits forms 12×2 sub-blocks, 2 sub-blocks are totally, if the 2 sub-blocks are all continuous blocks, 2×3=6 bit information can be embedded, and therefore, the highest capacity can reach 6bpp in theory.
TABLE 2
As can be seen from table 2: the invention has higher theoretical capacity and actual capacity.
Table 3 shows the embedding capacity of 6 images in different algorithms.
TABLE 3 Table 3
As can be seen from Table 3, the embedding capacity of the present invention is much higher than that of the documents [1,2,3,4], and the average values of the embedding capacities are about 70 times, 41 times, 2.83 times, and 1.27 times, respectively, of these algorithms.
Using encryption key K 1 -K 4 The method for extracting the decrypted image from the ciphertext image containing the watermark comprises the following specific steps:
step 4.1 Using Key K 4 Obtaining a block tag matrix, rearranging blocks to obtain a new bit plane;
step 4.2, performing inverse 90-degree rotation on the new bit plane to obtain an original bit plane;
step 4.3, converting 8-bit binary of each row of the original bit plane into a decimal gray value, and combining all gray values into a ciphertext image;
step 4.4 Using Key K 2 Constructing a traversal matrix;
step 4.5 Using Key K 3 Performing inverse matrix decryption on the ciphertext image to obtain a decrypted image matrix;
step 4.6 Using Key K 1 Rearranging the brightness blocks and darkness blocks to obtain a decrypted image as shown in fig. 15;
from the visual effect of fig. 15, it is difficult to see the difference of the decrypted image from the original image.
Table 4 is PNSR values of the decrypted image and the original image according to the embodiment of the present invention.
TABLE 4 Table 4
As can be seen from table 4, the peak signal-to-noise value of the decrypted image to the original image is high, with the airland image PNSR being as high as 69.9710 and the lowest value Baboon image being 55.5628.
Table 5 shows the image quality results of the present invention and the different algorithms.
TABLE 5
As can be seen from Table 5, the average PSNR of the present invention is as high as 64.64dB, which is far higher than the algorithms of the documents [1,2,4,5,6], and has good decryption image quality.
Using encryption key K 5 -K 7 The watermark image is extracted from the ciphertext image containing the watermark, and the specific steps are as follows:
step 4.7 Using Key K 5 Determining a data embedding position;
step 4.8 Using Key K 7 The reading block is embedded into the label end position;
step 4.9, for the continuous blocks, sequentially reading all values except the determined positions to obtain data embedded into the continuous blocks;
step 4.10 Using Key K 6 Dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.11, extracting a value for determining the data position in the embeddable block to obtain data in the discontinuous block;
step 4.12, decrypting data based on the Hilbert curve to obtain a watermark image;
step 4.13 Using Key K 5 Determining the data embedding position and the reserved position by using the secret key K 7 The reading block is embedded into the label end position;
step 4.14, for the continuous blocks, reading the values of the reserved positions, and replacing all the values in the current block with the reserved position values;
step 4.15, for the non-continuous blocks, dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.16, for the embeddable block, reading the values of three other positions except the embedding position, if the number of 1 in the three values is more, setting the embedding position value as 1, otherwise, setting the embedding position value as 0, and obtaining the restored ciphertext image;
the method adopts double secret keys to extract watermark images from ciphertext images containing the watermark and obtain original images, and comprises the following specific steps:
step 4.17 Using Key K 5 Determining a data embedding position;
step 4.18 Using Key K 7 The reading block is embedded into the label end position;
step 4.19, for the continuous blocks, sequentially reading all values except the determined positions to obtain data embedded in the continuous blocks;
step 4.20 Using Key K 6 Dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.21, extracting a value for determining the data position in the embeddable block to obtain data in the discontinuous block;
step 4.22, decrypting data based on the Hilbert curve to obtain a watermark image;
and 4, step 4.23 use of Key K 5 Determining the data embedding position and the reserved position by using the secret key K 7 The reading block is embedded into the label end position;
step 4.24, for the continuous blocks, reading the values of the reserved positions, and replacing all the values in the current block with the reserved position values;
step 4.25, for the non-continuous blocks, dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.26, for the embeddable block, reading the values of three other positions except the embedding position, if the number of 1 in the three values is more, setting the embedding position value as 1, otherwise, setting the embedding position value as 0, and obtaining the restored ciphertext image;
step 4.27 Using Key K 4 Obtaining a block tag matrix, and rearranging blocks of the restored ciphertext image to obtain a new bit plane;
step 4.28, performing inverse 90-degree rotation on the new bit plane to obtain an original bit plane;
step 4.29, converting 8-bit binary of each row of the original bit plane into a decimal gray value, and combining all gray values into a ciphertext image;
step 4.30 Using Key K 2 Constructing a traversal matrix;
step 4.31 Using Key K 3 Performing inverse matrix decryption on the ciphertext image to obtain a decrypted image matrix;
step 4.32 Using Key K 1 Rearranging the brightness blocks and darkness blocks to obtain an original image;
table 6 is the extracted watermark to original watermark similarity value NCC and the peak signal to noise ratio PSNR of the restored image to the original image.
TABLE 6
As can be seen from table 6, the similarity between the watermark extracted from 6 ciphertext images containing the watermark and the original watermark is 1, and the PSNR of the restored image and the original image is + -infinity, so that 100% reversibility is realized.
Fig. 16 is an original image restored after a salt and pepper noise attack with a coefficient of 0.05 and an extracted watermark image, fig. 16a1-f1 is the original image restored after the attack, and fig. 16a2-f2 is the extracted watermark image after the attack according to the embodiment of the present invention. Under noise attack, the watermark image extracted by the embodiment of the invention and the restored original image are clear and visible, and certain robustness is realized.
Table 7 is NCC values for the original watermark image and the extracted watermark image under the attack of pretzel noise.
TABLE 7
As can be seen from Table 7, the NCC values of the original watermark image and the extracted watermark image in the embodiment of the invention are above 0.99, and the similarity is extremely high, which indicates that the invention can effectively resist the attack of salt and pepper noise.
Fig. 17a1-f1 are ciphertext images after shearing attack at different positions, fig. 17a2-f2 are restored original images, and fig. 17a3-f3 are extracted watermark images, so that under the shearing attack, both the restored original images and the extracted watermark images are clearly visible.
Table 8 is NCC values for the original watermark image and the extracted watermark image under different positions and different proportions of shear attacks.
TABLE 8
As can be seen from Table 8, the NCC values of the original watermark image and the extracted watermark image are above 0.98, which shows that the invention can effectively resist shearing attack.
Reference is made to:
[1]Qin Chuan,Zhang Wei,Cao Fang,et al.Separable reversible data hiding in encrypted images via adaptive embedding strategy with block selection[J].Signal Processing,2018,153:109-122
[2] huang Mengxue and Red Jie, chen Fan separable encryption domain reversible information hiding against ciphertext-only attacks [ J ]. Computer aided design and graphics theory, 2020,32 (6): 874-882
[3] Yang Yang, li Xinran, hu Jinchuan. Encryption domain reversible information hiding based on block reconstruction [ J ]. Application science fiction, 2021,39 (06): 906-922.
[4] Yang Yaolin and Hongjie, chen Fan. Original long meaning. Image encryption reversible data hiding based on prediction error adaptive coding [ J ]. Computer research and development, 2021,58 (06): 1340-1350.
[5]Ren Honglin Lu Wei,Chen Bing.Reversible data hiding in encrypted binary images by pixel prediction[J].Signal Processing,2019(07):268-277
[6] Li Jinwei, zhang Xiaoya, yao Yuanzhi, nenghai. Reversible information hiding method based on fine-grained embedded space reserved ciphertext domain image [ J ]. Network and information security journal, 2022,8 (01): 106-117.
Claims (1)
1. A separable ciphertext domain reversible data hiding method based on bit plane segmentation is characterized by comprising the following steps of:
step 1, carrying out block classification scrambling encryption and traversal matrix encryption on an original image:
step 1.1, dividing an original image with the size of M×N into p×q non-overlapping sub-blocks with the size of m×n, wherein p=M/M and q=N/N;
step 1.2, dividing the sub-blocks into brightness blocks and darkness blocks according to a formula (1), and marking the brightness blocks with 1 and the darkness blocks with 0 to generate a classification chart B;
in the formula (1), num represents the number of pixels with gray values greater than or equal to 127 in the sub-block, i epsilon (1, 2,3, …, p) and j epsilon (1, 2,3, …, q);
step 1.3 Huffman compression coding is carried out on the classification chart B, and the coded data is used as a secret key K 1 Preserving;
step 1.4, traversing the classification chart B to rearrange, placing all brightness blocks in front of darkness blocks, rearranging the brightness blocks according to the original sequence, rearranging the darkness blocks in reverse sequence, and obtaining a block classified and scrambled image;
step 1.5 generating a random number sequence L of length m×n using equation (2) 1 3.5699456 in<μ≤4，0<x<1, the random number sequence L 1 Unordered and non-repeating, the initial values μ and x in equation (2) 0 As secret key K 2 Preserving;
x k+1 ＝μx k (1-x k ) (2)
step 1.6 random number sequence L 1 Sequencing, and marking the sequence after sequencing as L 2 According to L 1 And L is equal to 2 Generating a number pair, and constructing a traversal matrix according to the corresponding relation of the number pair;
step 1.7, performing matrix traversing encryption for multiple times by taking the sub-blocks of the image after the block classification scrambling as a unit to obtain a ciphertext image, wherein the matrix traversing encryption is to rearrange pixels in the sub-blocks according to a constructed traversing matrix, and the number of matrix traversing encryption is taken as a secret key K 3 Preserving;
step 2, encrypting the watermark image:
dividing the watermark image into non-overlapped 8 multiplied by 8 sub-blocks, traversing all the sub-blocks in a serpentine mode preferentially in the horizontal direction, and traversing all pixel points in each sub-block in a non-crossing mode according to a Hilbert curve to generate one-dimensional data;
step 3, reversible data hiding in ciphertext domain, comprising the following specific steps:
step 3.1: carrying out full-bit plane scrambling on the ciphertext image, namely combining the highest bits of 8 different pixels into a new 1X 8 matrix, combining the seventh bits of 8 different pixels into a new 1X 8 matrix, and the like, finally combining the lowest bits of 8 different pixels into a new 1X 8 matrix, and recombining the 8 new 1X 8 matrices into an 8X 8 matrix to obtain the ciphertext image subjected to full-bit plane scrambling;
step 3.2, respectively forming the first 4 elements and the last 4 elements of the same bit in each row of the new bit plane of the ciphertext image after the full bit plane scrambling into 2X 2 sub-blocks;
step 3.3, scanning all generated 2×2 sub-blocks, and classifying all 2×2 sub-blocks into a continuous block and a discontinuous block, wherein the continuous block is a2×2 sub-block with all pixels in the block being 1 or 0, and the discontinuous block is a2×2 sub-block with pixels in the block having 0 and 1; with 1 representing a continuous block, 0 representing a discontinuous block, generating a block tag matrix, and using the block tag matrix as a key K 4 Preserving;
step 3.4 rearranges all 2×2 sub-blocks according to the order of preceding non-consecutive blocks of consecutive blocks to obtain 8 new bit-plane matrices rearranged based on 2×2 sub-blocks;
step 3.5 for consecutive blocks in the new bit plane matrix, the position of the pos in the block is a reserved position, the remaining three positions are respectively embedded with 1 bit of data to obtain a consecutive block after embedding data, the pos is calculated according to formula (3), wherein MOD (·) is a modulo function, INT (·) is a downward rounding function, K 5 Is a random number as a secret key K 5 Preserving;
pos＝MOD(INT( K 5 3 ), 4) (3)
step 3.6, regarding a discontinuous block in the new bit plane matrix, wherein the position of a pos in the block is a predicted position, the value of the predicted position is a predicted value, and the pos is calculated according to a formula (3);
step 3.7, determining the value of the predicted position, i.e. the predicted value p,
when the predicted value is the same as the predicted value, the discontinuous block is an embeddable block, 1 bit of data is embedded in the predicted position, otherwise, the discontinuous block is a non-embeddable block, and the discontinuous block after the data is embedded is obtained; marking embeddable blocks with 1 and non-embeddable blocks with 0, generating a sequence L with the same length as the number of blocks, and taking L as a secret key K 6 Preserving;
step 3.8, all one-dimensional data are embedded into the sub-blocks, and the recording block is embedded into the end position of the label to be used as a secret key K 7 The mixture is preserved and is then processed,recombining the 8bit planes embedded by the one-dimensional data into an image to obtain a ciphertext image containing the watermark;
step 4, image recovery and data extraction:
using encryption key K 1 -K 4 The method for extracting the decrypted image from the ciphertext image containing the watermark comprises the following specific steps:
step 4.1 Using Key K 4 Obtaining a block tag matrix, rearranging blocks to obtain a new bit plane;
step 4.2, performing inverse 90-degree rotation on the new bit plane to obtain an original bit plane;
step 4.3, converting 8-bit binary of each row of the original bit plane into a decimal gray value, and combining all gray values into a ciphertext image;
step 4.4 Using Key K 2 Constructing a traversal matrix;
step 4.5 Using Key K 3 Performing inverse matrix decryption on the ciphertext image to obtain a decrypted image matrix;
step 4.6 Using Key K 1 Rearranging the brightness blocks and darkness blocks to obtain a decrypted image;
using encryption key K 5 -K 7 The watermark image is extracted from the ciphertext image containing the watermark, and the specific steps are as follows:
step 4.7 Using Key K 5 Determining a data embedding position;
step 4.8 Using Key K 7 The reading block is embedded into the label end position;
step 4.9, for the continuous blocks, sequentially reading all values except the determined positions to obtain data embedded into the continuous blocks;
step 4.10 Using Key K 6 Dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.11, extracting a value for determining the data position in the embeddable block to obtain data in the discontinuous block;
step 4.12, decrypting data based on the Hilbert curve to obtain a watermark image;
step 4.13 Using Key K 5 Determining data embedded bitsPut and reserve position, using key K 7 The reading block is embedded into the label end position;
step 4.14, for the continuous blocks, reading the values of the reserved positions, and replacing all the values in the current block with the reserved position values;
step 4.15, for the non-continuous blocks, dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.16, for the embeddable block, reading the values of three other positions except the embedding position, if the number of 1 in the three values is more, setting the embedding position value as 1, otherwise, setting the embedding position value as 0, and obtaining the restored ciphertext image;
the method adopts double secret keys to extract watermark images from ciphertext images containing the watermark and obtain original images, and comprises the following specific steps:
step 4.17 Using Key K 5 Determining a data embedding position;
step 4.18 Using Key K 7 The reading block is embedded into the label end position;
step 4.19, for the continuous blocks, sequentially reading all values except the determined positions to obtain data embedded in the continuous blocks;
step 4.20 Using Key K 6 Dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.21, extracting a value for determining the data position in the embeddable block to obtain data in the discontinuous block;
step 4.22, decrypting data based on the Hilbert curve to obtain a watermark image;
step 4.23 Using Key K 5 Determining the data embedding position and the reserved position by using the secret key K 7 The reading block is embedded into the label end position;
step 4.24, for the continuous blocks, reading the values of the reserved positions, and replacing all the values in the current block with the reserved position values;
step 4.25, for the non-continuous blocks, dividing the non-continuous blocks into embeddable blocks and non-embeddable blocks;
step 4.26, for the embeddable block, reading the values of three other positions except the embedding position, if the number of 1 in the three values is more, setting the embedding position value as 1, otherwise, setting the embedding position value as 0, and obtaining the restored ciphertext image;
step 4.27 Using Key K 4 Obtaining a block tag matrix, and rearranging blocks of the restored ciphertext image to obtain a new bit plane;
step 4.28, performing inverse 90-degree rotation on the new bit plane to obtain an original bit plane;
step 4.29, converting 8-bit binary of each row of the original bit plane into a decimal gray value, and combining all gray values into a ciphertext image;
step 4.30 Using Key K 2 Constructing a traversal matrix;
step 4.31 Using Key K 3 Performing inverse matrix decryption on the ciphertext image to obtain a decrypted image matrix;
step 4.32 Using Key K 1 And rearranging the brightness blocks and the darkness blocks to obtain an original image.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210316358.XA CN114666453B (en) | 2022-03-29 | 2022-03-29 | Separable ciphertext domain reversible data hiding method based on bit plane segmentation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210316358.XA CN114666453B (en) | 2022-03-29 | 2022-03-29 | Separable ciphertext domain reversible data hiding method based on bit plane segmentation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114666453A CN114666453A (en) | 2022-06-24 |
| CN114666453B true CN114666453B (en) | 2023-07-07 |
Family
ID=82032657
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210316358.XA Active CN114666453B (en) | 2022-03-29 | 2022-03-29 | Separable ciphertext domain reversible data hiding method based on bit plane segmentation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114666453B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115118836B (en) * | 2022-06-30 | 2023-07-07 | 西安理工大学 | Reversible data hiding method based on multi-strategy combination of pixel prediction |
| CN115952549B (en) * | 2023-03-13 | 2023-05-09 | 北京环球医疗救援有限责任公司 | End-to-end medical image privacy data elimination system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015138737A1 (en) * | 2014-03-12 | 2015-09-17 | Brass Roots Technologies, LLC | Bit plane memory system |
| CN109462714A (en) * | 2018-10-30 | 2019-03-12 | 成都优图有真像信息技术有限公司 | The small encrypted image Processing of Multi-Bit-Planes reversible data concealing method of cloud storage expense |
| CN109800585A (en) * | 2018-12-04 | 2019-05-24 | 王继军 | A kind of image interpolation space completely reversibility separates ciphertext domain Information Hiding Algorithms |
-
2022
- 2022-03-29 CN CN202210316358.XA patent/CN114666453B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015138737A1 (en) * | 2014-03-12 | 2015-09-17 | Brass Roots Technologies, LLC | Bit plane memory system |
| CN109462714A (en) * | 2018-10-30 | 2019-03-12 | 成都优图有真像信息技术有限公司 | The small encrypted image Processing of Multi-Bit-Planes reversible data concealing method of cloud storage expense |
| CN109800585A (en) * | 2018-12-04 | 2019-05-24 | 王继军 | A kind of image interpolation space completely reversibility separates ciphertext domain Information Hiding Algorithms |
Non-Patent Citations (1)
| Title |
|---|
| 基于位平面分割的密文域可逆信息隐藏算法;李天雪;张敏情;狄富强;柯彦;;计算机应用研究;35(09);2766-2771 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114666453A (en) | 2022-06-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Qin et al. | Separable reversible data hiding in encrypted images via adaptive embedding strategy with block selection | |
| Yin et al. | Reversible data hiding in encrypted images based on pixel prediction and bit-plane compression | |
| Qin et al. | Effective reversible data hiding in encrypted image with privacy protection for image content | |
| CN114666453B (en) | Separable ciphertext domain reversible data hiding method based on bit plane segmentation | |
| Huang et al. | High-capacity reversible data hiding in encrypted image based on specific encryption process | |
| CN109348228A (en) | A kind of hiding System and method for of the image encryption domain reversible information based on image segmentation and image space correlation | |
| Ren et al. | Reversible data hiding in encrypted binary images by pixel prediction | |
| Wu et al. | High-capacity reversible data hiding in encrypted images by bit plane partition and MSB prediction | |
| Weng et al. | High capacity reversible data hiding in encrypted images using SIBRW and GCC | |
| Bhattacharyya et al. | Pixel mapping method (PMM) based bit plane complexity segmentation (BPCS) steganography | |
| Mo et al. | Reversible Data Hiding in Encrypted Image Based on Block Classification Permutation. | |
| CN111898138A (en) | Separable ciphertext domain reversible data hiding method | |
| CN113382127B (en) | Encrypted image reversible information hiding method with elastic selection and run-length coding | |
| AU2021102700A4 (en) | A system for reversible data hiding in encrypted images | |
| Barhoom et al. | A steganography LSB technique for hiding image within image using blowfish encryption algorithm | |
| Yin et al. | Separable reversible data hiding in encrypted image with classification permutation | |
| Zhong et al. | A separable reversible data hiding scheme in encrypted image for two cloud servers | |
| Abdullatif et al. | Hiding techniques for dynamic encryption text based on corner point | |
| Liu et al. | A reversible data hiding algorithm based on image camouflage and bit-plane compression | |
| Kukreja et al. | A secure reversible data hiding scheme for digital images using random grid visual secret sharing | |
| Puteaux et al. | High-capacity reversible data hiding in encrypted images using MSB prediction | |
| Sumalatha et al. | Local content based image authentication for tamper localization | |
| Malakooti et al. | A Lossless Secure data embedding in image using DCT and Randomize key generator | |
| Pooranakala et al. | Securing medical images using compression techniques with encryption and image steganography | |
| Siddiqui et al. | A Survey On Image Steganography Using Lsb Substitution |
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 |