Weighted Secret Image Sharing for a <inline-formula> <tex-math notation="LaTeX">$(k,n)$ </tex-math></inline-formula> Threshold Based on the Chinese Remainder Theorem
In general, in a secret image sharing (SIS) scheme with a (k, n) threshold, the participants have equal weights, and their shares have the same average light transmission. No share can reveal any information about the secret. Only when the number of participants involved in restoration is greater th...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8704915/ |