New visual secret sharing schemes using probabilistic method

被引:332
作者
Yang, CN [1 ]
机构
[1] Natl Dong Hwa Univ, Dept Comp Sci & Informat Engn, Shoufeng 974, Hualien, Taiwan
关键词
secret sharing scheme; visual secret sharing scheme;
D O I
10.1016/j.patrec.2003.12.011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Visual secret sharing (VSS) scheme is a perfect secure method that protects a secret image by breaking it into shadow images (called shadows). Unlike other threshold schemes, VSS scheme can be easily decoded by the human visual system without the knowledge of cryptography and cryptographic computations. However, the size of shadow images (i.e.. the number of columns of the black and white matrices in VSS scheme [Naor, Shamir, Visual cryptography, Advances in Cryptology-EUROCRY-PT'94, Lecture Notes in Computer Science, vol. 950, Springer-Verlag, 1995, p. 1]) will be expanded. Most recent papers about VSS schemes are dedicated to get a higher contrast or a smaller shadow size. In this paper, we use the frequency of white pixels to show the contrast of the recovered image. Our scheme is nonexpansible and can be easily implemented on a basis of conventional VSS scheme. The term non-expansible means that the sizes of the original image and shadows are the same. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:481 / 494
页数:14
相关论文
共 7 条
[1]  
ATENIESE G, 1996, ECCC EL C COMP COMPL
[2]  
ATENIESE G, 1996, P 23 INT C AUT LANG
[3]  
Droste S., 1996, Advances in Cryptology - CRYPTO'96. 16th Annual International Cryptology Conference. Proceedings, P401
[4]   Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels [J].
Eisen, PA ;
Stinson, DR .
DESIGNS CODES AND CRYPTOGRAPHY, 2002, 25 (01) :15-61
[5]  
Katoh T, 1996, P INT C CRYPT INF SE, P41
[6]  
Naor M., 1995, LECT NOTES COMPUTER, P1, DOI DOI 10.1007/BFB0053419
[7]   Constructions and Properties of k out of n Visual Secret Sharing Schemes [J].
Verheul E.R. ;
Van Tilborg H.C.A. .
Designs, Codes and Cryptography, 1997, 11 (2) :179-196