(2,n)secret sharing scheme for gray and color images based on Boolean operation  

作　　者：DONG Lin WANG DaoShun LI ShunDong DAI YiQi 

机构地区：[1]Department of Computer Science and Technology,Tsinghua University,Beijing 100084,China [2]School of Computer Science,Shaanxi Normal University,Xi'an 710062,China

出　　处：《Science China(Information Sciences)》2012年第5期1151-1161,共11页中国科学（信息科学）（英文版）

基　　金：supported by National High-Tech Research & Development Program of China (Grant No. 2008AA-10Z419);National Natural Science Foundation of China (Grant Nos. 60873249,60673065,60902102,60971006);Post-Doctor Foundation of China (Grant No. 20090460316)

摘　　要：Traditional secret sharing （SS） schemes can reconstruct the secret precisely,but have high com-putation complexity.Visual secret sharing （VSS） schemes use human visual system to reconstruct the secret without cryptographic computation,but have pixel expansion and loss of contrast.Wang et al.proposed a （2,n）-SS scheme for binary images based on Boolean operation,which has low computation complexity,no pixel expansion and the contrast is 1/2.In this paper,we first construct an r runs （2,n）-SS scheme to improve the contrast of Wang et al.＇s binary （2,n）-SS scheme.Then we present two approaches to construct r runs （2,n）-SS schemes for grayscale image and color image.The two approaches are both based on Boolean operation,while one approach uses halftone technology and the other uses bit level processing.These proposed schemes have low computation complexity and almost ideal contrast.Traditional secret sharing （SS） schemes can reconstruct the secret precisely,but have high com-putation complexity.Visual secret sharing （VSS） schemes use human visual system to reconstruct the secret without cryptographic computation,but have pixel expansion and loss of contrast.Wang et al.proposed a （2,n）-SS scheme for binary images based on Boolean operation,which has low computation complexity,no pixel expansion and the contrast is 1/2.In this paper,we first construct an r runs （2,n）-SS scheme to improve the contrast of Wang et al.＇s binary （2,n）-SS scheme.Then we present two approaches to construct r runs （2,n）-SS schemes for grayscale image and color image.The two approaches are both based on Boolean operation,while one approach uses halftone technology and the other uses bit level processing.These proposed schemes have low computation complexity and almost ideal contrast.

关 键 词：secret sharing scheme Boolean operation HALFTONE CONTRAST 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术] TN918.1[自动化与计算机技术—计算机科学与技术]