Abstract
Most of today’s secret image sharing technologies are based on the polynomial-based secret sharing scheme proposed by shamir. At present, researchers mostly focus on the development of properties such as small shadow size and lossless recovery, instead of the principle of Shamir’s polynomial-based SS scheme. In this paper, matrix theory is used to analyze Shamir’s polynomial-based scheme, and a general (k, n) threshold secret image sharing scheme based on matrix theory is proposed. The effectiveness of the proposed scheme is proved by theoretical and experimental results. Moreover, it has been proved that the Shamir’s polynomial-based SS scheme is a special case of our proposed scheme.
Highlights
Since more and more data are being transmitted via the Internet, how to protect the privacy and security of the data such as military images becomes a focus
Compared with other cryptographic techniques, the secret image sharing (SIS) scheme has the characteristic of loss tolerance
Based on matrix theory, we propose a general (k, n) threshold SIS construction method [19]
Summary
Since more and more data are being transmitted via the Internet, how to protect the privacy and security of the data such as military images becomes a focus. Secret data can be protected by traditional encryption, it cannot be revealed exactly if the stego-media is lossy. With a property of loss-tolerance, secret sharing(SS) techniques have been proposed. A (k, n) threshold SS scheme is a method of encrypting a secret into n shares such that any subset consisting of k shares can reveal the secret, while less than k shares cannot reconstruct the secret. Based on the SS scheme, a secret image sharing (SIS) scheme was proposed. Several shadow images (or shares) are generated by the secret image, and there will be no secret information leakage. Compared with other cryptographic techniques, the SIS scheme has the characteristic of loss tolerance
Sign-in/Register to view highlights & summary 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.
