The Research On Study Of Image Secret Sharing Scheme Based On Boolean Operation

Data security is very important in taday's information age.In order to prevent the rights of the key custodians in encryption techonology excessive,secret sharing technology arises at the historic moment.Secret sharing plays an important in security of electronic data,information sending,receiving and so on.Visual secret sharing is an important branch in the field of secret sharing,it solves some problems existing in the traditional encryption technology,such as encryption algorithm complexity,weak anti-jamming,excessive concentration of participant rights,etc.Therefore,visual cryptography technology has been widely used in project management of bank system,identity authentication,military secrets and many other fields.Although,it can solve the common problems of traditional encryption,it has its disadvantages.These disadvantages such as single encrypted image type,pixel expansion of the secret sharing,low contrast of the reconstructed image,are still the focus of scholars.In this dissertation,we propose a(kn,kn)multi-secret sharing visual cryptography scheme.In this scheme,n(n≥2)secret images are encoded into kn(k?N~*)secret images whose size is 1/k of the original image according to the actual demand.It can decrease the system's storage and transmission bandwidth requirements and reduce the storage burden on participants.Besides,the method is suitable for binary images,grayscale images and color images.When decoding,only by all the available share images can we get secret reconstruction which has ideal contrast.Any less than kn share images can not reveal any information about the secret image.By comparison with other schemes,we further explain the performance characteristics of this method in different aspects,such as algorithm's security,image format,pixel expansion,secret image reconstructed quality,etc.The simulation results show that the proposed scheme is reliable and effective.