کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1539371 | 996635 | 2010 | 13 صفحه PDF | دانلود رایگان |
Recently, Wang et al. introduced a novel (2, n) scalable secret image sharing (SSIS) scheme, which can gradually reconstruct a secret image in a scalable manner in which the amount of secret information is proportional to the number of participants. However, Wang et al.’s scheme is only a simple 2-out-of-n case. In this paper, we consider (k, n)-SSIS schemes where a qualified set of participants consists of any k participants. We provide two approaches for a general construction for any k, 2 ⩽ k ⩽ n. For the special case k = 2, Approach 1 has the lesser shadow size than Wang et al.’s (2, n)-SSIS scheme, and Approach 2 is reduced to Wang et al.’s (2, n)-SSIS scheme. Although the authors claim that Wang et al.’s (2, n)-SSIS scheme can be easily extended to a general (k, n)-SISS scheme, actually the extension is not that easy as they claimed. For the completeness of describing the constructions and properties of a general (k, n)-SSIS scheme, both approaches are introduced in this paper.
Journal: Optics Communications - Volume 283, Issue 9, 1 May 2010, Pages 1750–1762