CN110136045A - A method of it is hidden and is restored based on the mutual scramble of two images - Google Patents
A method of it is hidden and is restored based on the mutual scramble of two images Download PDFInfo
- Publication number
- CN110136045A CN110136045A CN201910311263.7A CN201910311263A CN110136045A CN 110136045 A CN110136045 A CN 110136045A CN 201910311263 A CN201910311263 A CN 201910311263A CN 110136045 A CN110136045 A CN 110136045A
- Authority
- CN
- China
- Prior art keywords
- image
- pixel
- images
- scramble
- subgraph
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 238000012545 processing Methods 0.000 claims abstract description 9
- 238000011084 recovery Methods 0.000 claims description 6
- 230000005540 biological transmission Effects 0.000 abstract description 6
- 230000003993 interaction Effects 0.000 abstract 1
- 238000005516 engineering process Methods 0.000 description 5
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 4
- 238000011160 research Methods 0.000 description 3
- 230000009466 transformation Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 241000208340 Araliaceae Species 0.000 description 1
- 208000027534 Emotional disease Diseases 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 150000001875 compounds Chemical class 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
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
-
- 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
-
- 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/0203—Image watermarking whereby the image with embedded watermark is reverted to the original condition before embedding, e.g. lossless, distortion-free or invertible watermarking
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Bioethics (AREA)
- Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Facsimile Transmission Control (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Editing Of Facsimile Originals (AREA)
Abstract
A kind of method hidden and restored the invention discloses two image scramblings based on broad sense Chinese remainder theorem.The present invention is to the identical two images of picture size, be primarily based on preset one group two-by-two relatively prime prime number obtain two groups of subgraphs after modulus respectively, partial subgraph is therefrom randomly selected again to exchange the pixel portion for carrying out corresponding position, obtain scramble hide after two groups of subgraphs, realize to original image to while encrypt.When restoring processing, it is primarily based on scramble and hides when processing set one group relatively prime prime number two-by-two, all unordered pixels pair are accurately recovered from two groups of given subgraphs, then according to the feature of image, the unordered pixel alignment of obtained pixel centering really is divided into two classes, based on classification results, original two images are nondestructively recovered, realize the encrypted transmission interaction of image pair.The present invention can efficiently, accurately recover encrypted image, and operand is small.And considerably increase the decoding difficulty of illegal user.
Description
Technical field
The invention belongs to secret communications and technical field of image information processing, and in particular to a kind of image information hide with it is extensive
Compound method.
Background technique
With the development of internet digital multimedia technology, the safety issue of information is due to being related to individual privacy, business
The fields such as interests and state secret and become more and more important.Therefore, reliable encryption is carried out to the information of transmission,
As the most important research direction in current information security field.
Since the data volume of digital picture is big and the characteristics such as easy fascination as caused by vision, using image as the letter of carrier
Encryption for information technology becomes one of the research hotspot of safe information transmission.One of technology to image concealing be to its scramble,
I.e. sender makees transformation to digital picture to be concealed and is allowed to become what width naked eyes can not be distinguished by mathematics or other technologies
It is used further to transmit after image；In image transmitting process, original is obtained from image without still method being intercepted and captured by illegal identity person
The information of image, to achieve the purpose that image encryption.Recipient can be decrypted by scheduled method, be gone out to restore original
Image.Scrambling encryption process can be carried out in the locational space and color space of image in spatial domain, can also be in its frequency domain
It carries out, or even can be carried out simultaneously in spatial domain and frequency domain.Therefore the encryption method is versatile and flexible, legitimate user can freely control
The selection of algorithm, the selection of parameter and use random number technology, greatly increase the decoding difficulty of illegal interceptor.
The big aspect of the algorithm of existing image scrambling can be divided into based on picture position space, based on image color space and
Scramble based on image frequency domain space.Specifically, the classical disorder method based on picture position space be such as based on Arnold conversion,
The image scrambling methods such as Hilbert curve, Magic Square Transformation, queue transformation.Image scrambling method based on color space is such as based on
The methods of chaos sequence, image scrambling of Gray code.The above method is all based on single image, to based on multiple figures
The scramble research of picture is relatively fewer, and the invention proposes the disorder method based on two images, image letters big with decoding difficulty
Cease the advantages that efficiency of transmission is high.
Summary of the invention
Goal of the invention of the invention is: in view of the above problems, providing a kind of based on broad sense Chinese remainder theorem
The mutual scramble of two images hide and restore scheme.
The present invention is first by the pixel of two pictures by several relatively prime moulds two-by-two, then by these pixels by original
Position constitutes subgraph, and wherein two pictures of identical molds are known as with mould to image.In the Digital Image Scrambling stage, two will be obtained
The part of group image is exchanged with the pixel of mould pair.Then it is transmitted respectively.It is fixed by the Chinese remainder of broad sense in receiving end
Reason, recovers two unordered pixels pair first.Then according to the image received, determine that two images are corresponding respectively
Pixel.
It is of the invention based on the mutual scramble hidden method of two images, be by a kind of based on broad sense Chinese remainder theorem method
Technical solution realizes, comprising the following steps:
Step 1: choosing relatively prime mould m two-by-two appropriate1,m2,...,mn, so that any pixel in image is to can be at this
Group mould under can uniquely be resumed out, be based on broad sense Chinese remainder theorem, the present invention in, selected mould should meet following relationship
Formula:Wherein, n indicates the quantity of selected mould.
Step 2: treat the mutual two images for setting processing is indicated with image A, B respectively, and the picture size phase of image A, B
Together；
To all pixels of image A about m1,m2,...,mnModulo operation respectively, the pixel after obtaining each pixel modulus
Value ai,j: ai,j≡pi mod mj, i=1,2 ..., S, j=1,2 ..., n, wherein piIndicate the ith pixel point of image A
Pixel value, S indicates mutually to set the pixel number of image；
To obtain about different mould mjModulo operation after image (i.e. the subgraph of image A): A1,A2,...,An；
Step 3: to all pixels of image B about m1,m2,...,mnModulo operation respectively, after obtaining each pixel modulus
Pixel value value bi,j: bi,j≡qimodmj, i=1,2 ..., S, j=1,2 ..., n；Wherein, qiIndicate i-th of picture of image B
The pixel value of vegetarian refreshments；
To obtain about different mould mjModulo operation after image (i.e. the subgraph of image B): B1,B2,...,Bn；
Step 4: from n to image to (A1,B1),…,(An,Bn) in, t is randomly selected to image pairAs the object that partial pixel exchanges, i.e., pending partial pixel (is randomly selected into the portion in subgraph
Point pixel is as pixel to be exchanged) pixel of the same pixel position of image pair exchanged is interchangeable, thus must
Image pair after to exchange
Step 5: after exchange by step 4 processing, obtain exchanging treated encrypted image:
Belong to the n subimage sequence of A:
Belong to the n subimage sequence of B:
In order to further ensure two images can completely be recovered from the subgraph after scramble, in the present invention, can set
T is set to be less thanTake it is whole after value.
Image encryption method above by exchange processing mode of the invention, brought technical effect are as follows:
(1) achieve the purpose that Information hiding by making full use of the information of given two images and their subgraphs,
Since whole system does not need additional other images, therefore greatly reduce the design difficulty of system.
(2) based on the two images disorder method of broad sense Chinese remainder theorem, since which figure illegal user can not determine
As pair and which pixel of image pair exchange, therefore traditional Chinese remainder theorem method or the method for search etc. can not be used
It goes accurately to recover two images, considerably increases the decoding difficulty of illegal user.
(3) do not had during the entire process of image information is hidden based on two image scrambling methods of broad sense Chinese remainder theorem
There is the information that additional is extra, therefore increases the efficiency of transmission of image information.
Corresponding of the invention based on the mutual scramble hidden method of two images, the invention also discloses one kind based on more than broad sense China
Two image recovery methods of number theorem comprising following steps:
Step 1: to receiving based on two images mutual scramble hidden methods treated two groups of subimage sequences (every group of son
Graphic sequence corresponds to an image to be restored), it is combined by the subgraph of two groups of subimage sequences of ordered pair, it is opposite to obtain multipair figure,
It is denoted asWherein,The identical two secondary subgraph of sequence in two groups of subimage sequences, and j=1 are respectively indicated,
2 ..., n, n indicate image log amount；
As unit of image pair, the sum of pixel value of same pixel point of each pair of image pair is calculated about m according to formulaj
Remainder c after modulusi,j:Wherein,Indicate subgraphIn the pixel value of ith pixel point,
Indicate subgraphIn the pixel value of ith pixel point, j=1,2 ..., n, m1,m2,...,mnIndicate that the mutual scramble of two images is hidden
N in the processing of hiding method two-by-two relatively prime mould, symbolIndicate x about mjRemainder after modulus.
Step 2: note M=m1m2...mn, Mi=M/miAndMeetAnd calculate following two ginseng
Number:
Wherein, For flow in upper plenum.
Step 3: solving equation (x-si)2-(ξi,1-2si)(x-si)+ξi,2=0 two roots: { xi,1,xi,2}。
Step 4: determine image to be restored to respective pixel:
According to formulaCalculating parameter ej；Determine subgraphCorresponding image A to be restored
Each pixel pi:
Determine subgraphEach pixel q of corresponding image B to be restoredi: qi={ xi,1,xi,2}\{pi}。
Step 5: every width based on determined by step 4 restores the respective pixel of image, and be restored image A and B, that is, restores
The corresponding original image A and B of two groups of subimage sequences out.
In conclusion by adopting the above-described technical solution, the beneficial effects of the present invention are:
Compared with existing image recovery method, the present invention proposes the two images scramble based on broad sense Chinese remainder theorem
Restoration methods and system have the following advantages.
1, the present invention makes full use of the information of given two images and their subgraphs to achieve the purpose that Information hiding,
Since whole system does not need additional other images, therefore greatly reduce the design difficulty of system.
2, the two images disorder method provided by the invention based on broad sense Chinese remainder theorem, since illegal user can not
Determine which pixel of which image pair and image pair exchanges, thus can not with traditional Chinese remainder theorem method or
The method etc. of search goes accurately to recover two images, considerably increases the decoding difficulty of illegal user.
3, it is provided by the invention based on two image scrambling methods of broad sense Chinese remainder theorem image information hide it is whole
During a, without the extra information of additional, therefore the efficiency of transmission of image information is increased.
4, efficient, the required fortune of the restoration methods of two image scramblings provided by the invention based on broad sense Chinese remainder theorem
Calculation amount is small.
Detailed description of the invention
Fig. 1 is the hiding processing flow schematic diagram of the mutual scramble of two images in specific embodiment；
Fig. 2 is at the reply for hiding treated two groups of subimage sequences to the mutual scramble of two images in specific embodiment
Manage flow diagram；
Fig. 3 is the image in specific embodiment, after modulo operation is carried out to image A (being named as Lena): A1 in figure~
Subgraph shown in A5；
Fig. 4 is the image in specific embodiment, after modulo operation is carried out to image (being named as Zelda): B1 in figure~
Subgraph shown in B5；
Fig. 5 is in specific embodiment, to subgraph to A4 and B4, the pixel replacement of the part corresponding position in A5 and B5
Subgraph afterwards；
Fig. 6 is the two images in specific embodiment, after being restored using Chinese remainder theorem method；
Fig. 7 is in specific embodiment, using two width figures after the recovery of the invention with broad sense Chinese remainder theorem method
Picture.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, below with reference to embodiment and attached drawing, to this hair
It is bright to be described in further detail.
Referring to Fig. 1, Fig. 3 and Fig. 4, in order to realize that the mutual scramble to image A to be transmitted and image B two images is hidden, i.e.,
Realize the mutual encryption to image to (A, B), the specific implementation process is as follows:
Firstly, one group of setting relatively prime mould (also referred to as prime number) m two-by-two1,m2,...,mn, andWherein j=1,2 ..., n；In present embodiment, being provided with one group includes 5
The mould group of mould, respectively is: 4,5,7,11,13；This group of mould will be shared on image receiving end, at the recovery of image
Reason；
Again respectively by image A and B about prime number m relatively prime two-by-two1,m2,...,m5Two groups of subgraphs are obtained after modulus respectively
Picture is denoted as A1~A5 and B1~B5, as shown in Figure 3,4 respectively；Wherein the size of image A and B is identical, this specific embodiment party
It is 512 × 512 in formula.
Then t is taken out from this two groups of subgraphs to subgraph:With WithWithIn order to guarantee
Two images can completely be recovered from the subgraph after scramble, it is desirable that t is less thanTake it is whole after value.By this t to image
The pixel portion of corresponding position is exchanged, and is obtained t and is denoted as respectively to new subgraphWith WithWith
And then it obtains about mould m1,m2,...,mnTwo groups of subgraphs be respectively as follows:With
In present embodiment, the value that t is arranged is 2, and the subgraph of exchange is to setting are as follows: A4 and B4, A5 and B5, from
And obtain two groups of subgraphs after mutual scramble as shown in Figure 5 is hidden；And receiving end is sent to two groups of subimage sequences.
Referring to fig. 2, two groups of subimage sequences for receiving:WithThe present invention using the Chinese remainder theorem of broad sense recover the pixels of two images to after further according to
The feature of image finds out corresponding pixel.
Detailed process is as follows for it:
First to the subgraph pair sequentially constituted, the sum of pixel value of same pixel position is calculated about corresponding mould
Remainder after modulus matches corresponding mould by sequence index, such as first pair of subgraph pair, then matched mould is m1,
Second couple of corresponding m2, and so on.
All unordered pixels are accurately recovered from two groups of subgraphs using corresponding calculation process to { pi,qi, i.e. root
According to solution equation (x-si)2-(ξi,1-2si)(x-si)+ξi,2=0 two obtained root { xi,1,xi,2}.Then according to the spy of image
Sign, the unordered pixel alignment of obtained pixel centering really is classified, i.e., finds out the pixel for belonging to A and B respectively, to all pictures
After element is all accurately classified, originally two images can be recovered nondestructively, and restoration result is as shown in Figure 7.
Compared with the two images after the existing recovery using Chinese remainder theorem method (shown in Fig. 6), the present invention can be high
Effect accurately recovers encrypted image, and operand is small.And since illegal user can not determine which image pair and figure
Which pixel of the picture in exchanges, therefore can not go accurately to restore with traditional Chinese remainder theorem method or the method for search etc.
Two images out considerably increase the decoding difficulty of illegal user.
The above description is merely a specific embodiment, any feature disclosed in this specification, except non-specifically
Narration, can be replaced by other alternative features that are equivalent or have similar purpose；Disclosed all features or all sides
Method or in the process the step of, other than mutually exclusive feature and/or step, can be combined in any way.
Claims (3)
1. one kind is based on the mutual scramble hidden method of two images, characterized in that it comprises the following steps:
Step 1: choosing one group of relatively prime two-by-two mode sequence: m1,m2,...,mn, wherein n indicates the quantity of selected mould；
The mould of selection meets:
Step 2: treat the mutual two images for setting processing is indicated with image A, B respectively, and the picture size of image A, B are identical；
To all pixels of image A about m1,m2,...,mnModulo operation respectively, the pixel value after obtaining each pixel modulus
ai,j: ai,j≡pimodmj, i=1,2 ..., S, j=1,2 ..., n, wherein piIndicate the pixel of the ith pixel point of image A
Value, S indicate the pixel number for mutually setting image；
To obtain about different mould mjModulo operation after subgraphs sequence: A1,A2,...,An；
Step 3: to all pixels of image B about m1,m2,...,mnModulo operation respectively, the picture after obtaining each pixel modulus
Plain value value bi,j: bi,j≡qimodmj, i=1,2 ..., S, j=1,2 ..., n；Wherein, qiIndicate the ith pixel point of image B
Pixel value；
To obtain about different mould mjModulo operation after subgraphs sequence: B1,B2,...,Bn；
Step 4: from n to image to (A1,B1),…,(An,Bn) in, t is randomly selected to image pairMake
For partial pixel exchange object, thus the image pair after being exchanged
Step 5: it obtains mutual scramble and hides treated two groups of image sequences:
Belong to the n subimage sequence of A:
Belong to the n subimage sequence of B:
2. the method as described in claim 1, which is characterized in that setting t is less thanTake it is whole after value.
3. a kind of two image recovery methods based on broad sense Chinese remainder theorem, characterized in that it comprises the following steps:
Step 1: being based on two images mutual scramble hidden methods treated two based on of any of claims 1 or 2 to receiving
Group subimage sequence, is combined by the subgraph of two groups of subimage sequences of ordered pair, and it is opposite to obtain multipair figure, is denoted asIts
In,Respectively indicate the identical two secondary subgraph of sequence in two groups of subimage sequences, and j=1,2 ..., n；
As unit of image pair, according to based on the mode sequence used in the mutual scramble hidden method processing of two images: m1,m2,...,
mn, the sum of pixel value of same pixel point of each pair of image pair is calculated about the remainder c after each mould modulusi,j；
Wherein, Indicate subgraphIn the pixel value of ith pixel point,Indicate subgraph
In the pixel value of ith pixel point, j=1,2 ..., n, symbolIndicate x about mjRemainder after modulus；
Step 2: note parameter M=m1m2...mn, Mi=M/miAndMeetAnd calculate following two parameter:
Wherein, For flow in upper plenum；
Step 3: solving equation (x-si)2-(ξi,1-2si)(x-si)+ξi,2=0 obtains two roots: { xi,1,xi,2}；
Step 4: determine image to be restored to respective pixel:
According to formulaCalculating parameter ej；Determine subgraphCorresponding image A's to be restored is every
A pixel pi:
Determine subgraphEach pixel q of corresponding image B to be restoredi: qi={ xi,1,xi,2}\{pi}；
Step 5: every width based on determined by step 4 restores the respective pixel of image, and be restored image A and B.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910311263.7A CN110136045B (en) | 2019-04-18 | 2019-04-18 | Method for hiding and recovering based on mutual scrambling of two images |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910311263.7A CN110136045B (en) | 2019-04-18 | 2019-04-18 | Method for hiding and recovering based on mutual scrambling of two images |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110136045A true CN110136045A (en) | 2019-08-16 |
| CN110136045B CN110136045B (en) | 2022-12-20 |
Family
ID=67570295
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910311263.7A Expired - Fee Related CN110136045B (en) | 2019-04-18 | 2019-04-18 | Method for hiding and recovering based on mutual scrambling of two images |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110136045B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110136046A (en) * | 2019-05-20 | 2019-08-16 | 李小平 | Two image scramblings with thresholding hide and the method for reconstruct |
| CN110473214A (en) * | 2019-08-19 | 2019-11-19 | 李小平 | Image scrambling and restoration methods based on Ramanujan matrix |
| CN113222829A (en) * | 2021-02-25 | 2021-08-06 | 安徽师范大学 | Bezier-based digital image separate storage method and image restoration method |
| CN110136046B (en) * | 2019-05-20 | 2024-07-05 | 北京宏硕数通科技有限公司 | Two-image scrambling hiding and reconstructing method with threshold |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001052178A1 (en) * | 2000-01-13 | 2001-07-19 | Digimarc Corporation | Authenticating metadata and embedding metadata in watermarks of media signals |
| CN1471019A (en) * | 2003-06-26 | 2004-01-28 | 上海交通大学 | Digital waterprint imbedding and extracting method based on remainder image |
| JP2004064720A (en) * | 2002-06-03 | 2004-02-26 | Fujitsu Ltd | Binarizing method, binarizing apparatus, image forming device, binarization program and computer readable recording medium with binarization program recorded thereon |
| CN101667285A (en) * | 2009-09-25 | 2010-03-10 | 上海大学 | Reversible data hiding method based on pixel grouping strategy |
| WO2012120674A1 (en) * | 2011-03-10 | 2012-09-13 | Ｎｔｔエレクトロニクス株式会社 | Memory access device |
| CN103761702A (en) * | 2014-01-09 | 2014-04-30 | 太原科技大学 | Image hiding and authentication method based on secret sharing |
| CN103903215A (en) * | 2014-01-27 | 2014-07-02 | 西安理工大学 | Multi-image encryption method based on chaos and FrFT domain phase retrieval process |
| CN106228504A (en) * | 2016-07-17 | 2016-12-14 | 西安电子科技大学 | Based on plaintext and the digital image encryption method of key structure encryption parameter |
| CN106910156A (en) * | 2017-02-27 | 2017-06-30 | 东北大学 | A kind of New chaotic image encryption method with plaintext association key stream generting machanism |
| CN107274458A (en) * | 2017-06-15 | 2017-10-20 | 东北林业大学 | Quantum multicolor image encryption algorithm based on chaos system |
-
2019
- 2019-04-18 CN CN201910311263.7A patent/CN110136045B/en not_active Expired - Fee Related
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001052178A1 (en) * | 2000-01-13 | 2001-07-19 | Digimarc Corporation | Authenticating metadata and embedding metadata in watermarks of media signals |
| JP2004064720A (en) * | 2002-06-03 | 2004-02-26 | Fujitsu Ltd | Binarizing method, binarizing apparatus, image forming device, binarization program and computer readable recording medium with binarization program recorded thereon |
| CN1471019A (en) * | 2003-06-26 | 2004-01-28 | 上海交通大学 | Digital waterprint imbedding and extracting method based on remainder image |
| CN101667285A (en) * | 2009-09-25 | 2010-03-10 | 上海大学 | Reversible data hiding method based on pixel grouping strategy |
| WO2012120674A1 (en) * | 2011-03-10 | 2012-09-13 | Ｎｔｔエレクトロニクス株式会社 | Memory access device |
| CN103761702A (en) * | 2014-01-09 | 2014-04-30 | 太原科技大学 | Image hiding and authentication method based on secret sharing |
| CN103903215A (en) * | 2014-01-27 | 2014-07-02 | 西安理工大学 | Multi-image encryption method based on chaos and FrFT domain phase retrieval process |
| CN106228504A (en) * | 2016-07-17 | 2016-12-14 | 西安电子科技大学 | Based on plaintext and the digital image encryption method of key structure encryption parameter |
| CN106910156A (en) * | 2017-02-27 | 2017-06-30 | 东北大学 | A kind of New chaotic image encryption method with plaintext association key stream generting machanism |
| CN107274458A (en) * | 2017-06-15 | 2017-10-20 | 东北林业大学 | Quantum multicolor image encryption algorithm based on chaos system |
Non-Patent Citations (8)
| Title |
|---|
| SATHISHKUMAR G.A.: "Image Encryption using random pixel permutation by chaotic mapping", <2012 IEEE SYMPOSIUM ON COMPUTER&INFORMATICS> * |
| SHYONG JIAN SHYU: "Threshold Secret Image Sharing by Chinese Remainder Thorem", <2008 IEEE ASIA-PACIFIC SERVICES CONFERENCE> * |
| WEI WANG: "The Largest Dynamic Range of a Generalized Chinese Remainder Theorem for Two Integers", <IEEE SIGNAL PROCESSING LETTERS> * |
| XIAOPING LI: "A Secret Image Restoring Scheme Using Threshold Pairs of Unordered Image Shares", <IEEE ACCESS> * |
| YAN KE: "A Reversible Data Hiding Scheme in Encrypted Domain for Secret Image Sharing Based on Chinese Remainder", <IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY> * |
| 张欢: "一种多门限秘密图像共享机制的研究", 《中国优秀硕士学位论文全文数据库 (信息科技辑)》 * |
| 王兴元: "一种基于抖动和混沌技术的数字图像篡改检测及修复算法", 《物理学报》 * |
| 郭静博: "基于物理随机位生成器与混沌像素交叉互换的图像加密算法", 《包装工程》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110136046A (en) * | 2019-05-20 | 2019-08-16 | 李小平 | Two image scramblings with thresholding hide and the method for reconstruct |
| CN110136046B (en) * | 2019-05-20 | 2024-07-05 | 北京宏硕数通科技有限公司 | Two-image scrambling hiding and reconstructing method with threshold |
| CN110473214A (en) * | 2019-08-19 | 2019-11-19 | 李小平 | Image scrambling and restoration methods based on Ramanujan matrix |
| CN110473214B (en) * | 2019-08-19 | 2022-11-18 | 李小平 | Image scrambling and recovering method based on Ramanujan matrix |
| CN113222829A (en) * | 2021-02-25 | 2021-08-06 | 安徽师范大学 | Bezier-based digital image separate storage method and image restoration method |
| CN113222829B (en) * | 2021-02-25 | 2023-04-25 | 安徽师范大学 | Bernstein-based digital image splitting method and image restoration method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110136045B (en) | 2022-12-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Denis et al. | Hybrid data encryption model integrating multi-objective adaptive genetic algorithm for secure medical data communication over cloud-based healthcare systems | |
| Shankar et al. | RGB-based secure share creation in visual cryptography using optimal elliptic curve cryptography technique | |
| CN110417539A (en) | A kind of color image encrypting method of dynamic chaos and matrix convolution operation | |
| CN108809644B (en) | Disorder high-capacity multiparty quantum key negotiation method based on high-energy level bell state | |
| Qu et al. | Quantum steganography with large payload based on entanglement swapping of χ-type entangled states | |
| CN108322622A (en) | A kind of color digital image encryption method based on 2D-VMD and octuple hyperchaotic system | |
| Guo et al. | A multi-threshold secret image sharing scheme based on MSP | |
| Gafsi et al. | Efficient encryption system for numerical image safe transmission | |
| CN104881838B (en) | One kind is based on GF (23) (K, N) significant point deposited without expansion image and reconstructing method | |
| Kim et al. | New reversible data hiding scheme for encrypted images using lattices | |
| CN109547199A (en) | A kind of method that multi-party joint generates SM2 digital signature | |
| CN110136045A (en) | A method of it is hidden and is restored based on the mutual scramble of two images | |
| Fang et al. | A secure chaotic block image encryption algorithm using generative adversarial networks and DNA sequence coding | |
| Geetha et al. | Optimal visual cryptographic scheme with multiple share creation for multimedia applications | |
| Rose et al. | A secure verifiable scheme for secret image sharing | |
| John et al. | 2d lorentz chaotic model coupled with logistic chaotic model for medical image encryption: Towards ensuring security for teleradiology | |
| Wang et al. | Quantum grayscale image encryption and secret sharing schemes based on Rubik’s Cube | |
| Fadhil et al. | Improved Security of a Deep Learning-Based Steganography System with Imperceptibility Preservation | |
| Wei et al. | A novel quantum steganography protocol based on probability measurements | |
| Shrivas et al. | A survey on visual cryptography techniques and their applications | |
| Nadeem | Position-based quantum cryptography over untrusted networks | |
| Sun et al. | High‐Capacity Data Hiding Method Based on Two Subgroup Pixels‐Value Adjustment Using Encoding Function | |
| Jian et al. | Quantum identity authentication using a Hadamard gate based on a GHZ state | |
| CN111400731B (en) | Quantum image encryption method based on DNACNot | |
| Krishnagopal et al. | Image encryption and steganography using chaotic maps with a double key protection |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20221220 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |