Abstract
A (k, n)-threshold secret image sharing (SIS) scheme protects a secret image by dividing it into n shadow images. When any k or more shadow images are collected, the secret image is reconstructed. While any (k−1) or fewer shadows give no clue about the secret. However, all previous SIS schemes do not deal with secure secret image recovery over distributed cloud network (DCN). To achieve the goal that reconstructing secret over DCN, private communication channels among all involved participants holding shadow images are required. A naive solution for this problem is to use an extra key distribution protocol that delivers a common key to all participants. In this paper, two (k, n)-SIS schemes over DCN (SISDCN) are introduced, where threshold property (recover the secret image from any k shadow images) and secure reconstruction over DCN (noninteractively share a common key among any k participants) are provided. Further, theoretical analysis, experiments and comparisons are conducted to show the effectiveness and advantages of the proposed schemes.
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.
