Abstract
Secret image sharing will inevitably be threatened by various types of attacks in practical applications, of which cheating behavior is the most prone. In this paper, in order to prevent deceivers from threatening the security of secret image transmission process, a polynomial based cheating detection scheme is proposed. The (k, n) secret image sharing scheme must ensure that any k or more participants can restore the secret image, and less than k participants cannot get any information of the secret image. In our scheme, only one honest shareholder can detect the collusion from other k − 1 deceivers. Furthermore, our scheme reduces the size of shadow images thus saving storage space and transmission time. Theory and experiments show that our scheme is effective and feasible in cheating detection.
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.
