中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
multi-pixel encryption visual cryptography
Author: Guo Teng ; Liu Feng ; Wu Chuankun
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Conference Name: 7th China International Conference on Information Security and Cryptography, Inscrypt 2011
Conference Date: November 30, 2011 - December 3, 2011
Issued Date: 2012
Conference Place: Beijing, China
Keyword: Cryptography ; Optimization ; Security of data
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
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.
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.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/15895
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Guo Teng,Liu Feng,Wu Chuankun. multi-pixel encryption visual cryptography[C]. 见:7th China International Conference on Information Security and Cryptography, Inscrypt 2011. Beijing, China. November 30, 2011 - December 3, 2011.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Guo Teng]'s Articles
[Liu Feng]'s Articles
[Wu Chuankun]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Guo Teng]‘s Articles
[Liu Feng]‘s Articles
[Wu Chuankun]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace