2014
DOI: 10.1109/tcsvt.2013.2280097
|View full text |Cite
|
Sign up to set email alerts
|

Random-Grid-Based Visual Cryptography Schemes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…Authentication ensures that only an authenticated group of individuals can reconstruct the secret message as the key shares are available to them [19]. Modifying key share data or deleting the share do not reveal the secret.…”
Section: E Secret E Subkey E Sharementioning
confidence: 99%
“…Authentication ensures that only an authenticated group of individuals can reconstruct the secret message as the key shares are available to them [19]. Modifying key share data or deleting the share do not reveal the secret.…”
Section: E Secret E Subkey E Sharementioning
confidence: 99%
“…Visual Secret Sharing (VSS) [15][16][17][18][19][20][21][22][23][24][25] is a kind of technique that hides secret first and partitions it to multi-parties for sharing purpose. This technique can be dated back to 1979, Shamir [15] and Blakley [16] provide two different ( , tn ) secret sharing mechanisms, respectively.…”
Section: Vss Techniquementioning
confidence: 99%
“…Cimato et al [14] introduced probabilistic VCS that can achieve better visual quality at the price of larger size expansion. Researchers proposed random grid based visual secret sharing schemes [15], [16]. These schemes can achieve non-expansible shadows.…”
Section: Introductionmentioning
confidence: 99%