Construction of General (k, n) Probabilistic Visual Cryptography Scheme |
| |
Authors: | Ching-Nung Yang Chih-Cheng Wu Feng Liu |
| |
Institution: | 1.Department of Computer Science and Information Engineering,National Dong Hwa University;2.State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences |
| |
Abstract: | 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 probabilistic 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. |
| |
Keywords: | Probabilistic visual cryptography visual cryptography visual secret sharing |
|
| 点击此处可从《电子科技学刊:英文版》浏览原始摘要信息 |
| 点击此处可从《电子科技学刊:英文版》下载免费的PDF全文 |