Name
Abstract | ||
|---|---|---|
In some particular scenes, the shadows need to be given different weights to represent the participants' status or importance. And during the reconstruction, participants with different weights obtain various quality reconstructed images. However, the existing schemes based on visual secret sharing (VSS) and the Chinese remainder theorem (CRT) have some disadvantages. In this paper, we propose a weighted polynomial-based SIS scheme in the field of GF (257). We use (k,k) threshold polynomial-based secret image sharing (SIS) to generate k shares and assign them corresponding weights. Then, the remaining n-k shares are randomly filled with invalid value 0 or 255. When the threshold is satisfied, the number and weight of share can affect the reconstructed image's quality. Our proposed scheme has the property of lossless recovery. And the average light transmission of shares in our scheme is identical. Experiments and theoretical analysis show that the proposed scheme is practical and feasible. Besides, the quality of the reconstructed image is consistent with the theoretical derivation. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1155/2021/5597592 | SECURITY AND COMMUNICATION NETWORKS |
DocType | Volume | ISSN |
Journal | 2021 | 1939-0114 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongjie Wang | 1 | 6 | 2.83 |
| Jia Chen | 2 | 0 | 2.03 |
| Qinghong Gong | 3 | 4 | 1.77 |
| Xuehu Yan | 4 | 205 | 34.21 |
| Yuyuan Sun | 5 | 0 | 0.34 |