Visual cryptography for gray-level images by dithering techniques
暂无分享,去创建一个
[1] Moni Naor,et al. Visual Authentication and Identification , 1997, CRYPTO.
[2] Hans Ulrich Simon,et al. Contrast-optimal k out of n secret sharing schemes in visual cryptography , 1997, Theor. Comput. Sci..
[3] Hans Ulrich Simon,et al. Contrast-optimal k out of n secret sharing schemes in visual cryptography , 2000, Theor. Comput. Sci..
[4] Stefan Droste,et al. New Results on Visual Cryptography , 1996, CRYPTO.
[5] Yuefeng Zhang,et al. Space-filling curve ordered dither , 1998, Comput. Graph..
[6] Alfredo De Santis,et al. Constructions and Bounds for Visual Cryptography , 1996, ICALP.
[7] Sushil Jajodia,et al. Information Hiding: Steganography and Watermarking-Attacks and Countermeasures , 2000, Advances in Information Security.
[8] Annalisa De Bonis,et al. Randomness in Visual Cryptography , 2000, STACS.
[9] O. Roeva,et al. Information Hiding: Techniques for Steganography and Digital Watermarking , 2000 .
[10] Alfredo De Santis,et al. Visual Cryptography for General Access Structures , 1996, Inf. Comput..
[11] Moni Naor,et al. Visual Cryptography , 1994, Encyclopedia of Multimedia.
[12] Adi Shamir,et al. How to share a secret , 1979, CACM.
[13] Eric R. Verheul,et al. Constructions and Properties of k out of n Visual Secret Sharing Schemes , 1997, Des. Codes Cryptogr..
[14] Martin F. H. Schuurmans,et al. Digital watermarking , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.