Cheating in Visual Cryptography
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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 without performing any computation. In this paper, we address the issue of cheating by dishonest participants, called cheaters, in visual cryptography. The experimental results demonstrate that cheating is possible when the cheaters form a coalition in order to deceive honest participants. We also propose two simple cheating prevention visual cryptographic schemes.
- Blakley G., Safeguarding Cryptographic Keys, Proc. AFIPS 1979 Natl. Conf. New York, Vol. 48 (1979) pp. 313–317.
- Brickell, E. F., Stinson, D. R. (1991) The detection of cheaters in threshold schemes. SIAM J. Disc. Math. 4: pp. 502-510
- Carpenteri, M. (1995) A perfect threshold secret sharing scheme to identify cheaters. Des. Codes Cryptogr. 5: pp. 183-187
- Chang, C. C., Chuang, J. C. (2002) An image intellectual property protection scheme for gray-level image using visual secret sharing strategy. Pattern Recogn. Lett. 23: pp. 931-941
- Chang, C. C., Hwang, R. J. (1997) Efficient cheater identification method for threshold schemes. IEE Proc.-Comput. Digit. Technol. 144: pp. 23-27
- Naor, M., Pinkas, B. Visual Authentication and Identification. In: Burton, S. Kaliski eds. (1997) Advances in Cryptology—Proceedings of Crypto 97. Springer-Verlag, New York, pp. 322-336
- Naor, M., Shamir, A. Visual cryptography. In: Santis, Alfredo eds. (1995) Advances in Cryptology—Proceedings of Eurocypto 94. Springer-Verlag, New York, pp. 1-12
- Ogata, W., Kurosawa, K. Optimum secret sharing scheme secure against cheating. In: Maurer, Ueli M. eds. (1996) Advances in Cryptology—Proceedings of Eurocypto 96. Springer-Verlag, New York, pp. 200-211
- Rabin, M. (1989) Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36: pp. 335-348 CrossRef
- Shamir, A. (1979) How to share a secret. Comm. ACM 22: pp. 612-613 CrossRef
- G. J. Simmons, An introduction to shared secret and/or shared control schemes and their applications, Contemporary Cryptology, IEEE Press, Piscataway (1991) pp. 491–497.
- Tompa, M., Woll, H. (1988) How to share a secret with cheaters. J. Cryptology 1: pp. 133-138
- Wang, C. C., Tai, S. C., Yu, C. S. (2000) Repeating image watermarking technique by the visual cryptography. IEICE Trans. Fundamentals E83-A: pp. 1589-1598
- Cheating in Visual Cryptography
Designs, Codes and Cryptography
Volume 38, Issue 2 , pp 219-236
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- visual cryptography
- secret sharing
- visual authentication
- Industry Sectors
- Author Affiliations
- 1. Department of Computer Science, National Chung Hsing University, 250 Kuo-Kuang Road, Taichung, 40227, Taiwan, R. O. C
- 2. Department of Information Management, Hsiuping Institute of Technology, 11, Gongye Rd., Dali City,Taichung County 412, Taiwan R. O. C.