Paper Info
Title
Threshold visual secret sharing based on Boolean operations
Abstract
AbstractWe design a new k,n-threshold visual secret sharing scheme on the basis of Boolean operations. We propose two different algorithms to encrypt a secret image into n meaningless shares such that no secret information can be obtained by having any k-1 or fewer shares. However, the secret image can be reconstructed easily by XOR of any kï n or more shares. Both the algorithms have used simple Boolean operations such as OR and XOR. The proposed scheme broadens the potential applicability of Boolean operation-based visual secret sharing by generating the shares of size same as that of the original secret image. Formal proofs, security analysis, and the experimental results are given to demonstrate the correctness and feasibility of the proposed scheme. Copyright © 2013 John Wiley & Sons, Ltd.
Year
DOI
Venue
2014
10.1002/sec.769
Periodicals
Keywords
Field
DocType
visual secret sharing,visual cryptography,Boolean operations,threshold access structure,image encryption
Secure multi-party computation,Secret sharing,Computer science,Computer security,Correctness,Theoretical computer science,Encryption,Verifiable secret sharing,Shamir's Secret Sharing,Homomorphic secret sharing,Visual cryptography
Journal
Volume
Issue
ISSN
7
3
1939-0114
Citations 
PageRank 
References 
8
0.59
18
Authors
2
Name
Order
Citations
PageRank
Sachin Kumar1101.30
Rajendra Kumar Sharma2359.62