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...

Täydet tiedot

Bibliografiset tiedot

Päätekijät:	Longdan Tan, Yuliang Lu, Xuehu Yan, Lintao Liu, Longlong Li
Aineistotyyppi:	Artigo
Kieli:	Inglês
Julkaistu:	IEEE 2019-01-01
Sarja:	IEEE Access
Aiheet:	(k, n) threshold secret image sharing the Chinese remainder theorem weighted secret image sharing
Linkit:	https://ieeexplore.ieee.org/document/8704915/
Tagit:	Lisää tagi Ei tageja, Lisää ensimmäinen tagi!