A Recursive Threshold Visual Cryptography Scheme
Abhishek Parakh, Subhash Kak

TL;DR
This paper introduces a recursive threshold visual cryptography scheme that efficiently encodes multiple secrets within shares, enhancing secret sharing methods for images and text without increasing share size.
Contribution
The paper proposes a novel recursive hiding scheme for 2-out-of-3 secret sharing that improves efficiency by embedding smaller secrets within larger shares without size expansion.
Findings
Effective recursive hiding of secrets demonstrated on images and text
Increased efficiency in secret sharing schemes
Applicable to multiple data types
Abstract
This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size of the latter, thereby increasing the efficiency of secret sharing. We present applications of our proposed protocol to images as well as text.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Steganography and Watermarking Techniques · Chaos-based Image/Signal Encryption · Cryptography and Data Security
