2018
DOI: 10.3390/cryptography2030024
|View full text |Cite
|
Sign up to set email alerts
|

A New Visual Multi-Secrets Sharing Scheme by Random Grids

Abstract: In (2, 2)-visual secret sharing (VSS) schemes, a common type of (k, n)-threshold VSS schemes, secret information can be decoded directly through only two shares by using a human vision system. Several studies have analyzed methods of simplifying the decoding process and refining encoding to pass more secret images through two identical shares. However, limited secret images are retrieved, and the quality of the recovered images is low. This paper proposes an advanced (2, 2)-VSS scheme that can embed N secret i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
11
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 10 publications
0
11
0
Order By: Relevance
“…Some disadvantages of the mentioned scheme [12] are as follows: the distortions are fixed, the input secret image should be a square, and the number of input secret images should be < or = 4. To address these disadvantages, Chang et al [14,15] proposed some advanced schemes.…”
Section: Kk1 Algorithm (Proposed Inmentioning
confidence: 99%
See 4 more Smart Citations
“…Some disadvantages of the mentioned scheme [12] are as follows: the distortions are fixed, the input secret image should be a square, and the number of input secret images should be < or = 4. To address these disadvantages, Chang et al [14,15] proposed some advanced schemes.…”
Section: Kk1 Algorithm (Proposed Inmentioning
confidence: 99%
“…In the VMSSS [15] , the input images 𝑆 0 , 𝑆 1 , • • • , 𝑆 𝑁−1 of size 𝑚 × 𝑛 pixels are encoded into two shares 𝐺 1 and 𝐺 2 , and integer 𝑝 is selected according to user requirements (must be a positive factor of the width of the image 𝑚 ). Two consecutive images are randomly selected, and each set (2𝑝 pixels) is processed using Chang and Juan' s scheme [14] .…”
Section: Kk1 Algorithm (Proposed Inmentioning
confidence: 99%
See 3 more Smart Citations