A new pixel contractible visual secret sharing scheme
This paper proposes a (2n,2n) pixel contractible secret sharing scheme which encodes a secret image into 2n share images. Only when the 2n share images exist, can people get lossless secret reconstruction. Meanwhile, the size of each share image is 1/2n of secret image. Thus, it can reduce the storage capacity and network transmission bandwidth. Compared with other methods, this method can not only generate smaller share images but also restore the secret image perfectly.
secret sharing scheme pixel contraction lossless secret reconstruction
Ling Yang JianHuaWu NanRunZhou
Department of Electronic Information Engineering University of Nanchang Nanchang, China
国际会议
2011 4th International Congress on Image and Signal Processing(第四届图像与信号处理国际学术会议 CISP 2011)
上海
英文
609-612
2011-10-15（万方平台首次上网日期，不代表论文的发表时间）