CN108563956A - Safe encrypted domain reversible information hidden method based on the prediction of high bit flipping - Google Patents
Safe encrypted domain reversible information hidden method based on the prediction of high bit flipping Download PDFInfo
- Publication number
- CN108563956A CN108563956A CN201810174576.8A CN201810174576A CN108563956A CN 108563956 A CN108563956 A CN 108563956A CN 201810174576 A CN201810174576 A CN 201810174576A CN 108563956 A CN108563956 A CN 108563956A
- Authority
- CN
- China
- Prior art keywords
- pixel
- image
- decryption
- exclusive
- additional information
- 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.)
- Pending
Links
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/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
- H04L9/0631—Substitution permutation network [SPN], i.e. cipher composed of a number of stages or rounds each involving linear and nonlinear transformations, e.g. AES algorithms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/065—Encryption by serially and continuously modifying data stream elements, e.g. stream cipher systems, RC4, SEAL or A5/3
Abstract
A kind of safe encrypted domain reversible information hidden method based on the prediction of high bit flipping; the method of its high bit flipping prediction only tests value and position of the original image without changing pixel; general image exclusive or and shuffle operation is enable to be used for encrypted image; the protection for realizing pixel value and location of pixels simultaneously, improves the safety of encrypted image；The test method of high bit flipping prediction takes full advantage of the correlation of image, effectively increases steganographic capacity；In receiving terminal, recipient only needs image encryption key, without stego-key, it can be obtained by decrypted image identical with original image and the approximate plaintext image containing additional information with original image, another aspect recipient only needs information steganography key, without image encryption key, be able to from containing additional information plaintext domain and ciphertext domain in extract identical additional information.Algorithm realization is simple and safe, and steganographic capacity is big.
Description
Technical field
The present invention relates to a kind of reversible information hidden methods in image encryption domain.
Background technology
With the development of network and cloud service, digital image data is difficult to meet user to privacy beyond the clouds with stored in clear
The demand of protection, therefore, the encryption version of upload digital images data become the effective means of privacy of user protection.Another party
Face, cloud service provider need to hide management of the additional information in order to ciphertext digital picture in encrypted digital picture.It takes into account
Privacy of user is protected and the demand of ciphertext image management, image encryption domain hiding reversible data (RDH-EI:Reversible
Data Hiding in Encrypted Image) technology causes more and more concerns.
In receiving terminal, according to actual demand, additional information extractor can from ciphertext/plaintext domain containing additional information nothing
Damage ground extraction additional information, and image recipient can decrypt to obtain original plaintext image, or and original image as needed
Similar additional information-plaintext image.Additional information in this ciphertext digital picture hides, the lossless extraction of additional information and figure
As Distortionless, as image encryption domain hiding reversible data (RDH-EI).
In recent years, people go deep into the invertibity of RDH-EI algorithms, hidden capacity, computation complexity and safety
Research, it is proposed that a variety of RDH-EI algorithms.2016, (D.Xu, R.Wang.Separable the and error-free of document 1
reversible data hiding in encrypted images[J].Signal Process.,2016,123:9-21)
It is proposed reserved space RDH-EI algorithms before a kind of encryption based on interpolation error, the algorithm completely reversibility, decrypted image quality compared with
It is high.It is but that can use traditional RDH method hiding informations after encryption, 1 algorithm of document requires user to utilize biography before encryption
Reversible information hidden algorithm of uniting calculates interpolation error, and computation complexity is higher.In addition, although 1 algorithm of document devise it is special
Image encryption method encrypts interpolation error, and encrypted image still remains the risk of information leakage, and (encrypted image has revealed original graph
The partial contour information of picture).Hereafter, ensureing algorithm completely reversibility, calculated again from improving algorithm security and reducing
The angle of miscellaneous degree, (F.Huang, J.Huang, Y.Shi.New framework for the reversible data of document 2
hiding in encrypted domain[J].IEEE Trans.Inf.Forensics Security,2016,11(12):
The encryption method member-retaining portion statistical property for 2777-2789) proposing block exclusive or, conventional RD H can be used after image encryption
Algorithm carries out Information hiding.To improve the encrypted safety of block exclusive or encrypted image, the algorithm is on the basis of block exclusive or is encrypted
The position of scramble image block.The image encryption method of 2 algorithm of document is simple compared with 1 algorithm of document, and computation complexity is relatively low.But this
The risk and algorithm hidden capacity of the encryption method existence information leakage of kind block exclusive or-block scramble are relatively low.2017, document 3 was (old
Sail and red outstanding person, the encrypted domain reversible information hidden method of Yin Bangxu, Yan Shu based on classification scramble and hiding information classification:
201710250376.1 [P] .2017-08-29.) it is carried from the angle for improving algorithm security and reduction stego-key management difficulty
Go out before encryption to the processing of original image piecemeal, and original pixels are divided into two class of variable pixel and fixed pixel, variable pixel
It is placed in front, is used for Information hiding；Fixed pixel is placed in rear portion, cannot carry additional information.3 algorithm pair of document, two class pixel point
Not carry out exclusive or encryption and scrambling encryption, improve the safety of encrypted image to a certain extent.But for ease of Information hiding,
3 algorithm of document requires user higher to image progress piecemeal and location of pixels reset process, computation complexity before encryption.
Original intention based on secret protection, the RDH-EI algorithms applied to cloud storage scene should provide to the user in user terminal
Simple and safe image encryption method protects privacy of user；Ciphertext image, RDH-EI are managed for convenience of cloud service provider
Algorithm should provide larger hidden capacity；In receiving terminal, Distortionless original image is the reasonable demand that RDH-EI algorithms should meet.
The above-mentioned RDH-EI algorithms reported can realize the original image Distortionless of receiving terminal, but for that conventional RD H can be utilized to calculate
The completely reversibility advantage of method, 1 algorithm of document, 2 algorithm of document and 3 algorithm of document devise special method encryption original graph
Picture.Its 1 algorithm of Literature has modified the value of original pixels based on conventional RD H algorithms before encryption；Though 2 algorithm of document is without adding
Original image is changed before close, but its embedding capacity is smaller, it is often more important that, the encryption method of block exclusive or-block scramble does not change
The position relationship for becoming adjacent pixel, remains part statistical property, there are security risks；Though 3 algorithm of document is not directed to conventional RD H
Algorithm, but to realize completely reversibility, the special image encryption method of design require user before encryption to pixel classifications simultaneously
Its position is reset, computation complexity is higher.Therefore, while meeting the needs of above-mentioned user terminal, cloud service provider and recipient,
It is RDH-EI technologies that simple and safe image encryption method, which is designed, with corresponding large capacity completely reversibility information concealing method
There is an urgent need to.
Invention content
The object of the present invention is to provide a kind of safe encrypted domain reversible information hidden methods based on the prediction of high bit flipping, should
For method to the encryption safe and simple general-purpose of image, the steganographic capacity of additional information is big, is convenient for management of the high in the clouds to ciphertext image,
And it can realize the extraction of plaintext domain information and the lossless decryption of image.
The technical scheme adopted by the invention for realizing the object of the invention is a kind of safety encryption based on the prediction of high bit flipping
Domain reversible information hidden method, includes the following steps：
A, image encryption
A1, pixel classifications identity matrix：
User calculates original image X, the X={ x that size is I × Ji,j| i=1,2 ..., I, j=1,2 ..., J }, middle picture
Plain xi,jUndulating value fi,j；
Wherein, i, j indicate pixel x respectivelyi,jRow serial number in original image X and row serial number, I, J are respectively original graph
Total line number as X and total columns；
By the pixel x in original image Xi,jMost significant bit overturning, obtain overturning pixelCalculate overturning pixelUndulating value
Calculate the pixel x in original image Xi,jPixel classifications identify mi,j,
Again by all pixels x in original image Xi,jPixel classifications identify mi,j, constitute pixel classifications identity matrix M, M
={ mi,j| i=1,2 ..., I, j=1,2 ..., J }；Wherein mod () is modulo operation；
A2, the compression of pixel classifications identity matrix：
User compresses pixel classifications identity matrix M with Run- Length Coding, that is, presses column scan pixel classifications identity matrix M, will
Continuous 1 is considered as the distance of swimming, records the start position of each distance of swimming and the length of the distance of swimming, obtains Run- Length Coding sequence MRLC；
By Run- Length Coding sequence MRLCWith binary representation, pixel classifications bit stream M is obtainedc, pixel classifications bit stream McIn
The value for the number of bits h that distance of swimming start position occupies is the minimum binary representation digit of maximum distance of swimming start position；
Pixel classifications bit stream McThe value for the number of bits w that middle run length occupies is the minimum binary system of maximum run length
Indicate digit；User is by pixel classifications bit stream McNumber of bits h, the pixel classifications bit stream of middle distance of swimming start position occupancy
McThe number of bits w that middle run length occupies has sent encryption key K toeRecipient；
A3, exclusive or-overall situation scrambling encryption：
User is according to encryption key Ke" encryption of step-by-step exclusive or " is first carried out to original image X, then carries out " the location of pixels overall situation
Scrambling encryption " operates, and obtains exclusive or-scrambling encryption image X ', X '={ x 'i,j| i=1,2 ..., I, j=1,2 ..., J }；
A4, encrypted image is generated：
User is according to encryption key KeTo pixel classifications bit stream Mc" exclusive or encryption " is done, encrypted pixel classification bit is obtained
StreamEncrypted pixel classification bit streamLength be denoted as nM；Calculate total number of pixels of exclusive or-scrambling encryption image X '
The digit n of minimum binary representationX,Then obtain maximum embedded bit number nmax, nmax=I × J-nX-
nM；WhereinExpression rounds up operation, log2() indicates the logarithm operation bottom of for 2；
Encrypted pixel is classified bit streamReplace the rear n of exclusive or-scrambling encryption image X 'MA pixel, that is, x 'a,bExtremely
x′I,JThe most significant bit of pixel, wherein
By the embedded bit number n of maximummaxBinary-coding replace exclusive or-scrambling encryption image X ' preceding nXA pixel, that is, x '1,1Extremely
The most significant bit of pixel, obtains encrypted image X ", X "=x "i,j| i=1,2 ..., I, j=1,2 ..., J }；To finally it add
Close image X " sends high in the clouds to；
B, Information hiding
B1, additional information encryption：
High in the clouds is based on stego-key Kh" encryption of step-by-step exclusive or " is carried out to additional information S, encryption additional information S ' is obtained, adds
The bit number of close additional information S ＇ is denoted as ls；Extract the preceding n of encrypted image X "XA pixel, that is, x ＇1,1ExtremelyThe highest of pixel
The sequence extracted is converted to the decimal system by significance bit, obtains the embedded bit number n of maximum of encrypted imagemax, encrypt additional letter
Cease the length l of S 'sBit number n embedded no more than maximummax；
B2, Information hiding：
According to stego-key Kh, random selection is except x ＇ in encrypted image X "1,1ExtremelyPixel and x ＇a,bTo x 'I,JPicture
L outside elementsA pixel chooses encryption additional information S ' write-ins in the most significant bit of pixel, generates adding containing additional information
Close image X ' ", X ' "=x ' "i,j| i=1,2 ..., I, j=1,2 ..., J }；
C, image decryption
C1, the extraction of pixel classifications identity matrix：
User receives the encrypted image X ' " containing additional information, X ' "=x ' "i,j| i=1,2 ..., I, j=1,2 ...,
J }, extract preceding n in the encrypted image X ' ' containing additional informationXA pixel, that is, x '1,1ExtremelyThe most significant bit of pixel, whereinThe sequence extracted is converted into the decimal system, obtains the embedded bit number n of maximum of encrypted imagemax,
To calculate encrypted pixel classification bit streamLength nM, nM=I × J-nX-nmax；
Extract the rear n of the encrypted image X ' " containing additional informationMA pixel, that is, x 'a,bTo x 'I,JThe most significant bit of pixel,
Wherein,Obtain encrypted pixel
Classification bit streamAccording to encryption key KeTo encrypted pixel classification bit stream" decryption of step-by-step exclusive or " is done, pixel is obtained
Classify bit stream Mc；
According to pixel classifications bit stream McNumber of bits h, the pixel classifications bit stream M that middle distance of swimming start position occupiescIn
The number of bits w that run length occupies, by binary pixel classifications bit stream McBe converted to metric Run- Length Coding sequence
Arrange MRLC；With Run- Length Coding decompression method decompression Run- Length Coding sequence MRLC, obtain pixel classifications identity matrix M, M={ mi,j|i
=1,2 ..., I, j=1,2 ..., J }；
C2, exclusive or-overall situation scramble decryption：
Recipient is according to encryption key Ke" location of pixels overall situation scramble is taken turns doing to the encrypted image X ' " containing additional information
Decryption " and " decryption of step-by-step exclusive or ", obtain exclusive or-scramble decrypted image D ', D '={ d 'i,j| i=1,2 ..., I, j=1,
2,…,J}；
C3, decrypted image is generated：
Establish decrypted image D, D={ di,j| i=1,2 ..., I, j=1,2 ..., J }, own in decrypted image D when initial
Decrypt pixel di,jValue be 0；By the pixel d in decrypted image Di,jIt is divided into Ta、Tb、TcAnd TdFour classes, wherein Ta={ di,j| i=
1, j=1 }, Tb={ di,j| i=1, j=2,3 ..., J }, Tc={ di,j| i=2,3 ..., I, j=1 }, Td={ di,j| i=2,
3 ..., I, j=2,3 ..., J }；T in update decrypted image D successivelya、Tb、TcAnd TdFour class pixels；
The first step, update TaMiddle pixel d1,1；
Exclusive or-scramble decryption pixel d ' is used first1,1Value update decryption pixel d1,1, then m is identified with pixel classifications1,1
Value update decryption pixel d1,1Most significant bit, that is, complete decryption pixel d1,1Update；
Second step updates T successively by the increased sequences of pixel ordinate jbMiddle decryption pixel di,j；
Calculate exclusive or-scramble decryption pixel d ＇i,jThe undulating value f ' of (i=1, j=2,3 ..., J)i,j, f 'i,j=| d 'i,j-
di,j-1|, wherein di,j-1For updated decryption pixel；Overturn exclusive or-scramble decryption pixel d 'i,jMost significant bit, obtain
Exclusive or-scramble decryption overturning pixelCalculate exclusive or-scramble decryption overturning pixelUndulating value
IfExclusive or-scramble decryption pixel d ' is used firsti,jValue update decryption pixel di,j, then with
Decrypt pixel di,jPixel classifications at same position identify mi,jValue update decryption pixel di,jMost significant bit；IfAnd pixel classifications identify mi,j=0, with d 'i,jWithIn have compared with minor swing value pixel update decryption
Pixel di,j；IfAnd pixel classifications identify mi,j=1, with d 'i,jWithIn with larger fluctuation value pixel
Update decryption pixel di,j；
Third step restores T successively by the increased sequences of pixel abscissa icMiddle pixel di,j；
Calculate exclusive or-scramble decryption pixel d 'i,jThe undulating value f ' of (i=2,3 ..., I j=1)i,j, f 'i,j=| d 'i,j-
di-1,j|, wherein di-1,jFor updated decryption pixel；Overturn exclusive or-scramble decryption pixel d 'i,jMost significant bit, obtain
Exclusive or-scramble decryption overturning pixelCalculate exclusive or-scramble decryption overturning pixelUndulating value
IfExclusive or-scramble decryption pixel d ' is used firsti,jValue update decryption pixel di,j, then with
Decrypt pixel di,jPixel classifications at same position identify mi,jValue update decryption pixel di,jMost significant bit；
IfAnd pixel classifications identify mi,j=0, with d 'i,jWithIn have compared with minor swing value picture
Element update decryption pixel di,j；IfAnd pixel classifications identify mi,j=1, with d 'i,jWithIn have larger wave
The pixel update decryption pixel d of dynamic valuei,j；
4th step updates T successively by pixel abscissa i and ordinate j successively increased sequencedMiddle pixel di,j；
Calculate exclusive or-scramble decryption pixel d 'i,j(i=2,3 ..., I j=2,3 ..., J) undulating value f 'i,j,Wherein, di-1,j-1, di-1,jAnd di,j-1It is updated decryption pixel；
Overturn exclusive or-scramble decryption pixel d 'i,jMost significant bit, obtain exclusive or-scramble decryption overturning pixelCalculate exclusive or-
Scramble decryption overturning pixelUndulating value
IfExclusive or-scramble decryption pixel d ' is used firsti,jValue update decryption pixel di,j, then with
Decrypt pixel di,jPixel classifications at same position identify mi,jValue update decryption pixel di,jMost significant bit；IfAnd pixel classifications identify mi,j=0, with d 'i,jWithIn have compared with minor swing value pixel update decryption
Pixel di,j；IfAnd pixel classifications identify mi,j=1, with d 'i,jWithIn with larger fluctuation value picture
Element update decryption pixel di,j；
Ta、Tb、TcAnd TdAfter the completion of the update of four class pixels, that is, complete the generation of decrypted image D；
C4, the plaintext image containing additional information is generated：
Establish the plaintext image D containing additional informationM,DMIn
The value of pixel with the value of pixel is identical at same position in decrypted image D；The image D of additional informationMPreceding nXA pixel, that is, x '1,1
ExtremelyPixel and rear nMA pixel, that is, x 'a,bTo x 'I,JPixel remains unchanged, and the least significant bit of rest of pixels is used containing attached
Add the most significant bit of encrypted image X ' " pixels at same position of information to update, completes the plaintext image life containing additional information
At；
D, information extraction
D1, the extraction of plaintext domain additional information
Recipient is according to stego-key KhIn the plaintext image D containing additional informationMIn find out carry additional information pixel,
Its least significant bit is extracted, encryption additional information S ' is obtained；Based on stego-key KhKey stream is generated, to encrypting additional information S '
It carries out " decryption of step-by-step exclusive or ", obtains additional information S；
D2, the extraction of ciphertext domain additional information
According to stego-key KhThe pixel for carrying additional information, extraction are found out in the encrypted image X ' " containing additional information
Its most significant bit obtains encryption additional information S '；Based on stego-key KhKey stream is generated, to encrypting additional information S ' progress
" decryption of step-by-step exclusive or ", obtains additional information S.
Compared with prior art, the beneficial effects of the invention are as follows:
One, the present invention directly using common image exclusive or and sets the original image in " encrypted domain reversible information is hidden "
Random encrypted image, the encrypted image of generation had not only destroyed the statistical property of original image, but also realized the protection to location of pixels, carried
High encrypted image safety, and its is easy to operate, general, computation complexity is low.Test shows to commonly using test image
Lena, when steganographic capacity is 0.68 bit per pixel, the image encryption time complexity of the method for the present invention is less than 0.4 second,
The image encryption time complexity of 3 algorithm of document is more than 6 seconds.
Two, the present invention before encryption tests the front and back correlation with neighborhood of each pixel most significant bit overturning,
The correlation of the front and back pixel and its neighborhood of pixel classifications identification record most significant bit overturning is used in combination, takes full advantage of image
Spatial coherence, steganographic capacity is big, and ciphertext image is managed convenient for high in the clouds.It is Information hiding with original image is changed before existing encryption
Member-retaining portion original image statistical property is that Information hiding reserved space algorithm is compared after reserved space algorithm, encryption, the present invention
Only test image is easy to operate, steganographic capacity is big, algorithm complexity is low without changing original pixel value and position.Test shows
To common test image Lena, image measurement (generating pixel classifications identity matrix) time complexity is less than 0.2 second.
Three, recipient only needs image encryption key, is not necessarily to information steganography key, so that it may identical as original image to obtain
Decrypted image；Another aspect recipient only needs information steganography key, is not necessarily to image encryption key, is able to from ciphertext image
With identical additional information is extracted in plaintext image.Realize image encryption and Information hiding, image decryption and information extraction
It is completely independent, further improves the practicability of algorithm.
In short, being improved in image to pixel value and location of pixels encipherment protection as unit of pixel when the present invention encrypts
Hold the safety of protection；Reserved space RDH-EI algorithms are repaiied before encryption before having broken existing encryption to the test of pixel before encryption
The value even convention of position for changing pixel, greatly reduce algorithm complexity；No matter encrypting the algorithm of preceding reserved space or adding
The algorithm of reserved space after close, only partial pixel can be used for Information hiding in existing RDH-EI algorithms, and the present invention no longer adheres rigidly to
In this, makes all encrypted pixels could be used for information insertion by simple test pixel, greatly improve steganographic capacity；It is right
The user of encryption key is obtained in receiving terminal, can obtain the decrypted image consistent with original image according to demand, or can obtain
Plaintext image of the high quality containing additional information containing additional information；The user of stego-key, Ji Nengcong are obtained for receiving terminal
Additional information is extracted in ciphertext image, and can extract additional information from plaintext image；Algorithm is simple and highly practical.To common
Test image Lena, in steganographic capacity greatly to 0.9bpp when, total time, complexity was still less than 1 second.
Present invention will be described in further detail below with reference to the accompanying drawings and specific embodiments.
Description of the drawings
The Baboon original images that Fig. 1 a emulation experiments of the present invention use.
The Baboon encrypted images that Fig. 1 b emulation experiments of the present invention obtain.
The Lena original images that Fig. 2 a emulation experiments of the present invention use.
The Lena encrypted images that Fig. 2 b emulation experiments of the present invention obtain.
Encrypted images of the Baboon containing additional information that Fig. 3 a emulation experiments of the present invention obtain.
Encrypted images of the Lena containing additional information that Fig. 3 b emulation experiments of the present invention obtain.
The Baboon decrypted images that Fig. 4 a emulation experiments of the present invention obtain.
The Lena decrypted images that Fig. 4 b emulation experiments of the present invention obtain.
Plaintext images of the Baboon that Fig. 5 a emulation experiments of the present invention obtain containing additional information.
Plaintext images of the Lena that Fig. 5 b emulation experiments of the present invention obtain containing additional information.
The maximum steganographic capacity comparison diagram of Fig. 6 present invention and 100 width test images of 3 algorithm of document.
Specific implementation mode
Embodiment
A kind of specific implementation mode of the present invention is that a kind of safe encrypted domain reversible information based on the prediction of high bit flipping is hidden
Tibetan method, includes the following steps：
A, image encryption
A1, pixel classifications identity matrix：
User calculates original image X, the X={ x that size is I × Ji,j| i=1,2 ..., I, j=1,2 ..., J }, middle picture
Plain xi,jUndulating value fi,j；
Wherein, i, j indicate pixel x respectivelyi,jRow serial number in original image X and row serial number, I, J are respectively original graph
Total line number as X and total columns；
By the pixel x in original image Xi,jMost significant bit overturning, obtain overturning pixelCalculate overturning pixelUndulating value
Calculate the pixel x in original image Xi,jPixel classifications identify mi,j,
Again by all pixels x in original image Xi,jPixel classifications identify mi,j, constitute pixel classifications identity matrix M, M
={ mi,j| i=1,2 ..., I, j=1,2 ..., J }；Wherein mod () is modulo operation；
A2, the compression of pixel classifications identity matrix：
User compresses pixel classifications identity matrix M with Run- Length Coding, that is, presses column scan pixel classifications identity matrix M, will
Continuous 1 is considered as the distance of swimming, records the start position of each distance of swimming and the length of the distance of swimming, obtains Run- Length Coding sequence MRLC；
By Run- Length Coding sequence MRLCWith binary representation, pixel classifications bit stream M is obtainedc, pixel classifications bit stream McIn
The value for the number of bits h that distance of swimming start position occupies is the minimum binary representation digit of maximum distance of swimming start position；
Pixel classifications bit stream McThe value for the number of bits w that middle run length occupies is the minimum binary system of maximum run length
Indicate digit；User is by pixel classifications bit stream McNumber of bits h, the pixel classifications bit stream of middle distance of swimming start position occupancy
McThe number of bits w that middle run length occupies has sent encryption key K toeRecipient；
A3, exclusive or-overall situation scrambling encryption：
User is according to encryption key Ke" encryption of step-by-step exclusive or " is first carried out to original image X, then carries out " the location of pixels overall situation
Scrambling encryption " operates, and obtains exclusive or-scrambling encryption image X ', X '={ x 'i,j| i=1,2 ..., I, j=1,2 ..., J }；
A4, encrypted image is generated：
User is according to encryption key KeTo pixel classifications bit stream Mc" exclusive or encryption " is done, encrypted pixel classification bit is obtained
StreamEncrypted pixel classification bit streamLength be denoted as nM；Calculate total number of pixels of exclusive or-scrambling encryption image X '
The digit n of minimum binary representationX,Then obtain maximum embedded bit number nmax, nmax=I × J-nX-
nM；WhereinExpression rounds up operation, log2() indicates the logarithm operation bottom of for 2；
Encrypted pixel is classified bit streamReplace the rear n of exclusive or-scrambling encryption image X 'MA pixel, that is, x 'a,bExtremely
x′I,JThe most significant bit of pixel, wherein
By the embedded bit number n of maximummaxBinary-coding replace exclusive or-scrambling encryption image X ' preceding nXA pixel, that is, x '1,1Extremely
The most significant bit of pixel obtains encrypted image X ' ', X ' '={ x ' 'i,j| i=1,2 ..., I, j=1,2 ..., J }；Finally will
Encrypted image X ' " sends high in the clouds to；
B, Information hiding
B1, additional information encryption：
High in the clouds is based on stego-key Kh" encryption of step-by-step exclusive or " is carried out to additional information S, encryption additional information S ' is obtained, adds
The bit number of close additional information S ' is denoted as ls；Extract the preceding n of encrypted image X "XA pixel, that is, x '1,1ExtremelyThe highest of pixel
The sequence extracted is converted to the decimal system by significance bit, obtains the embedded bit number n of maximum of encrypted imagemax, encrypt additional letter
Cease the length l of S 'sBit number n embedded no more than maximummax；
B2, Information hiding：
According to stego-key Kh, random selection is except x ' in encrypted image X "1,1ExtremelyPixel and x 'a,bTo x 'I,JPicture
L outside elementsA pixel chooses encryption additional information S ' write-ins in the most significant bit of pixel, generates adding containing additional information
Close image X ' ", X ' "=x ' "i,j| i=1,2 ..., I, j=1,2 ..., J }；
C, image decryption
C1, the extraction of pixel classifications identity matrix：
User receives the encrypted image X ' " containing additional information, X ' "=x ' "i,j| i=1,2 ..., I, j=1,2 ...,
J }, extract preceding n in the encrypted image X ' " containing additional informationXA pixel, that is, x '1,1ExtremelyThe most significant bit of pixel, whereinThe sequence extracted is converted into the decimal system, obtains the embedded bit number n of maximum of encrypted imagemax,
To calculate encrypted pixel classification bit streamLength nM, nM=I × J-nX-nmax；
Extract the rear n of the encrypted image X ' " containing additional informationMA pixel, that is, x 'a,bTo x 'I,JThe most significant bit of pixel,
Wherein,Obtain encrypted pixel
Classification bit streamAccording to encryption key KeTo encrypted pixel classification bit stream" decryption of step-by-step exclusive or " is done, pixel is obtained
Classify bit stream Mc；
According to pixel classifications bit stream McNumber of bits h, the pixel classifications bit stream M that middle distance of swimming start position occupiescIn
The number of bits w that run length occupies, by binary pixel classifications bit stream McBe converted to metric Run- Length Coding sequence
Arrange MRLC；With Run- Length Coding decompression method decompression Run- Length Coding sequence MRLC, obtain pixel classifications identity matrix M, M={ mi,j|i
=1,2 ..., I, j=1,2 ..., J }；
C2, exclusive or-overall situation scramble decryption：
Recipient is according to encryption key Ke" location of pixels overall situation scramble is taken turns doing to the encrypted image X ' " containing additional information
Decryption " and " decryption of step-by-step exclusive or ", obtain exclusive or-scramble decrypted image D ＇, D ＇={ d ＇i,j| i=1,2 ..., I, j1,2 ...,
J}；
C3, decrypted image is generated：
Establish decrypted image D, D={ di,j| i=1,2 ..., I, j=1,2 ..., J }, own in decrypted image D when initial
Decrypt pixel di,jValue be 0；By the pixel d in decrypted image Di,jIt is divided into Ta、Tb、TcAnd TdFour classes, wherein Ta={ di,j| i=
1, j=1 }, Tb={ di,j| i=1, j=2,3 ..., J }, Tc={ di,j| i=2,3 ..., I, j=1 }, Td={ di,j| i=2,
3 ..., I, j=2,3 ..., J }；T in update decrypted image D successivelya、Tb、TcAnd TdFour class pixels；
The first step, update TaMiddle pixel d1,1；
Exclusive or-scramble decryption pixel d ' is used first1,1Value update decryption pixel d1,1, then m is identified with pixel classifications1,1
Value update decryption pixel d1,1Most significant bit, that is, complete decryption pixel d1,1Update；
Second step updates T successively by the increased sequences of pixel ordinate jbMiddle decryption pixel di,j；
Calculate exclusive or-scramble decryption pixel d 'i,jThe undulating value f ' of (i=1, j=2,3 ..., J)i,j, f 'i,j=| d 'i,j-
di,j-1|, wherein di,j-1For updated decryption pixel；Overturn exclusive or-scramble decryption pixel d 'i,jMost significant bit, obtain
Exclusive or-scramble decryption overturning pixelCalculate exclusive or-scramble decryption overturning pixelUndulating value
IfExclusive or-scramble decryption pixel d ' is used firsti,jValue update decryption pixel di,j, then with
Decrypt pixel di,jPixel classifications at same position identify mi,jValue update decryption pixel di,jMost significant bit；IfAnd pixel classifications identify mi,j=0, with d 'i,jWithIn have compared with minor swing value pixel update decryption
Pixel di,j；IfAnd pixel classifications identify mi,j=1, with d 'i,jWithIn with larger fluctuation value picture
Element update decryption pixel di,j；
Third step restores T successively by the increased sequences of pixel abscissa icMiddle pixel di,j；
Calculate exclusive or-scramble decryption pixel d 'i,j(i=2,3 ..., the undulating value f ' of I j=1i,j, f 'i,j=| d 'i,j-
di-1,j|, wherein di-1,jFor updated decryption pixel；Overturn exclusive or-scramble decryption pixel d 'i,jMost significant bit, obtain
Exclusive or-scramble decryption overturning pixelCalculate exclusive or-scramble decryption overturning pixelUndulating value
IfExclusive or-scramble decryption pixel d ' is used firsti,jValue update decryption pixel di,j, then with
Decrypt pixel di,jPixel classifications at same position identify mi,jValue update decryption pixel di,jMost significant bit；
IfAnd pixel classifications identify mi,j=0, with d 'i,jWithIn have compared with minor swing value picture
Element update decryption pixel di,j；IfAnd pixel classifications identify mi,j=1, with d 'i,jWithIn have it is larger
The pixel update decryption pixel d of undulating valuei,j；
4th step updates T successively by pixel abscissa i and ordinate j successively increased sequencedMiddle pixel di,j；
Calculate exclusive or-scramble decryption pixel d 'i,j(i=2,3 ..., I j=2,3 ..., the undulating value f ' of Ji,j,Wherein, di-1,j-1, di-1,jAnd di,j-1It is updated decryption pixel；
Overturn exclusive or-scramble decryption pixel d 'i,jMost significant bit, obtain exclusive or-scramble decryption overturning pixelCalculate exclusive or-
Scramble decryption overturning pixelUndulating value
IfExclusive or-scramble decryption pixel d ' is used firsti,jValue update decryption pixel di,j, then with
Decrypt pixel di,jPixel classifications at same position identify mi,jValue update decryption pixel di,jMost significant bit；IfAnd pixel classifications identify mi,j=0, with d 'i,jWithIn have compared with minor swing value pixel update decryption
Pixel di,j；IfAnd pixel classifications identify mi,j=1, with d 'i,jWithIn with larger fluctuation value picture
Element update decryption pixel di,j；
Ta、Tb、TcAnd TdAfter the completion of the update of four class pixels, that is, complete the generation of decrypted image D；
C4, the plaintext image containing additional information is generated：
Establish the plaintext image D containing additional informationM,DMIn
The value of pixel with the value of pixel is identical at same position in decrypted image D；The image D of additional informationMPreceding nXA pixel, that is, x '1,1
ExtremelyPixel and rear nMA pixel, that is, x 'a,bTo x 'I,JPixel remains unchanged, and the least significant bit of rest of pixels is used containing attached
Add the most significant bit of encrypted image X ' " pixels at same position of information to update, completes the plaintext image life containing additional information
At；
D, information extraction
D1, the extraction of plaintext domain additional information
Recipient is according to stego-key KhIn the plaintext image D containing additional informationMIn find out carry additional information pixel,
Its least significant bit is extracted, encryption additional information S ' is obtained；Based on stego-key KhKey stream is generated, to encrypting additional information S '
It carries out " decryption of step-by-step exclusive or ", obtains additional information S；
D2, the extraction of ciphertext domain additional information
According to stego-key KhThe pixel for carrying additional information, extraction are found out in the encrypted image X ' " containing additional information
Its most significant bit obtains encryption additional information S '；Based on stego-key KhKey stream is generated, to encrypting additional information S ' progress
" decryption of step-by-step exclusive or ", obtains additional information S.
The effect of the present invention can be verified and illustrated by following performance evaluation and emulation experiment test.
Emulation experiment and performance evaluation
Experiment simulation is with size：The Baboon images and Lena of I × J=512 × 512 are test image, verify this hair
The properties of bright method.Random number is generated in experiment using the standard rand functions that Matlab is provided to encrypt test image,
Encryption key KeIt is 6311664, stego-key KhIt is 7294869.
Fig. 1 a are original Baboon images, and Fig. 1 b are the Baboon encrypted images obtained using the method for the present invention；Fig. 2 a
For original Lena images, Fig. 2 b are the Lena encrypted images obtained using the method for the present invention.
It is seen by Fig. 1 b and Fig. 2 b to find out, for two encrypted images all similar to random noise, cipher round results are good.Baboon and
All pixels, that is, I × J=512 × 512=262144 pixel could be used for Information hiding, and n in LenaXValue it is identical
It is 18.For Baboon images, pixel classifications bit stream McLength nMIt is 101976, therefore the maximum steganography of Baboon is held
Measure nmaxFor：nmax=I × J-nX-nM=512 × 512-18-101976=160150 bits.For Lena images, pixel point
Class bit stream McLength nMIt is 6578, therefore the maximum steganographic capacity n of LenamaxFor：nmax=I × J-nX-nM=512 × 512-
18-6578=255548 bits.
The length of given additional information S is 160000.Fig. 3 a are the obtained Baboon of the method for the present invention containing additional information
Encrypted image, Fig. 3 b are encrypted images of the Lena containing additional information that the method for the present invention obtains.
It is seen by Fig. 3 a and Fig. 3 b to find out, two encrypted images containing additional information are similar to encrypted image, all similar to make an uproar
Sound is distributed, this illustrates that the information steganography of the present invention does not change encrypted image characteristic.It is emphasized that：Baboon is containing additional letter
The encrypted image of breath is to use same cipher key K with encrypted images of the Lena containing additional informationeWith identical stego-key KhIt generates
's.
Obtaining stego-key KhUnder conditions of, extraction algorithm according to the present invention is respectively in the encryption figure containing additional information
Additional information is extracted in picture and plaintext image containing additional information, additional information can correctly be extracted with 100% probability.Work as reception
Person obtains encryption key KeEncrypted image containing additional information accordingly can be obtained using the C of the present invention, image decryption step
To decrypted image identical with original image, Fig. 4 a are Baboon decrypted images, and Fig. 4 b are Lena decrypted images.When recipient obtains
Obtain encryption key KeEncrypted image containing additional information accordingly, can also utilize the present invention image decryption step obtain with
Plaintext image containing additional information similar in original image, Fig. 5 a are plaintext images of the Baboon containing additional information, and Fig. 5 b are
Plaintext images of the Lena containing additional information.
Fig. 6 gives 100 width test image (https://pan.baidu.com/s/1c3ikVQS) present invention is used respectively
3 algorithm of method and document carries out the maximum steganographic capacity of Information hiding, and the maximum steganographic capacity of 3 algorithm of Literature is by block
Gained in the variable pixel closed on fixed pixel is hidden in after classification matrix encryption.As seen from Figure 6, the method for the present invention
Steganographic capacity is 0.61bpp~0.99bpp, and 3 algorithm steganographic capacity of document is 0.18bpp~0.94bpp, to 100 width test charts
The steganographic capacity of picture, the method for the present invention is above 3 algorithm of document.Common test image such as Splash, Lena, Man,
The steganographic capacity of Peppers, Airplane, Baboon, the method for the present invention is respectively：0.98bpp、0.97bpp、0.95bpp、
0.93bpp、0.92bpp、0.61092；The steganographic capacity of 3 algorithm of document is respectively：0.84bpp、0.68bpp、0.61bpp、
0.72bpp、0.71bpp、0.32bpp.To this six width test image, the method for the present invention steganographic capacity is far above 3 algorithm of document.
It should be noted that the steganographic capacity in Fig. 6 has been normalized (bpp:Bit per pixel), i.e., by steganographic capacity (ratio
Special number) divided by image number of pixels.
Finally, by taking Lena images as an example, table 1 gives the method for the present invention with 3 algorithm of document respectively in steganographic capacity
0.3bpp, steganographic capacity 0.68bpp (i.e. 3 algorithm Lena image maximums steganographic capacity of document), steganographic capacity 0.97bpp are (i.e. originally
Inventive method Lena image maximums steganographic capacity) under time complexity comparing result.Experimental result is all in Intel Core
I5-6200U@2.3GHz, the PC machine of Win10,8GB memory, Matlab R2016a platform on programming experiment gained.
As shown in Table 1, the time complexity of the method for the present invention is increased slightly with the increase of steganographic capacity, is held in steganography
When amount increases to 0.97bpp, total time, complexity was still less than 1 second.In addition, the time used in image encryption, image decryption is respectively less than
0.4 second.The total time complexity of 3 algorithm of document also increases with the increase of steganographic capacity, increases to 0.68bpp in steganographic capacity
When, total time complexity be more than 6 seconds, the image encryption time be 3.05 seconds, the image decryption time be 2.9 seconds.Absolutely prove this hair
Bright method is simple, and computation complexity is low.
Algorithms T-cbmplexity comparison under 1 Lena image difference steganographic capacities of table
Claims (1)
1. a kind of safe encrypted domain reversible information hidden method based on the prediction of high bit flipping, includes the following steps：
A, image encryption
A1, pixel classifications identity matrix：
User calculates original image X, the X={ x that size is I × JI, j| i=1,2 ..., I, j=1,2 ..., J, middle pixel
xI, jUndulating value fI, j；
Wherein, i, j indicate pixel x respectivelyI, jRow serial number in original image X and row serial number, I, J are respectively original image X
Total line number and total columns；
By the pixel x in original image XI, jMost significant bit overturning, obtain overturning pixelCalculate overturning pixel's
Undulating value
Calculate the pixel x in original image XI, jPixel classifications identify mI, j,
Again by all pixels x in original image XI, jPixel classifications identify mI, j, constitute pixel classifications identity matrix M, M=
{mI, j| i=1,2 ..., I, j=1,2 ..., J；Wherein mod () is modulo operation；
A2, the compression of pixel classifications identity matrix：
User compresses pixel classifications identity matrix M with Run- Length Coding, that is, presses column scan pixel classifications identity matrix M, will be continuous
1 be considered as the distance of swimming, record the start position of each distance of swimming and the length of the distance of swimming, obtain Run- Length Coding sequence MRLC；
By Run- Length Coding sequence MRLCWith binary representation, pixel classifications bit stream M is obtainedc, pixel classifications bit stream McThe middle distance of swimming
The value for the number of bits h that start position occupies is the minimum binary representation digit of maximum distance of swimming start position；Pixel
Classify bit stream McThe value for the number of bits w that middle run length occupies is the minimum binary representation of maximum run length
Digit；User is by pixel classifications bit stream McNumber of bits h, the pixel classifications bit stream M that middle distance of swimming start position occupiescIn
The number of bits w that run length occupies has sent encryption key K toeRecipient；
A3, exclusive or-overall situation scrambling encryption：
User is according to encryption key Ke" encryption of step-by-step exclusive or " is first carried out to original image X, then carries out " location of pixels overall situation scramble
Encryption " operation, obtains exclusive or-scrambling encryption image X ＇, X ＇={ x ＇I, j| i=1,2 ..., I, j=1,2 ..., J；
A4, encrypted image is generated：
User is according to encryption key KeTo pixel classifications bit stream Mc" exclusive or encryption " is done, encrypted pixel classification bit stream is obtainedEncrypted pixel classification bit streamLength be denoted as nM；Calculate total number of pixels of exclusive or-scrambling encryption image X ＇ most
The digit n of small binary representationX,Then obtain maximum embedded bit number nmax, nmax=I × J-nX-
nM；WhereinExpression rounds up operation, log2() indicates the logarithm operation bottom of for 2；
Encrypted pixel is classified bit streamReplace the rear n of exclusive or-scrambling encryption image X ＇MA pixel, that is, x ＇A, bTo x ＇I, JPixel
Most significant bit, wherein
By the embedded bit number n of maximummaxBinary-coding replace exclusive or-scrambling encryption image X ＇ preceding nXA pixel, that is, x ＇1,1Extremely
The most significant bit of pixel, obtains encrypted image X ", X "=x "I, j| i=1,2 ..., I, j=1,2 ..., J；To finally it add
Close image X " sends high in the clouds to；
B, Information hiding
B1, additional information encryption：
High in the clouds is based on stego-key Kh" encryption of step-by-step exclusive or " is carried out to additional information S, obtains encryption additional information S ＇, encryption is attached
The bit number of information S ＇ is added to be denoted as lS；Extract the preceding n of encrypted image X "XA pixel, that is, x ＇1,1ExtremelyThe highest of pixel is effective
Position, the decimal system is converted to by the sequence extracted, obtains the embedded bit number n of maximum of encrypted imagemax, encryption additional information S ＇
Length lSBit number n embedded no more than maximummax；
B2, Information hiding：
According to stego-key Kh, random selection is except x ＇ in encrypted image X "1,1ExtremelyPixel and x ＇A, bTo x ＇I, JOutside pixel
LSEncryption additional information S ＇ write-ins are chosen in the most significant bit of pixel, generate the encryption figure containing additional information by a pixel
Picture X " ＇, X " ＇=x " ＇I, j| i=1,2 ..., I, j=1,2 ..., J；
C, image decryption
C1, the extraction of pixel classifications identity matrix：
User receives encrypted image X " ＇, X " ＇={ x " ＇ containing additional informationI, j| i=1,2 ..., I, j=1,2 ..., J, carry
Take the preceding n in ＇ of the encrypted image X " containing additional informationXA pixel, that is, x ＇1,1ExtremelyThe most significant bit of pixel, whereinThe sequence extracted is converted into the decimal system, obtains the embedded bit number n of maximum of encrypted imagemax,
To calculate encrypted pixel classification bit streamLength nM, nM=I × J-nx-nmax；
Extract the rear n of the encrypted image X " ＇ containing additional informationMA pixel, that is, x ＇A, bTo x ＇I, JThe most significant bit of pixel, whereinObtain encrypted pixel classification
Bit streamAccording to encryption key KeTo encrypted pixel classification bit stream" decryption of step-by-step exclusive or " is done, pixel classifications are obtained
Bit stream Mc；
According to pixel classifications bit stream McNumber of bits h, the pixel classifications bit stream M that middle distance of swimming start position occupiescThe middle distance of swimming
The number of bits w that length occupies, by binary pixel classifications bit stream McBe converted to metric Run- Length Coding sequence
MRLC；With Run- Length Coding decompression method decompression Run- Length Coding sequence MRLC, obtain pixel classifications identity matrix M, M={ mI, j| i=
1,2 ..., I, j=1,2 ..., J；
C2, exclusive or-overall situation scramble decryption：
Recipient is according to encryption key KeEncrypted image X " ＇ containing additional information are taken turns doing " decryption of location of pixels overall situation scramble "
" decryption of step-by-step exclusive or " obtains exclusive or-scramble decrypted image D ＇, D ＇={ d ＇I, j| i=1,2 ..., I, j=1,2 ...,
J}；
C3, decrypted image is generated：
Establish decrypted image D, D={ dI, j| i=1,2 ..., I, j=1,2 ..., J, all solutions in decrypted image D when initial
Close pixel dI, jValue be 0；By the pixel d in decrypted image DI, jIt is divided into Ta、Tb、TcAnd TdFour classes, wherein Ta={ dI, j| i=1,
J=1 }, Tb={ dI, j| i=1, j=2,3 ..., J }, Tc={ dI, j| i=2,3 ..., I, j=1 }, Td={ dI, j| i=2,
3 ..., I, j=2,3 ..., J；T in update decrypted image D successivelya、Tb、TcAnd TdFour class pixels；
The first step, update TaMiddle pixel d1,1；
Exclusive or-scramble decryption pixel d ＇ are used first1,1Value update decryption pixel d1,1, then m is identified with pixel classifications1,1Value
Update decryption pixel d1,1Most significant bit, that is, complete decryption pixel d1,1Update；
Second step updates T successively by the increased sequences of pixel ordinate jbMiddle decryption pixel dI, j；
Calculate exclusive or-scramble decryption pixel d ＇I, jThe undulating value f ＇ of (i=1, j=2,3 ..., J)I, j, f ＇I, j=| d ＇I, j-dI, j-1
|, wherein dI, j-1For updated decryption pixel；Overturn exclusive or-scramble decryption pixel d ＇I, jMost significant bit, obtain exclusive or-
Scramble decryption overturning pixelCalculate exclusive or-scramble decryption overturning pixelUndulating value
IfExclusive or-scramble decryption pixel d ＇ are used firstI, jValue update decryption pixel dI, j, then with decryption
Pixel dI, jPixel classifications at same position identify mI, jValue update decryption pixel dI, jMost significant bit；IfAnd pixel classifications identify mI, j=0, with d ＇I, jWithIn have compared with minor swing value pixel update decryption picture
Plain dI, j；IfAnd pixel classifications identify mI, j=1, with d 'I, jWithIn with larger fluctuation value pixel
Update decryption pixel dI, j；
Third step restores T successively by the increased sequences of pixel abscissa icMiddle pixel dI, j；
Calculate exclusive or-scramble decryption pixel d ＇I, jThe undulating value f ＇ of (i=2,3 ..., I j=1)I, j, f ＇I, j=| d ＇I, j-dI-1, j
|, wherein dI-1, jFor updated decryption pixel；Overturn exclusive or-scramble decryption pixel d ＇I, jMost significant bit, obtain exclusive or-
Scramble decryption overturning pixelCalculate exclusive or-scramble decryption overturning pixelUndulating value
IfExclusive or-scramble decryption pixel d ＇ are used firstI, jValue update decryption pixel dI, j, then with decryption
Pixel dI, jPixel classifications at same position identify mI, jValue update decryption pixel dI, jMost significant bit；
IfAnd pixel classifications identify mI, j=0, with d ＇I, jWithIn have compared with minor swing value pixel update
Decrypt pixel dI, j；IfAnd pixel classifications identify mI, j=1, with d ＇I, jWithIn have larger fluctuation value
Pixel update decryption pixel dI, j；
4th step updates T successively by pixel abscissa i and ordinate j successively increased sequencedMiddle pixel dI, j；
Calculate exclusive or-scramble decryption pixel d ＇I, jThe undulating value f ＇ of (i=2,3 ..., I j=2,3 ..., J)I, j,Wherein, dI-1, j-1, dI-1, jAnd dI, j-1It is updated decryption picture
Element；Overturn exclusive or-scramble decryption pixel d ＇I, jMost significant bit, obtain exclusive or-scramble decryption overturning pixelIt calculates different
Or-scramble decryption overturning pixelUndulating value
IfExclusive or-scramble decryption pixel d ＇ are used firstI, jValue update decryption pixel dI, j, then with decryption
Pixel dI, jPixel classifications at same position identify mI, jValue update decryption pixel dI, jMost significant bit；IfAnd pixel classifications identify mI, j=0, with d ＇I, jWithIn have compared with minor swing value pixel update decryption
Pixel dI, j；IfAnd pixel classifications identify mI, j=1, with d 'I, jWithIn with larger fluctuation value picture
Element update decryption pixel dI, j；
Ta、Tb、TcAnd TdAfter the completion of the update of four class pixels, that is, complete the generation of decrypted image D；
C4, the plaintext image containing additional information is generated：
Establish the plaintext image D containing additional informationM,DMMiddle pixel
Value with the value of pixel is identical at same position in decrypted image D；The image D of additional informationMPreceding nXA pixel, that is, x ＇1,1ExtremelyPixel and rear nMA pixel, that is, x ＇A, bTo x ＇I, JPixel remains unchanged, and the least significant bit of rest of pixels is used containing additional
The most significant bit update of pixel, completes the plaintext image containing additional information and generates at encrypted image X " the ＇ same positions of information；
D, information extraction
D1, the extraction of plaintext domain additional information
Recipient is according to stego-key KhIn the plaintext image D containing additional informationMIn find out carry additional information pixel, extraction
Its least significant bit obtains encryption additional information S ＇；Based on stego-key KhKey stream is generated, encryption additional information S ＇ are carried out
" decryption of step-by-step exclusive or ", obtains additional information S；
D2, the extraction of ciphertext domain additional information
According to stego-key KhThe pixel for carrying additional information is found out in ＇ in the encrypted image X " containing additional information, extracts its highest
Significance bit obtains encryption additional information S ＇；Based on stego-key KhKey stream is generated, " step-by-step is carried out to encryption additional information S ＇
Exclusive or is decrypted ", obtain additional information S.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810174576.8A CN108563956A (en) | 2018-03-02 | 2018-03-02 | Safe encrypted domain reversible information hidden method based on the prediction of high bit flipping |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810174576.8A CN108563956A (en) | 2018-03-02 | 2018-03-02 | Safe encrypted domain reversible information hidden method based on the prediction of high bit flipping |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108563956A true CN108563956A (en) | 2018-09-21 |
Family
ID=63531547
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810174576.8A Pending CN108563956A (en) | 2018-03-02 | 2018-03-02 | Safe encrypted domain reversible information hidden method based on the prediction of high bit flipping |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108563956A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN111311474A (en) * | 2020-02-04 | 2020-06-19 | 太原科技大学 | Large-capacity image encryption domain information hiding method |
| CN112508764A (en) * | 2020-12-23 | 2021-03-16 | 南京航空航天大学 | Encryption method for balancing image privacy and usability based on information embedding |
| CN113382127A (en) * | 2021-06-10 | 2021-09-10 | 绍兴聚量数据技术有限公司 | Encrypted image reversible information hiding method based on elastic selection and run length coding |
| WO2022193244A1 (en) * | 2021-03-18 | 2022-09-22 | Guangdong Oppo Mobile Telecommunications Corp., Ltd. | Method of embedding additional data onto raw pixel data and electronic device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105634732A (en) * | 2016-01-21 | 2016-06-01 | 中国人民武装警察部队工程大学 | Ciphertext domain multi-bit reversible information hiding method |
| US20160189325A1 (en) * | 2014-12-30 | 2016-06-30 | University Of Macau | Method for reversible image data hiding |
| CN105847629A (en) * | 2016-03-18 | 2016-08-10 | 大连大学 | Reversible information hiding method for encrypted image |
| CN107103631A (en) * | 2017-04-17 | 2017-08-29 | 西南交通大学 | Encrypted domain reversible information hidden method based on classification scramble and hiding information classification |
-
2018
- 2018-03-02 CN CN201810174576.8A patent/CN108563956A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160189325A1 (en) * | 2014-12-30 | 2016-06-30 | University Of Macau | Method for reversible image data hiding |
| CN105634732A (en) * | 2016-01-21 | 2016-06-01 | 中国人民武装警察部队工程大学 | Ciphertext domain multi-bit reversible information hiding method |
| CN105847629A (en) * | 2016-03-18 | 2016-08-10 | 大连大学 | Reversible information hiding method for encrypted image |
| CN107103631A (en) * | 2017-04-17 | 2017-08-29 | 西南交通大学 | Encrypted domain reversible information hidden method based on classification scramble and hiding information classification |
Non-Patent Citations (3)
| Title |
|---|
| BANGXU YIN 等: "Separable Reversible Data Hiding in Encrypted Image with Classification Permutation", 《2017 IEEE THIRD INTERNATIONAL CONFERENCE ON MULTIMEDIA BIG DATA》 * |
| XIAOTIAN WU 等: "High-capacity reversible data hiding in encrypted images by prediction error", 《SIGNAL PROCESSING》 * |
| 郑淑丽 等: "基于无损压缩的加密图像可逆信息隐藏", 《合肥工业大学学报（自然科学版）》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN111311474A (en) * | 2020-02-04 | 2020-06-19 | 太原科技大学 | Large-capacity image encryption domain information hiding method |
| CN111311474B (en) * | 2020-02-04 | 2023-06-16 | 太原科技大学 | High-capacity image encryption domain information hiding method |
| CN112508764A (en) * | 2020-12-23 | 2021-03-16 | 南京航空航天大学 | Encryption method for balancing image privacy and usability based on information embedding |
| CN112508764B (en) * | 2020-12-23 | 2024-03-15 | 南京航空航天大学 | Encryption method for balancing image privacy and usability based on information embedding |
| WO2022193244A1 (en) * | 2021-03-18 | 2022-09-22 | Guangdong Oppo Mobile Telecommunications Corp., Ltd. | Method of embedding additional data onto raw pixel data and electronic device |
| CN113382127A (en) * | 2021-06-10 | 2021-09-10 | 绍兴聚量数据技术有限公司 | Encrypted image reversible information hiding method based on elastic selection and run length coding |
| CN113382127B (en) * | 2021-06-10 | 2023-06-20 | 绍兴聚量数据技术有限公司 | Encrypted image reversible information hiding method with elastic selection and run-length coding |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108563956A (en) | Safe encrypted domain reversible information hidden method based on the prediction of high bit flipping | |
| Lee et al. | Digital image sharing by diverse image media | |
| Bansod et al. | Modified BPCS steganography using Hybrid cryptography for improving data embedding capacity | |
| CN112202984B (en) | Ciphertext domain reversible information hiding method based on error correction redundancy | |
| CN108566500A (en) | The reversible hidden method of adapting to image encrypted domain based on Hybrid Encryption mechanism | |
| Hua et al. | Reversible data hiding in encrypted images using cipher-feedback secret sharing | |
| Najih et al. | An improved secure image hiding technique using PN-sequence based on DCT-OTP | |
| CN115695675B (en) | Video encryption method for network data secure exchange | |
| Rejani et al. | Pixel pattern based steganography on images | |
| CN115865431A (en) | Network security sharing method for private data | |
| CN110211018B (en) | Chaos encryption reversible information hiding method based on odd-even discrimination strategy | |
| Islam et al. | Denoising and error correction in noisy AES-encrypted images using statistical measures | |
| Xiao et al. | High-payload completely reversible data hiding in encrypted images by an interpolation technique | |
| Alatawi et al. | The Secret image hiding schemes using Steganography-Survey | |
| Czaplewski et al. | Digital fingerprinting for color images based on the quaternion encryption scheme | |
| Brar et al. | Double layer image security system using encryption and steganography | |
| Kaur et al. | XOR-EDGE based video steganography and testing against chi-square steganalysis | |
| Menon et al. | Triple layer data hiding mechanism using cryptography and Steganography | |
| Juneja et al. | Data hiding with enhanced LSB steganography and cryptography for RGB color images | |
| Chinniyan et al. | Image Steganography Using Deep Neural Networks. | |
| Hegde et al. | Exploring the Effectiveness of Steganography Techniques: A Comparative Analysis | |
| Banu et al. | Secure reversible data hiding technique on textures using double encryption | |
| Rao et al. | Visual cryptography for image privacy protection using diverse image media | |
| Kumar et al. | Encrypting images by patch-level sparse representation for high capacity reversible data hiding | |
| Ingale et al. | E-Government Documents Authentication and Security by Utilizing Video Crypto-Steganography |
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 |