Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
461265 | Journal of Systems and Software | 2011 | 8 Pages |
A novel (k, n) scalable secret image sharing (SSIS) scheme was proposed to encrypt a secret image into n shadow images. One can gradually reconstruct a secret image by stacking k or more shadows, but he/she cannot conjecture any information from fewer than k shadows. The advantage of a (k, n)-SSIS scheme is that it provides the threshold property (i.e., k is a threshold value necessary to start in to reveal the secret) as well as the scalability (i.e., the information amount of a reconstructed secret is proportional to the number of shadows used in decryption). All previous (k, n)-SSIS schemes did not have the smooth scalability so that the information amount can be “smoothly” proportional to the number of shadows. In this paper, we consider the smooth scalability in (k, n)-SSIS scheme.
► We propose a (k, n)-SSIS scheme based on (t, n)-SIS schemes, where k ≤ t ≤ n, to achieve the smooth scalability. ► We define a smooth scalability condition. ► We theoretically prove that our (k, n)-SSIS scheme is a smooth (k, n)-SSIS scheme.