A new approach for visual cryptography
| dc.citation.epage | 227 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 207 | en_US |
| dc.citation.volume | 27 | en_US |
| dc.citation.woscount | 19 | |
| dc.contributor.author | Tzeng, WG | en_US |
| dc.contributor.author | Hu, CM | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:41:40Z | |
| dc.date.available | 2014-12-08T15:41:40Z | |
| dc.date.issued | 2002-12-01 | en_US |
| dc.description.abstract | Visual cryptography is to encrypt a secret image into some shares (transparencies) such that any qualified subset of the shares can recover the secret "visually." The conventional definition requires that the revealed secret images are always darker than the backgrounds. We observed that this is not necessary, in particular, for the textual images. In this paper, we proposed an improved definition for visual cryptography based on our observation, in which the revealed images may be darker or lighter than the backgrounds. We studied properties and obtained bounds for visual cryptography schemes based on the new definition. We proposed methods to construct visual cryptography schemes based on the new definition. The experiments showed that visual cryptography schemes based on our definition indeed have better pixel expansion in average. | en_US |
| dc.identifier.doi | 10.1023/A:1019939020426 | en_US |
| dc.identifier.issn | 0925-1022 | en_US |
| dc.identifier.journal | DESIGNS CODES AND CRYPTOGRAPHY | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1023/A:1019939020426 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/28344 | |
| dc.identifier.wosnumber | WOS:000177628500003 | |
| dc.language.iso | en_US | en_US |
| dc.subject | visual cryptography | en_US |
| dc.subject | secret sharing | en_US |
| dc.subject | access structure | en_US |
| dc.title | A new approach for visual cryptography | en_US |
| dc.type | Article | en_US |