Multi-secret Sharing Threshold Visual Cryptography Scheme

Author(s):  
Bin Yu ◽  
Xiaohui Xu ◽  
Liguo Fang
2014 ◽  
Vol 644-650 ◽  
pp. 2108-2111 ◽  
Author(s):  
Yan Yan Ha ◽  
Shuai Ji ◽  
Wen Cai He ◽  
Yao Zhang

XOR algorithm can be used to improve the recovery effects of visual cryptography scheme. In this paper, we present a multi-secret visual cryptography scheme by using the matrices of the (k, k)-VCS. We can reveal multiple secret images perfectly by the XOR algorithm and shifting operation on the shares. The visual qualities of recovered images are ideal without any pixel expansion.


Author(s):  
ASHWATHIMESANGLA AO

Visual cryptography is a secret sharing scheme for encrypting a secret image, it is a perfectly secure way that allows secret sharing without any cryptographic computation, which is termed as Visual Cryptography Scheme (VCS). In this paper secret image is divided into shares (printed on transparencies), and each share holds some information. At the receiver this shares are merged to obtain the secret information which is revealed without any complex computation. The proposed algorithm is for color host image, divided into three color planes Red, Green, Blue and merged with secret image which is binarized and divided into shares. The decoding requires aligning the result obtained by merging color host image and shares, so as to obtain the secret image.


Today organizations face a challenge while recruiting candidates, who provide forged mark sheets in order to get a job. To prevent wrong hiring a detailed and thorough approach is needed to verify the authentication of both the candidate and the marks obtained by him/her. There are so many modern cryptographic protocols available which can be used for authenticating individual’s academic achievement certificates. Visual Cryptography is a simple and secure way to allow the secret sharing of images without any cryptographic computations or the use of encryption or decryption keys. The novelty of the visual secret sharing scheme is in its decryption process where human visual system (HVS) is employed for decryption of secret shares. In this paper we have discussed (3, 3) visual cryptography scheme which can be used to generate shares and distributes them among three parties, i.e. the Job Seeker, Certificate Issuance Authority and the Organization conducting Job interview. Secret message can be decrypted only if all the three shares are available. Every certificate carries a unique number which is encrypted using visual cryptography and without handshaking of all the parties it is impossible to decrypt, thus ensuring full proof authentication.


2021 ◽  
Vol 15 (2) ◽  
pp. 196-216
Author(s):  
Suhas Bhagate ◽  
Prakash J. Kulkarni

Security of information is of much concern in the modern internet era. Secret sharing schemes provide mechanism of encrypting secret information to prevent illicit usage. Visual cryptography is a secret sharing technique that facilitates encryption of a secret image. Visual cryptography allows us to effectively and efficiently share secrets among a number of trusted parties by hiding secrets within images. These images are encoded into multiple shares as per the rules indicated in basis matrices and later decoded by stacking required number of shares. Progressive visual cryptography has a specialty of recovering secret image as soon as more than one shares received gradually. Existing progressive visual cryptography schemes have severe limitations like data disclose on shares and higher pixel expansion. Improved progressive visual cryptography scheme deals with these limitations. Improved extended progressive visual cryptography scheme solves the issue of management of noise like meaningless shares by creating meaningful shares without any pixel expansion efficiently.


Sign in / Sign up

Export Citation Format

Share Document