On the Semantic Security of Secret Image Sharing Methods

Abstract

In this work, we analyze some of the existing secret image sharing methods and show that they do not possess indistinguishability, a property of many secure systems. We propose a new method based on the $(k, n)$ threshold secret sharing scheme for images in the compressed and uncompressed domains. Our method generates minimal share sizes with similar computational cost to previous methods, yet it is computationally secure and satisfies the indistinguishability property.