L. Bai
Image processing, ramp secret sharing, matrix projection
This paper presents an image secret sharing scheme with low information overhead. The method essentially incorporates twodifferent k-out-of-n secret sharing schemes: (i) Shamir’s secret sharing scheme, and (ii) matrix projection secret sharing scheme. The technique allows a secret image to be divided into n image shares so that: (i) any k image shares (k ≤ n) can be used to reconstruct the secret image in a lossless manner, and (ii) any (k − 1) or fewer image shares cannot reveal the secret image. The size of the image shares is smaller than the size of the secret image so that there is no much overhead to store or transmit the image shares. Because image shares are computed by partitioning the secret image into smaller blocks, it can also be processed in near-realtime with resilience to the noise corruptions
Important Links:
Go Back
