Abstract
Compared to conventional visual secret sharing (VSS), Boolean operations-based VSS solves the problems of the large pixel expansion (pe) and the complex computation involved in the decryption process. However, the existing VSS schemes based on Boolean operations are limited only to (2, n), (n, n) and (k, n). In this paper, we propose a Boolean operations-based VSS scheme for general access structures. The proposed scheme encodes the secret image into several shares such that the secret image can be reconstructed only by any qualified subset of the shares. The proposed scheme has lossless secret reconstruction with an acceptable pixel expansion (0 < pe < 1.5) and fast decoding process. The correctness of the proposed scheme is validated by formal security analysis and the experimental results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
