An Optimal (k,n)Visual Secret Sharing Scheme for Information Security

Abstract

Recently, based on the concept of Visual Secret Sharing (VSS) scheme proposed by Naor and Shamir in 1994, many of schemes have been proposed to protect the security of binary image. Yet, the problems of pixel expansion, extensive codebook designs, and lossy recovery are still unsolved. The current paper attempts to propose a new (k,n) scheme to refute the pixel expansion based on codebook and transpose of matrices. This scheme will offer promising solutions for the security condition, computation complexity, storage requirement, fast network transmission, and reconstructing the secret image accurately without any distortion.