Scalable secret image sharing scheme with essential shadows

作者：

Highlights：

•

• Any set of less than k shadows or includes less than t essential shadows get noting on the secret image.

• Any set of k or more shadows which includes at least t essential shadows can partially reconstruct the secret image.

• The entire image can be reconstructed when Q includes all s essential shadows.

摘要

•Any set of less than k shadows or includes less than t essential shadows get noting on the secret image.•Any set of k or more shadows which includes at least t essential shadows can partially reconstruct the secret image.•The entire image can be reconstructed when Q includes all s essential shadows.

论文关键词：Secret image sharing,Essential shadow,Scalable,Shadow size

论文评审过程：Received 19 February 2017, Revised 9 April 2017, Accepted 25 June 2017, Available online 1 July 2017, Version of Record 18 July 2017.

论文官网地址：https://doi.org/10.1016/j.image.2017.06.011