Visual secret sharing using Newton interpolation polynomial and mod operator with PNG images

Abstract

Nowadays digitized personal data is common, since technology progresses day by day. Even more of emphasis is on data security today than there has ever been. So protecting these types of data in a secure way which does not obstruct the access of an authorized authority and which does not reveal any information related to the original personal data if any unauthorized person gets the access of it. Visual cryptography is very special data security method which provides a very powerful technique by which one visual secret can be distributed into two or more shares. When shares on transparencies are super imposes exactly together, the original secret can be discovered without any complicated algorithm or computer participation. In this paper we are trying to give a foundation to visual cryptography by giving all the related and important back ground details. We start by focusing on the first traditional visual cryptography and then continue by listing major or striking modifications over that in the area visual cryptography. We have also proposed a method of sharing visual information, in PNG image format, with honest participants using Newton Interpolation Polynomial equations and Mod operator. The main features in the proposed scheme is, the involvement of a key both in sharing phase of the secret as well as the reconstruction phase and that can be used to verify the honesty of the participants.