Color transfer visual cryptography with perfect security
| Autor: | Tzu-Chia Tung, Zhili Zhou, Ching-Nung Yang, Fu-Heng Wu |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
021110 strategic defence & security studies Color image business.industry Applied Mathematics Image (category theory) ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION 0211 other engineering and technologies Cryptography 02 engineering and technology Condensed Matter Physics Secret sharing Visual cryptography 0202 electrical engineering electronic engineering information engineering Key (cryptography) Embedding 020201 artificial intelligence & image processing Electrical and Electronic Engineering Arithmetic business Instrumentation Decoding methods Mathematics |
| Zdroj: | Measurement. 95:480-493 |
| ISSN: | 0263-2241 |
| DOI: | 10.1016/j.measurement.2016.10.042 |
| Popis: | 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 ) -VCS. Luo et al.’s ( k , n ) -CTVCS visually decoded the halftoned secret image by stacking any k shadow images similar to the conventional ( k , n ) -VCS and obtained a high-quality color image. However, Luo et al.’s ( 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 ) -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 ) -CTVCS. In addition, we formally defined contrast and security conditions of a ( k , n ) -CTVCS and demonstrated that our constructions satisfied the contrast and security conditions of a ( k , n ) -CTVCS. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect