Lossless Secret Image Sharing Schemes
V.P. Binu, A. Sreekumar

TL;DR
This paper introduces lossless secret image sharing schemes that split images into shares with the same size, ensuring confidentiality and efficiency using simple modular arithmetic, suitable for sensitive data transmission.
Contribution
The paper proposes novel lossless (2, 2) and (2, 3) secret image sharing schemes that are simple, secure, and maintain the original image size.
Findings
Share size equals secret size
Schemes are secure and efficient
Applicable to binary and grayscale images
Abstract
Secret image sharing deals with splitting confidential images into several shares and the original image can be reconstructed from the qualified subset of the shares. Secret sharing schemes are used in transmission and storage of private medical images and military secrets. Increased confidentiality and availability are the major achievements. We propose an efficient (2, 2) scheme and (2, 3) scheme for secret image sharing. The scheme is lossless and also the share size is same as the secret size. The sharing and revealing phase uses simple modular arithmetic which can be very easily implemented. Experimental results on Binary and Gray scale images show that the proposed scheme is secure and efficient.
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 · Cryptography and Data Security · Chaos-based Image/Signal Encryption
