SHARE A SECRET IMAGE WITH INVERTIBLE AND LOSSY CHARACTERISTICS

Chien-Chang Chen ； Chong-An Liu ； Yu-Jing Lin

《International Journal of Electronic Commerce Studies》 7卷2期 (2016/12) Pp. 135-154

https://doi.org/10.7903/ijecs.1467

摘要

Conventional (t, n) secret image sharing schemes share a secret image to n shared images, where any t shared images recovers the secret image. Among these shared images, noise-like properties easily draw attacker attention. Embedding shared images in meaningful cover images thus efficiently reduces attacker attention. This paper presents a different-expansion technique based invertible secret image sharing scheme that allows participants to perfectly restore the secret image and cover images. The proposed scheme also contains a lossy property which means that cover images do not have to be perfectly recovered to share larger secret images. The proposed scheme performs well with M-ary number systems, allowing users to determine the trade-off between covered image quality and secret image size. Experimental results show that the proposed scheme shares a large secret image and has good covered image quality.

關鍵字

Secret Image Sharing ； Different Expansion ； Lossy Recovery

參考文獻

Thien, C.C.,Lin, J.C.(2002).Secret image sharing.Computers and Graphics.26(5),765-770.

Chang, C.C.,Hsieh, Y.P.,Lin, C.H.(2008).Sharing secrets in stego images with authentication.Pattern Recognition.41(10),3130-3137.

Chen, C.C.,Liu, C.A.(2013).Tamper-proof secret image sharing scheme for identifying cheated secret keys and shared images.Journal of Electronic Imaging.22(1),013008.

Fang, W.P.(2008).Friendly progressive visual secret sharing.Pattern Recognition.41(4),1410-1414.

Huang, C.P.,Hsieh, C.H.,Huang, P.S.(2010).Progressive sharing for a secret image.Journal of Systems and Software.83(3),517-527.