A Verifiable Secret Image Sharing Scheme Based on Compressive Sensing
- 13 Downloads
This paper proposes a verifiable secret image sharing scheme based on compressive sensing, secret sharing, and image hashing. In this scheme, Toeplitz matrix generated by two chaotic maps is employed as measurement matrix. With the help of Shamir threshold scheme and image hashing, the receivers can obtain the stored values and the hash value of image. In the verifying stage and restoring stage, there must be at least t legal receivers to get the effective information. By comparing the hash value of the restored image with the hash value of original image, the scheme can effectively prevent the attacker from tampering or forging the shared images. Experimental results show that the proposed scheme has good recovery performance, can effectively reduce space, and is suitable for real-time transmission, storage, and verification.
Key wordscompressive sensing secret sharing measurement matrix image hashing
CLC numberTP 309
Unable to display preview. Download preview PDF.
- Blakley R. Safeguarding cryptographic keys [C] // AFIPS National Computer Conference. Piscataway: IEEE, 1979: 313–317.Google Scholar
- Liu L, Wang A H, Chang C C. A novel real-time and progressive secret image sharing with flexible shadows based on compressive sensing [J]. Signal Processing: Image Communication, 2014, 29(1): 128–134.Google Scholar
- Huang C P, Li C C. A secret image sharing method using integer wavelet transform [J]. EURASIP Journal on Advances in Signal Processing, 2007, 2: 263–281.Google Scholar