An (n, n) threshold Visual Cryptography Scheme for Cheating prevention
In this paper, we propose an (n, n) threshold visual cryptography scheme for cheating prevention to improve the generic transformation for cheating prevention scheme (GTCP). We analysis the cheating problem in the GTCP, and present the cheating method applied it to attack on the GTCP. Then we construct the matrices for cheating prevention with following features: (a) each participant cant gain any useful information from his shares, (b) each pixel has the same number of black and white subpixels in the secret share and in the verification share, (c) ones verification image will be recovered by stacking of his verification share and the secret share, (d) the secret image can be revealed by stacking all the secret shares. The analysis showed that our scheme can avoid cheating.
visual cryptography multi-secrets basis matrix cheater
Qin Chen Wen-Fang Peng Min Zhang Yi-Ping Chu
Institute of Software and Intelligent Technology College of Computer, Hangzhou Dianzi University Hangzhou ZheJiang 310018 P.R.China
国际会议
成都
英文
587-592
2010-07-07（万方平台首次上网日期，不代表论文的发表时间）