Authors:
Ching-Nung Yang
1
;
Stelvio Cimato
2
;
Jihi-Han Wu
1
and
Song-Ruei Cai
1
Affiliations:
1
National Dong Hwa University, Taiwan
;
2
Università degli studi di Milano, Italy
Keyword(s):
Visual Cryptography, Cheating, Deterministic Cheating, Cheating Prevention.
Related
Ontology
Subjects/Areas/Topics:
Information and Systems Security
;
Information Assurance
;
Information Hiding
Abstract:
In literature, (2, n) cheating prevention visual cryptographic schemes (CPVCSs) have been proposed, dealing with the case of dishonest participants, called cheaters, who can collude together to force honest participants to reconstruct a wrong secret. While (2, n)-CPVCSs resistant to deterministic cheating have been presented, the problem of defining (k, n)-CPVCS for any k has not been solved. In this paper, we discuss (3, n)-CPVCS, and propose three (3, n)-CPVCSs with different cheating prevention capabilities. To show the effectiveness of the presented (3, n)-CPVCS, some experimental results are discussed as well.