Institutional Repository
| multi-pixel encryption visual cryptography | |
| Guo Teng; Liu Feng; Wu Chuankun | |
| 2012 | |
| Conference Name | 7th China International Conference on Information Security and Cryptography, Inscrypt 2011 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 86-92 |
| Conference Date | November 30, 2011 - December 3, 2011 |
| Conference Place | Beijing, China |
| Indexed Type | EI |
| ISSN | 0302-9743 |
| ISBN | 9783642347030 |
| Department | (1) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China; (2) Graduate University of Chinese Academy of Sciences Beijing 100190 China |
| English Abstract | A visual cryptography scheme (VCS) is a secret sharing method, for which the secret can be decoded by human eyes without needing any cryptography knowledge nor any computation. In their pioneer work, Naor and Shamir mentioned that encrypting a block of pixels simultaneously may result in better result. Inspired by that idea, we first define multi-pixel encryption visual cryptography scheme (ME-VCS), which encrypts a block of t (1∈&le∈t) pixels at a time. Then we give an upper bound of the overall contrast of ME-VCS. We also give a lower bound of the pixel expansion of (n,n,t)-ME-VCS. At last, we built a contrast-optimal ME-VCS from a contrast-optimal VCS and built an optimal (n,n,t)-ME-VCS from an optimal (n,n)-VCS. © 2012 Springer-Verlag Berlin\idelberg.; A visual cryptography scheme (VCS) is a secret sharing method, for which the secret can be decoded by human eyes without needing any cryptography knowledge nor any computation. In their pioneer work, Naor and Shamir mentioned that encrypting a block of pixels simultaneously may result in better result. Inspired by that idea, we first define multi-pixel encryption visual cryptography scheme (ME-VCS), which encrypts a block of t (1∈&le∈t) pixels at a time. Then we give an upper bound of the overall contrast of ME-VCS. We also give a lower bound of the pixel expansion of (n,n,t)-ME-VCS. At last, we built a contrast-optimal ME-VCS from a contrast-optimal VCS and built an optimal (n,n,t)-ME-VCS from an optimal (n,n)-VCS. © 2012 Springer-Verlag Berlin\idelberg. |
| Keyword | Cryptography Optimization Security Of Data |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15895 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Guo Teng,Liu Feng,Wu Chuankun. multi-pixel encryption visual cryptography[C],2012:86-92. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment