2012
DOI: 10.1016/j.jvcir.2012.08.006
|View full text |Cite
|
Sign up to set email alerts
|

A new authentication based cheating prevention scheme in Naor–Shamir’s visual cryptography

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
27
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 34 publications
(27 citation statements)
references
References 13 publications
0
27
0
Order By: Relevance
“…The pixel expansion m refers to the number of pixels in a share used to encode a pixel of the secret image. According to the properties in Table 1, the proposed method can encode the n base-shares into the n verifiable-shares without deriving the extra shares [6], verification shares [4,5,7,20,22], and pixel expansion [4,5,22]. Moreover, the size of the n verifiable-shares of the proposed method is same as the original base-shares.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…The pixel expansion m refers to the number of pixels in a share used to encode a pixel of the secret image. According to the properties in Table 1, the proposed method can encode the n base-shares into the n verifiable-shares without deriving the extra shares [6], verification shares [4,5,7,20,22], and pixel expansion [4,5,22]. Moreover, the size of the n verifiable-shares of the proposed method is same as the original base-shares.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Hence, the contrast of the base-shares is unaltered. The degraded contrasts of the CPVC scheme [4,5,20,22], method 2 of the scheme in [7], and the proposed method are listed in the last column of Table 1. For the overall comparisons, the proposed CPVC method is practical and can endow conventional VC schemes with the ability to prevent cheating without carrying additional verification shares and pixel expansion shares.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…There are already many cheating immune VCSs by additional information, e.g., using verification shadows or images [10][11][12][13][14][15]. Here, we construct a cheating immune (2, n)-BPVCS without the use of extra information.…”
Section: The Proposed (2 N)-bpvcsmentioning
confidence: 99%