CN112529974A - Color visual password sharing method and device for binary image - Google Patents

Color visual password sharing method and device for binary image Download PDF

Info

Publication number
CN112529974A
CN112529974A CN202011397847.XA CN202011397847A CN112529974A CN 112529974 A CN112529974 A CN 112529974A CN 202011397847 A CN202011397847 A CN 202011397847A CN 112529974 A CN112529974 A CN 112529974A
Authority
CN
China
Prior art keywords
shares
color
steps
computer
image
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
Application number
CN202011397847.XA
Other languages
Chinese (zh)
Other versions
CN112529974B (en
Inventor
刘祖权
朱国普
杨建权
常杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Institute of Advanced Technology of CAS
Original Assignee
Shenzhen Institute of Advanced Technology of CAS
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shenzhen Institute of Advanced Technology of CAS filed Critical Shenzhen Institute of Advanced Technology of CAS
Priority to CN202011397847.XA priority Critical patent/CN112529974B/en
Publication of CN112529974A publication Critical patent/CN112529974A/en
Application granted granted Critical
Publication of CN112529974B publication Critical patent/CN112529974B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • G06T7/10—Segmentation; Edge detection
    • G06T7/12—Edge-based segmentation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • G06T7/90—Determination of colour characteristics

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Multimedia (AREA)
  • Image Processing (AREA)

Abstract

The invention discloses a color visual password sharing method and device for a binary image. The method comprises the following steps: determining a minimum authorization set of the binary image S and the (k, n) threshold access structure; randomly selecting an element from the minimum authorization set, and recording the element as Q; assigning the shared shares corresponding to the elements in the Q; and outputting n shares. The (k, n) threshold color vision password sharing method designed by the invention has no size expansion, and improves the vision quality of the reconstructed image.

Description

Color visual password sharing method and device for binary image
Technical Field
The invention relates to the technical field of multimedia information security, in particular to a color visual password sharing method and device for a binary image.
Background
The Visual Cryptography (VC) sharing technique is to encode a binary image by pixels to obtain a plurality of sub-images (also called shares) similar to random noise, and no information about a secret image can be obtained from a single share. The decryption mode of the visual cryptography is very simple, and a certain number of shared copies are printed on the transparent film and physically superposed, and then the secret image can be directly identified through a human visual system. Due to the theoretical safety of the visual password sharing technology and the convenience of a decryption mode, the application prospect is very wide. Size expansion and contrast are two main indexes for evaluating the visual password sharing method, wherein the size expansion refers to the size proportion of the shared image to the secret image, and the contrast refers to the visual quality of the reconstructed image relative to the secret image. The larger size expansion increases the storage space and transmission load of the share, and the lower contrast affects the discrimination of the reconstructed image by the human visual system.
In order to reduce the size expansion of shares, many scholars have conducted intensive studies on a visual password sharing method for reducing the size expansion, and various methods such as a probability-based visual password sharing method and a random mesh-based visual password sharing method have been proposed. For another example, a color vision password sharing method (CBW-VCS) for binary images, which encodes a binary image to generate a plurality of color shares, requires designing an encoding matrix and has a problem of size expansion. To this end, researchers have proposed a random grid based color vision password sharing method (RG-CBW-VCS for short). Although the method realizes no size expansion, the visual quality of the reconstructed image is poor and needs to be further improved.
The traditional visual cryptography method is completed based on two Boolean basis matrixes, and the design of the basis matrixes is a difficult point of the traditional method. In order to avoid designing a base matrix, some researchers propose a (k, n) threshold visual password sharing method based on a random grid, which is abbreviated as (k, n) -RGVCS, and the specific steps are as follows:
inputting: a secret image S of size H × W.
And (3) outputting: n shares S1, S2, …, Sn.
(1) For each pixel S (H, W) of the secret image S, steps 2-4 are repeated, where H is 1. ltoreq. h.ltoreq.H, and W is 1. ltoreq. w.ltoreq.W.
(2) Randomly taking n values from the set {0, 1}, and respectively recording the values as v1，…，vn. If it is not
Figure BDA0002815876870000021
Turning to the step 3; otherwise, take any number i from {1, 2, …, k }, let vi＝1-vi。
(3) For v1，…，vnBy performing a replacement operation to obtain
Figure BDA0002815876870000022
(4) Will be provided with
Figure BDA0002815876870000023
Is allocated to the corresponding share
Figure BDA0002815876870000024
Wherein { i1，…，in}＝{1，2，…，n}。
(5) Obtaining n shares (or random grids) S1，…，Sn。
In the stage of recovering the secret image, the secret image can be decrypted by randomly selecting k shares from the n shares, printing the k shares on a transparent film and finally physically superposing the k shares. In the encryption and decryption stages of the image, there is a loss of information and the visual quality of the reconstructed image is low.
Furthermore, the papers "Random grid based color visual cryptography for black and white secret images with general access structures" (Signal Processing: Image Communication 75 (2019)) 100-110, Xiaotian Wu and Zhao-Rong Lai, first extend the concept of Random grid to the color pixel domain and define the exclusive OR operation of the color pixel domain. Then, based on the random grid of the color pixel domain, a color visual password sharing method of a binary image is provided; the method is not only suitable for general access structures, but also suitable for general access structures in a broad sense. However, since this method uses a random mesh for image sharing, there is room for improvement in the visual quality of the reconstructed image.
Disclosure of Invention
The present invention is directed to overcome the above-mentioned drawbacks of the prior art, and provides a color vision password sharing method and apparatus for binary images, which further improves the visual quality of reconstructed images for (k, n) RG-CBW-VCS.
According to a first aspect of the present invention, a color vision password sharing method for a binary image is provided. The method comprises the following steps: determining a minimum authorization set of the binary image S and the (k, n) threshold access structure; randomly selecting an element from the minimum authorization set, and recording the element as Q; assigning the shared shares corresponding to the elements in the Q; and outputting n shares.
According to a second aspect of the present invention, there is provided a color vision password sharing apparatus for binary images. The device includes: an input unit for inputting a binary image S and a minimum authorization set of (k, n) threshold access structures; an element selection unit for arbitrarily selecting one element from the minimum grant set, denoted as Q; the assignment unit is used for assigning the shared shares corresponding to the elements in the Q; and an output unit for outputting the n shares.
Compared with the prior art, the color visual password sharing method and the color visual password sharing system have the advantages that aiming at the (k, n) threshold access structure, the color visual password sharing method and the color visual password sharing system are designed, the visual quality of the reconstructed image can be effectively improved, and the advantages of no size expansion and no code book design are kept.
Other features of the present invention and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description, serve to explain the principles of the invention.
FIG. 1 is a flow diagram of a color visual password sharing method of a binary image according to one embodiment of the present invention;
fig. 2 is an experimental result according to an embodiment of the present invention.
Detailed Description
Various exemplary embodiments of the present invention will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless specifically stated otherwise.
The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the invention, its application, or uses.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
Referring to fig. 1, the color visual password sharing method for a binary image provided by the present invention generally includes: step S110, inputting a binary image S and a minimum authorization set of a (k, n) threshold access structure; step S120, randomly selecting an element from the minimum authorization set, and recording the element as Q; step S130, assigning the shared shares corresponding to the elements in the Q; in step S140, n color shares are output. The specific process is as follows:
inputting: a binary image S of size H x W, and a minimum grant set Γ for (k, n) threshold access structures0＝{Q1，…，QmTherein of
Figure BDA0002815876870000048
And (3) outputting: n shares of color S1，…，Sn。
Step S11, for each pixel S (H, W) of the secret image S, steps S12-17 are repeated, where H is 1. ltoreq. H, and W is 1. ltoreq. W.
Step S12, from Γ0Optionally selecting an element Qj＝{i1，…，ikIn which { i }1，…，ikIs the participant number, and 1 ≦ j ≦ m.
Step S13, from color set
Figure BDA0002815876870000049
Is arbitrarily selected to (k-1) and assigned to the color pixels
Figure BDA0002815876870000041
Wherein the symbols in the color set correspond to predetermined color types, e.g., R for red, B for blue,
Figure BDA00028158768700000410
indicating white, etc.
Step S14, by
Figure BDA0002815876870000042
Obtaining a color pixel rkWherein
Figure BDA0002815876870000043
Representing a boolean xor operation.
Step S15, converting the k color pixels
Figure BDA0002815876870000044
Respectively allocated to corresponding k shares
Figure BDA0002815876870000045
Step S16, for the remaining (n-k) color pixels
Figure BDA0002815876870000046
The values thereof are respectively from
Figure BDA0002815876870000047
Where { q } is randomly obtained, where1，…，qn-k}＝{1，2，…，n}-{i1，…，ik}。
Alternatively,
Figure BDA0002815876870000051
are assigned to white pixels.
Step S17, converting the (n-k) color pixels
Figure BDA0002815876870000052
Respectively allocated to corresponding (n-k) shares
Figure BDA0002815876870000053
Step S18, obtaining n color shares S1,…,Sn。
In the above process, the color pixels are calculated in steps S13 and S14
Figure BDA0002815876870000054
In combination with the color pixels in step S16
Figure BDA0002815876870000055
The assignment of the method effectively improves the visual quality of the reconstructed image, and obtains the share without size expansion under the condition of not designing a base matrix.
To further verify the feasibility of the present invention, an image containing the letter "SIAT" was used as the subject of (2,4) RG-CBW-VCS, and the experimental results are shown in FIG. 2, where (a) is a secret image, (b) - (e) are shares, (f) - (k) are reconstructed images of any 2 shares, (l) - (o) are reconstructed images of any 3 shares, and (p) are reconstructed images of all shares. As can be seen from the experimental simulation results of fig. 1, the present invention can obtain a reconstructed image of higher quality.
In addition, the comparison results of the contrast ratio between the present invention and the prior art (Random grid based color visual cryptography scheme for black and white hierarchy images with general access structures) are shown in the following table 1.
Table 1 comparison of the contrast of the present invention with that of the prior art
Figure BDA0002815876870000056
As can be seen from table 1, the contrast of the present invention is significantly improved, and thus the visual quality of the reconstructed image is effectively improved.
In conclusion, aiming at the color vision password sharing method of the binary image, the invention obtains the share without size expansion, does not need to design a sharing matrix, and improves the vision quality of the reconstructed image. The color image visual password sharing method can be used for identity authentication, digital watermarking and the like.
The present invention may be a system, method and/or computer program product. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied therewith for causing a processor to implement various aspects of the present invention.
The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.
The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.
The computer program instructions for carrying out operations of the present invention may be assembler instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer-readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, aspects of the present invention are implemented by personalizing an electronic circuit, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA), with state information of computer-readable program instructions, which can execute the computer-readable program instructions.
Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.
These computer-readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer-readable medium storing the instructions comprises an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. It is well known to those skilled in the art that implementation by hardware, by software, and by a combination of software and hardware are equivalent.
Having described embodiments of the present invention, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein is chosen in order to best explain the principles of the embodiments, the practical application, or improvements made to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. The scope of the invention is defined by the appended claims.

Claims (7)

1. A color visual password sharing method of a binary image comprises the following steps:
determining a minimum authorization set of the binary image S and the (k, n) threshold access structure;
randomly selecting an element from the minimum authorization set, and recording the element as Q;
assigning the shared shares corresponding to the elements in the Q;
and outputting n shares.
2. Method according to claim 1, characterized in that for a binary image S of size hxw, and a minimum authorization set of (k, n) threshold access structures Γ 0 ═ { Q ═ Q1，...，QmExecuting the following steps to output n color shares S1，...，SnWherein
Figure FDA0002815876860000011
k. n is an integer of 2 or more:
step S1, repeating steps S2-S7 for each pixel S (H, W) of the image S, wherein H is greater than or equal to 1 and less than or equal to H, and W is greater than or equal to 1 and less than or equal to W;
step S2, from Γ0Optionally selecting an element Qj＝{i1，...，ikIn which { i }1，...，ikJ is more than or equal to 1 and less than or equal to m;
step S3, from color set
Figure FDA00028158768600000112
Is arbitrarily selected to (k-1) and assigned to the color pixels
Figure FDA0002815876860000012
Step S4, by
Figure FDA0002815876860000013
Obtaining a color pixel rkWherein
Figure FDA0002815876860000014
Representing a boolean exclusive or operation;
step S5, obtaining k color pixels
Figure FDA0002815876860000015
Respectively allocated to corresponding k shares
Figure FDA0002815876860000016
Step S6, for the remaining (n-k) color pixels
Figure FDA0002815876860000017
The values thereof are respectively from
Figure FDA0002815876860000018
Where { q } is randomly obtained, where1，...，qn-k}＝{1，2，...，n}-{i1，...，ik}；
Step S7, converting the (n-k) color pixels
Figure FDA0002815876860000019
Respectively allocated to corresponding (n-k) shares
Figure FDA00028158768600000110
3. The method of claim 2, wherein step S6 is repeated
Figure FDA00028158768600000111
Are assigned to white pixels.
4. The method of claim 1, further comprising decrypting the encrypted S-image according to the following steps:
randomly selecting k shares from the n shares;
printing the k shares on a transparent film;
and the printed k shares are physically superposed, and then the secret image is decrypted.
5. A color vision password sharing apparatus for binary images, comprising:
an input unit: a minimum authorization set for inputting a binary image S and a (k, n) threshold access structure;
an element selection unit: for arbitrarily selecting an element from the minimum authorization set, denoted as Q;
an assignment unit: the sharing share assignment method comprises the steps of assigning values to sharing shares corresponding to elements in Q;
an output unit: for outputting n shares.
6. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 4.
7. A computer device comprising a memory and a processor, on which memory a computer program is stored which is executable on the processor, characterized in that the processor implements the steps of the method according to any one of claims 1 to 4 when executing the program.
CN202011397847.XA 2020-12-03 2020-12-03 Color visual password sharing method and device for binary image Active CN112529974B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011397847.XA CN112529974B (en) 2020-12-03 2020-12-03 Color visual password sharing method and device for binary image

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011397847.XA CN112529974B (en) 2020-12-03 2020-12-03 Color visual password sharing method and device for binary image

Publications (2)

Publication Number Publication Date
CN112529974A true CN112529974A (en) 2021-03-19
CN112529974B CN112529974B (en) 2023-07-25

Family

ID=74997277

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011397847.XA Active CN112529974B (en) 2020-12-03 2020-12-03 Color visual password sharing method and device for binary image

Country Status (1)

Country Link
CN (1) CN112529974B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114996766A (en) * 2022-08-01 2022-09-02 江西财经大学 Image sharing method and system based on two-dimension code social network and storage medium
CN115033918A (en) * 2022-06-09 2022-09-09 易顺云(深圳)科技有限公司 Enterprise integrated information management method and system

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW201126476A (en) * 2010-01-18 2011-08-01 Chin-Chen Chang A (2,2) circular sharing techniques for two color secret images
CN109003218A (en) * 2018-06-13 2018-12-14 成都信息工程大学 A method of construction thresholding visual cryptography matrix
CN111177746A (en) * 2019-12-12 2020-05-19 中国科学院深圳先进技术研究院 Efficient visual secret sharing method with core participants

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW201126476A (en) * 2010-01-18 2011-08-01 Chin-Chen Chang A (2,2) circular sharing techniques for two color secret images
CN109003218A (en) * 2018-06-13 2018-12-14 成都信息工程大学 A method of construction thresholding visual cryptography matrix
CN111177746A (en) * 2019-12-12 2020-05-19 中国科学院深圳先进技术研究院 Efficient visual secret sharing method with core participants

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
刘健;张益;刘玉岭;胡浩;: "灰度可视秘密共享方案分析与设计", 网络与信息安全学报, no. 04, pages 140 - 147 *
房礼国等: "视觉密码的彩色栅格地图分存算法", 中国图象图形学报, no. 01, pages 123 - 132 *
沈刚: "视觉密码方案分析与设计研究", 中国博士学位论文全文数据库信息科技辑, no. 06, pages 138 - 11 *
胡浩;沈刚;郁滨;马浩俊夫;: "基于随机栅格的异或区域递增式视觉密码方案", 计算机研究与发展, no. 08, pages 1857 - 1866 *
胡浩等: "基于通用存取结构的异或区域递增式视觉密码方案", 机辅助设计与图形学学报, vol. 27, no. 11, pages 2116 - 2125 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115033918A (en) * 2022-06-09 2022-09-09 易顺云(深圳)科技有限公司 Enterprise integrated information management method and system
CN115033918B (en) * 2022-06-09 2023-05-05 易顺云(深圳)科技有限公司 Enterprise integrated information management method and system
CN114996766A (en) * 2022-08-01 2022-09-02 江西财经大学 Image sharing method and system based on two-dimension code social network and storage medium

Also Published As

Publication number Publication date
CN112529974B (en) 2023-07-25

Similar Documents

Publication Publication Date Title
Yi et al. Separable and reversible data hiding in encrypted images using parametric binary tree labeling
Hou et al. Random-grid-based visual cryptography schemes
Abd El-Latif et al. A new meaningful secret sharing scheme based on random grids, error diffusion and chaotic encryption
Li et al. Distortion less secret image sharing scheme for Internet of Things system
Machkour et al. A novel image encryption algorithm based on the two-dimensional logistic map and the latin square image cipher
CN112529974B (en) Color visual password sharing method and device for binary image
US20190213711A1 (en) Color image authentication method based on palette compression technique
EP3447963A1 (en) Method for protecting data
Hanif et al. A novel and efficient multiple RGB images cipher based on chaotic system and circular shift operations
Kumar et al. Threshold visual secret sharing based on Boolean operations
EP4374542A1 (en) Hybrid public-key and private-key cryptographic systems based on iso-rsa encryption scheme
CN113793245A (en) Image encryption method, image decryption device, electronic device, and medium
Zhao et al. Image Encryption Algorithm Based on a Novel Improper Fractional‐Order Attractor and a Wavelet Function Map
Sharma et al. Visual cryptographic techniques for secret image sharing: a review
Yampolskiy et al. Password protected visual cryptography via cellular automaton rule 30
Singh et al. Don't see me, just filter me: towards secure cloud based filtering using Shamir's secret sharing and POB number system
Fan et al. User‐friendly XOR‐based visual secret sharing by random grid
Pande et al. Visual cryptography schemes using compressed random shares
Yi et al. Adaptive code embedding for reversible data hiding in encrypted images
Sarmah et al. Cryptography and digital image steganography techniques
CN112399027A (en) Picture encryption and decryption method and device, storage medium and electronic equipment
Chen et al. On the design of a two-decoding-option image secret sharing scheme
Chang et al. Distortion‐free secret image sharing method with two meaningful shadows
Kuo et al. Secure multi-group data hiding based on gemd map
Swapnali et al. A cryptographic key generation on a 2D graphics using RGB pixel shuffling and transposition

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