Color transfer visual cryptography with perfect security

详细信息    查看全文

• 作者：Ching-Nung Yang^a ; ^{cnyang@mail.ndhu.edu.tw} ; Tzu-Chia Tung^a ; Fu-Heng Wu^a ; Zhili Zhou^b
• 关键词：Visual cryptography ; Secret sharing ; Threshold scheme ; Digital halftoning ; Halftoned image ; Color transfer
• 刊名：Measurement
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：95
• 期：Complete
• 页码：480-493
• 全文大小：3814 K
• 卷排序：95

文摘

Recently, Luo et al. introduced the concept of the color transfer visual cryptographic scheme (CTVCS) by embedding the information of color channels R, G and B   into the conventional (k,n)(k,n)-VCS. Luo et al.’s (k,n)(k,n)-CTVCS visually decoded the halftoned secret image by stacking any k   shadow images similar to the conventional (k,n)(k,n)-VCS and obtained a high-quality color image. However, Luo et al.’s (k,n)(k,n)-CTVCS requires a key in the encoding and decoding phases and therefore it is, strictly speaking, not a threshold scheme with perfect security. In this study, we solved this security problem and proposed a (k,n)(k,n)-CTVCS that does not require a key. This experiment indicated that the proposed solution achieves the same feature (obtaining the original color image) as Luo et al.’s (k,n)(k,n)-CTVCS. In addition, we formally defined contrast and security conditions of a (k,n)(k,n)-CTVCS and demonstrated that our constructions satisfied the contrast and security conditions of a (k,n)(k,n)-CTVCS.