Abstract
We design innovative algorithms for visual multiple-secret sharing using circle or cylinder random grids in this paper. Formal validations, security analyses, and computer implementations are discussed to demonstrate the correctness and feasibility of our algorithms. As compared to the schemes developed in conventional visual cryptography, our design delivers three significant advantages: (1) it is capable of sharing multiple (instead of only one or two) secret images in two shares; (2) it does not result in any extra pixel expansion so that the sizes of the secret image and the encrypted shares are exactly the same; and (3) it is simple and easy to implement. These advantages broaden the potential applicability and flexibility of visual secret sharing schemes.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
