Construction of General (k, n) Probabilistic Visual Cryptography Scheme

作     者：Ching-Nung Yang Chih-Cheng Wu Feng Liu 

作者机构：with the Department of Computer Science and Information Engineering National Dong Hwa University with State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences. 

出 版 物：《Journal of Electronic Science and Technology》 (电子科技学刊（英文版）)

年 卷 期：2011年第9卷第4期

页      面：317-324页

学科分类：0839[工学-网络空间安全] 08[工学] 080203[工学-机械设计及理论] 0802[工学-机械工程] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported in part by the Testbed@TWISC, National Science Council under the Grant No. 100-2219-E-006-001 in part by National Natural Science Foundation of China under the Grant No. 60903210 

主　　题：Probabilistic visual cryptography visual cryptography visual secret sharing. 

摘      要：Visual cryptography scheme （VCS） is a secure method that encrypts a secret image by subdividing it into shadow images. Due to the nature of encryption VCS is categorized into two types： the deterministic VCS （DVCS） and the probabilistie VCS （PVCS）. For the DVCS, we use m （known as the pixel expansion） subpixels to represent a secret pixel. The PVCS uses only one subpixel to represent a secret pixel, while the quality of reconstructed image is degraded. A well-known construction of （k, n）-PVCS is obtained from the （k, n）-DVCS. In this paper, we show another construction of （k, n）-PVCS by extending the （k, k）-PVCS.