Name
Abstract | ||
|---|---|---|
Visual cryptography scheme (VCS) shares a binary secret image into multiple shadows, only qualified set of shadows can reveal the secret image by stacking operation. However, VCS suffers the problems of low visual quality of the revealed image and large shadow size. A (t, k, n) XOR-based visual cryptography scheme (XVCS) shares the secret image into n shadows including t essentials and n-t non-essentials. A qualified set of shadows contains any k shadows including t essentials. The revealing process is implemented by XOR operation on the involved shadows. In this paper, we propose a construction method for (t, k, n)-XVCS with essential shadows. The secret image can be revealed perfectly, and the shadow size is small compared with VCS. Theoretical analysis and experimental results show the security and effectiveness of the proposed scheme. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.jvcir.2020.102911 | Journal of Visual Communication and Image Representation |
Keywords | DocType | Volume |
XOR operation,Essential participants,Visual cryptography,Secret image sharing | Journal | 72 |
ISSN | Citations | PageRank |
1047-3203 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peng Li | 1 | 6 | 1.78 |
| Jianfeng Ma | 2 | 340 | 40.21 |
| Quan Ma | 3 | 0 | 0.34 |