Two secret sharing schemes based on Boolean operations

作     者：Wang, Daoshun Zhang, Lei Ma, Ning Li, Xiaobo 

作者机构：Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Univ Alberta Dept Comp Sci Edmonton AB Canada 

出 版 物：《PATTERN RECOGNITION》 (Pattern Recogn.)

年 卷 期：2007年第40卷第10期

页      面：2776-2785页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：secret sharing scheme visual secret sharing visual cryptography computation complexity pixel expansion 

摘      要：Traditional secret sharing schemes involve complex computation. A visual secret sharing (VSS) scheme decodes the secret without computation, but each shadow is m times as big as the original. Probabilistic VSS solved the computation complexity and space complexity problems at once. In this paper we propose a probabilistic (2, n) scheme for binary images and a deterministic (n, n) scheme for grayscale images. Both use simple Boolean operations and both have no pixel expansion. The (2, n) scheme provides a better contrast and significantly smaller recognized areas than other methods. The (n, n) scheme gives an exact reconstruction. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.