Essential secret image sharing scheme with small and equal sized shadows
作者:
Highlights:
• Our proposed (t,k,n)-ESIS scheme for grayscale images over the finite field GF(pm) does not require any preprocessing step to secure the scheme.
• The proposed scheme over GF(pm) with pm>28 is little lossy, it has the advantage over most of the ESIS schemes in the sense that the proposed scheme works fine, even if the number of participants is 256 or more.
• Most importantly, our proposed scheme over GF(28) is completely lossless.
• Moreover, our proposed scheme, does not have the limitations such as different size of shadows, concatenation of sub-shadows, use of derivative polynomials etc.
• Our scheme has reduced share size and works fine without any preprocessing steps on secret image, making our scheme efficient.
摘要
•Our proposed (t,k,n)-ESIS scheme for grayscale images over the finite field GF(pm) does not require any preprocessing step to secure the scheme.•The proposed scheme over GF(pm) with pm>28 is little lossy, it has the advantage over most of the ESIS schemes in the sense that the proposed scheme works fine, even if the number of participants is 256 or more.•Most importantly, our proposed scheme over GF(28) is completely lossless.•Moreover, our proposed scheme, does not have the limitations such as different size of shadows, concatenation of sub-shadows, use of derivative polynomials etc.•Our scheme has reduced share size and works fine without any preprocessing steps on secret image, making our scheme efficient.
论文关键词:Grayscale image,Finite field,(t,k,n)-threshold secret sharing scheme
论文评审过程:Received 15 October 2019, Revised 15 June 2020, Accepted 16 June 2020, Available online 22 June 2020, Version of Record 24 June 2020.
论文官网地址:https://doi.org/10.1016/j.image.2020.115923