2006
DOI: 10.1007/s10623-005-6342-0
|View full text |Cite
|
Sign up to set email alerts
|

Cheating in Visual Cryptography

Abstract: A secret sharing scheme allows a secret to be shared among a set of participants, P , such that only authorized subsets of P can recover the secret, but any unauthorized subset cannot recover the secret. In 1995, Naor and Shamir proposed a variant of secret sharing, called visual cryptography, where the shares given to participants are xeroxed onto transparencies. If X is an authorized subset of P , then the participants in X can visually recover the secret image by stacking their transparencies together witho… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
53
0

Year Published

2006
2006
2023
2023

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 121 publications
(53 citation statements)
references
References 12 publications
0
53
0
Order By: Relevance
“…Be that as it may, this may not be genuine dependably. In this way, a tricking counteractive action approaches are presented by Yan et al, [13], Horng et al, [14] and Hu et al, [15]. Be that as it may, it is seen in every one of these techniques, there is no office of confirmation testing.…”
Section: IImentioning
confidence: 99%
“…Be that as it may, this may not be genuine dependably. In this way, a tricking counteractive action approaches are presented by Yan et al, [13], Horng et al, [14] and Hu et al, [15]. Be that as it may, it is seen in every one of these techniques, there is no office of confirmation testing.…”
Section: IImentioning
confidence: 99%
“…The role of cheater in VC as well as the authentication and successful cheat in VC are defined by Horng, Chen and Tsai (2006). According to their definition, a cheater is someone who releases a fake share that is different from the one ( Cheating-prevention Visual Secret-sharing Schemes (CPVSS), and then categorized cheating activities into meaningful cheating, non-meaningful cheating, and meaningful deterministic cheating.…”
Section: Authentication Problem In Visual Cryptographymentioning
confidence: 99%
“…In this technique the authors implemented column pixel extension on secret image thereafter it created number of shares and again the message could encode into n number of associated shares. Authors in [8] explained that, how to obtain the original data stored within images. Authors in [9] recommended the theory of digital watermarking.…”
Section: Related Workmentioning
confidence: 99%