CN112529974B - Color visual password sharing method and device for binary image - Google Patents
Color visual password sharing method and device for binary image Download PDFInfo
- Publication number
- CN112529974B CN112529974B CN202011397847.XA CN202011397847A CN112529974B CN 112529974 B CN112529974 B CN 112529974B CN 202011397847 A CN202011397847 A CN 202011397847A CN 112529974 B CN112529974 B CN 112529974B
- Authority
- CN
- China
- Prior art keywords
- color
- shares
- equal
- image
- steps
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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 binary images. The method comprises the following steps: determining a binary image S and a minimum authorization set for the (k, n) threshold access structure; randomly selecting an element from the minimum authorized set, and marking the element as Q; assigning a shared part corresponding to the element in Q; and outputting n shares. The (k, n) threshold color visual password sharing method designed by the invention not only has no size expansion, but also improves the visual quality of the reconstructed image.
Description
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 binary images.
Background
The visual cryptography (Visual Cryptography, VC) sharing technique is to encode a binary image pixel by pixel to obtain several sub-images (also called shares) that resemble random noise, and no information about the secret image is available from a single share. The decryption mode of the visual cryptography is very simple, and a secret image can be directly recognized through a human visual system only by printing a certain number of shared copies on a transparent film and physically superposing the shared copies. The visual password sharing technology has very wide application prospect due to the convenience of theoretical security and decryption modes. The size expansion and the contrast are two main indexes for evaluating the visual password sharing method, the size expansion refers to the size proportion of the shared copies to the secret image, and the contrast refers to the visual quality of the reconstructed image relative to the secret image. Larger size expansion increases the storage space and transmission burden of the shared copies, and lower contrast affects the discrimination of reconstructed images by the human visual system.
In order to reduce the size expansion of the share, many scholars have conducted intensive studies on a visual password sharing method of reducing the size expansion, and proposed various methods, for example, a probability-based visual password sharing method and a random mesh-based visual password sharing method. For another example, a binary image color visual password sharing method (CBW-VCS for short) encodes a binary image to generate a plurality of color shares, but the method needs to design an encoding matrix and has a problem of size expansion. For this purpose, a learner proposes a color vision password sharing method (abbreviated as RG-CBW-VCS) based on a random grid. 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 matrixes, and the design of the matrix is a difficulty of the traditional method. In order to avoid designing the basis matrix, a learner proposes 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:
input: secret image S of size h×w.
And (3) outputting: n shares S1, S2, …, sn.
(1) Repeating steps 2-4 for each pixel S (H, W) of the secret image S, wherein 1.ltoreq.h.ltoreq.H, 1.ltoreq.w.ltoreq.W.
(2) Randomly takes n values from the set {0,1}, respectively denoted v 1 ，…，v n . If it isTurning to step 3; otherwise, taking a number i from any of {1,2, …, k }, let v i ＝1-v i 。
(3) For v 1 ，…，v n Performing replacement operation to obtain
(4) Will beAssigned to the corresponding share->Wherein { i } 1 ，…，i n }＝{1，2，…，n}。
(5) Obtain n shared shares (or random grid) S 1 ，…，S n 。
In the secret image recovery stage, only k shared copies are selected from n shared copies, then the k shared copies are printed on a transparent film, and finally the k shared copies are physically overlapped to decrypt the secret image. 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, paper "Random grid based color visual cryptography scheme 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 extends the concept of a random grid to the color pixel domain and defines 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 the binary image is provided; the method is not only suitable for the general access structure, but also suitable for the general access structure in a broad sense. However, since this method uses a random grid for image sharing, there is still room for improvement in visual quality of the reconstructed image.
Disclosure of Invention
The invention aims to overcome the defects of the prior art, and provides a method and a device for sharing a color visual password of a binary image, aiming at (k, n) RG-CBW-VCS, and further improving the visual quality of a reconstructed image.
According to a first aspect of the present invention, there is provided a color visual password sharing method of a binary image. The method comprises the following steps: determining a binary image S and a minimum authorization set for the (k, n) threshold access structure; randomly selecting an element from the minimum authorized set, and marking the element as Q; assigning a shared part corresponding to the element in Q; and outputting n shares.
According to a second aspect of the present invention, there is provided a color visual cryptography sharing apparatus of a binary image. The device comprises: an input unit for inputting a binary image S and a minimum authorization set of the (k, n) threshold access structure; an element selection unit for arbitrarily selecting one element from the minimum authorized set, denoted as Q; the assignment unit is used for assigning the shared part corresponding to the element in the Q; and an output unit for outputting the n shares.
Compared with the prior art, the invention has the advantages that aiming at the (k, n) threshold access structure, the invention designs the color visual password sharing method and the system, which can effectively improve the visual quality of the reconstructed image and keep the advantages of no size expansion and no codebook design.
Other features of the present invention and its advantages will become apparent from the following detailed description of exemplary embodiments of the invention, 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 chart of a method for color visual cryptography sharing of binary images 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, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless it is specifically stated otherwise.
The following description of at least one exemplary embodiment is merely exemplary in nature and is in no way intended to limit the invention, its application, or uses.
Techniques, methods, and apparatus known to one 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 specific values should be construed as merely illustrative, and not a limitation. Thus, other examples of exemplary embodiments may have different values.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further discussion thereof is necessary in subsequent figures.
Referring to fig. 1, the color visual password sharing method for binary images provided by the invention generally includes: step S110, inputting a binary image S and a minimum authorization set of a (k, n) threshold access structure; step S120, arbitrarily selecting an element from the minimum authorization set, and marking the element as Q; step S130, assigning a shared part corresponding to the element in the Q; step S140, outputting n color shares. The specific process is as follows:
input: a binary image S of size H W, and a minimum authorized set Γ of (k, n) threshold access structures 0 ＝{Q 1 ，…，Q m }, wherein
And (3) outputting: n shares of color shared S 1 ，…，S n 。
Step S11, repeating steps S12-17 for each pixel S (H, W) of the secret image S, wherein 1.ltoreq.h.ltoreq.H, 1.ltoreq.w.ltoreq.W.
Step S12, from Γ 0 Optionally selecting one element Q j ＝{i 1 ，…，i k (i) 1 ，…，i k And j is the number of the participant, and 1.ltoreq.j.ltoreq.m.
Step S13, from the color set(k-1) and is assigned to color pixels +.>
Wherein the symbols in the color set correspond to a predetermined color type, e.g., R for red, B for blue,white, etc.
Step S14, byObtain the color pixel r k Wherein->Representing a boolean exclusive-or operation.
Step S15, the k color pixels are processedRespectively allocated to corresponding k sharing shares
Step S16, for the remaining (n-k) color pixelsThe values are respectively from->Wherein { q } is randomly derived 1 ，…，q n-k }＝{1，2，…，n}-{i 1 ，…，i k }。
Alternatively, the process may be carried out in a single-stage,are assigned to the white pixels.
Step S17, combining the (n-k) color pixelsRespectively allocated to corresponding (n-k) shared shares
Step S18, obtaining n shares of color sharing S 1 ,…,S n 。
In the above process, color pixels are calculated in steps S13 and S14In combination with the way of step S16 for color pixels>The invention effectively improves the visual quality of the reconstructed image, and under the condition of not designing a base matrix, the shared share without size expansion is obtained.
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) is a reconstructed image of all shares. As can be seen from the experimental simulation results of FIG. 1, the present invention can obtain a higher quality reconstructed image.
In addition, the contrast ratio comparison result of the present invention with the prior art (Random grid based color visual cryptography scheme for black and white secret images with general access structures) is shown in table 1 below.
TABLE 1 contrast comparison results of the present invention with the prior art
As can be seen from table 1, the contrast ratio of the present invention is significantly improved, and thus the visual quality of the reconstructed image is effectively improved.
In summary, the invention obtains sharing share without size expansion for the color visual password sharing method of binary images, does not need to design a sharing matrix, and improves the visual quality of the reconstructed images. 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 thereon for causing a processor to implement aspects of the present invention.
The computer readable storage medium may be a tangible device that can hold and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage 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: portable computer disks, hard disks, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), static Random Access Memory (SRAM), portable compact disk read-only memory (CD-ROM), digital Versatile Disks (DVD), memory sticks, floppy disks, mechanical coding devices, punch cards or in-groove structures such as punch cards or grooves having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media, as used herein, are not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through waveguides or other transmission media (e.g., optical pulses through fiber optic cables), or electrical signals transmitted through 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 over 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 transmissions, wireless transmissions, routers, firewalls, switches, gateway computers and/or edge servers. The network interface 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.
Computer program instructions for carrying out operations of the present invention may be assembly 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 be executed 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 kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected 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 electronic circuitry, such as programmable logic circuitry, field Programmable Gate Arrays (FPGAs), or Programmable Logic Arrays (PLAs), with state information for computer readable program instructions, which can execute the computer readable program instructions.
Various 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 having the instructions stored therein includes 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 flowcharts 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, implementation by software, and implementation by a combination of software and hardware are all equivalent.
The foregoing description of embodiments of the invention has been presented for purposes of illustration and description, and is not intended to be exhaustive or 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 various embodiments described. The terminology used herein was chosen in order to best explain the principles of the embodiments, the practical application, or the technical improvements 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 (6)
1. A color visual password sharing method of binary images comprises the following steps:
determining a binary image S and a minimum authorization set for the (k, n) threshold access structure;
randomly selecting an element from the minimum authorized set, and marking the element as Q;
assigning a shared part corresponding to the element in Q;
outputting n shares;
wherein for a binary image S of size h×w, and a minimum authorized set Γ of (k, n) threshold access structures 0 ＝{Q 1 ,…,Q m The following steps are performed to output n color shares S 1 ,…,S n Whereink. n is an integer greater than or equal to 2:
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 Γ 0 Optionally selecting one element Q j ＝{i 1 ,…,i k (i) 1 ,…,i k The number of the participants is greater than or equal to 1 and less than or equal to m;
step S3, arbitrarily selecting (k-1) from the color sets {.C, M, Y, B, G, R, omicron }, and assigning to the color pixels
Step S4, byObtain the color pixel r k Wherein->Representing a boolean exclusive-or operation;
step S5, obtaining k color pixelsRespectively allocated to corresponding k sharing shares
Step S6, for the remaining (n-k) color pixelsThe values are respectively from->Wherein { q } is randomly derived 1 ,…,q n-k }＝{1,2,…,n}-{i 1 ,…,i k }；
Step S7, the (n-k) color pixels are processedRespectively allocated to corresponding (n-k) shared shares
2. The method according to claim 1, wherein, for step S6Are assigned to the white pixels.
3. The method of claim 1, further comprising decrypting the encrypted S image according to the steps of:
arbitrarily selecting k shares from the n shares;
printing the k shares on a transparent film;
and physically superposing the printed k sharing shares, and decrypting the secret image.
4. A color visual cryptography sharing apparatus of a binary image, comprising:
an input unit: a minimum authorization set for inputting the binary image S and the (k, n) threshold access structure;
element selection unit: for arbitrarily selecting an element from the minimum set of grants, denoted Q;
assignment unit: the method is used for assigning the shared part corresponding to the element in the Q;
an output unit: for outputting n shares;
wherein for a binary image S of size h×w, and a minimum authorized set Γ of (k, n) threshold access structures 0 ＝{Q 1 ,…,Q m The following steps are performed to output n color shares S 1 ,…,S n Whereink. n is an integer greater than or equal to 2:
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 Γ 0 Optionally selecting one element Q j ＝{i 1 ,…,i k (i) 1 ,…,i k The number of the participants is greater than or equal to 1 and less than or equal to m;
step S3, arbitrarily selecting (k-1) from the color sets {.C, M, Y, B, G, R, omicron }, and assigning to the color pixels
Step S4, byObtain the color pixel r k Wherein->Representing a boolean exclusive-or operation;
step S5, obtaining k color pixelsRespectively allocated to corresponding k sharing shares
Step S6, for the remaining (n-k) color pixelsThe values are respectively from->Wherein { q } is randomly derived 1 ,…,q n-k }＝{1,2,…,n}-{i 1 ,…,i k }；
Step S7, the (n-k) color pixels are processedRespectively allocated to corresponding (n-k) shared shares
5. A computer readable storage medium having stored thereon a computer program, wherein the program when executed by a processor realizes the steps of the method according to any of claims 1 to 3.
6. A computer device comprising a memory and a processor, on which memory a computer program is stored which can be run on the processor, characterized in that the processor implements the steps of the method according to any of claims 1 to 3 when the program is executed.
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 CN112529974A (en) | 2021-03-19 |
| CN112529974B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Citations (3)
| 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 |
-
2020
- 2020-12-03 CN CN202011397847.XA patent/CN112529974B/en active Active
Patent Citations (3)
| 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)
| Title |
|---|
| 基于通用存取结构的异或区域递增式视觉密码方案;胡浩等;机辅助设计与图形学学报;第27卷(第11期);第2116-2125页 * |
| 基于随机栅格的异或区域递增式视觉密码方案;胡浩;沈刚;郁滨;马浩俊夫;;计算机研究与发展(08);第1857-1866页 * |
| 灰度可视秘密共享方案分析与设计;刘健;张益;刘玉岭;胡浩;;网络与信息安全学报(04);第140-147页 * |
| 视觉密码方案分析与设计研究;沈刚;中国博士学位论文全文数据库信息科技辑(第06期);第I138-11页第5章 * |
| 视觉密码的彩色栅格地图分存算法;房礼国等;中国图象图形学报(第01期);第123-132页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112529974A (en) | 2021-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Praveenkumar et al. | Medical data sheet in safe havens–A tri-layer cryptic solution | |
| CN112529974B (en) | Color visual password sharing method and device for binary image | |
| Yuan et al. | A new image cryptosystem based on 2D hyper-chaotic system | |
| Ramya et al. | An extensive review on visual cryptography schemes | |
| Blesswin et al. | Enhanced semantic visual secret sharing scheme for the secure image communication | |
| Hodeish et al. | An optimized halftone visual cryptography scheme using error diffusion | |
| Thomas et al. | Review on various visual cryptography schemes | |
| Kumar et al. | A GRU and chaos-based novel image encryption approach for transport images | |
| WO2022241307A1 (en) | Image steganography utilizing adversarial perturbations | |
| Fan et al. | User‐friendly XOR‐based visual secret sharing by random grid | |
| Geetha et al. | Multiple share creation based visual cryptographic scheme using diffusion method with a combination of chaotic maps for multimedia applications | |
| Pande et al. | Visual cryptography schemes using compressed random shares | |
| Yi et al. | Adaptive code embedding for reversible data hiding in encrypted images | |
| Koh et al. | Encrypted cloud photo storage using Google photos | |
| Chen et al. | On the design of a two-decoding-option image secret sharing scheme | |
| CN112399027A (en) | Picture encryption and decryption method and device, storage medium and electronic equipment | |
| Chiu et al. | An XOR-based progressive visual cryptography with meaningful shares | |
| Chang et al. | Distortion‐free secret image sharing method with two meaningful shadows | |
| Satar et al. | A new model for hiding text in an image using logical connective | |
| Dixit et al. | Multilevel network security combining cryptography and steganography on ARM platform | |
| Mishra et al. | An approach for security of color image data in coordinate, geometric, and frequency domains | |
| Broumandnia | Scale invariant digital image encryption using 3D modular chaotic map | |
| Poongothai et al. | Retinal Encryption Using Snnipet Pixel XOR with Huffman Sequential Encoding for Privacy Augmentation | |
| Pathak et al. | Sparse Compression-Based Image Encryption using Data Encryption Standards RC5 | |
| Shrivastava et al. | A modified approach of key manipulation in cryptography using 2d graphics image |
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 |