Randomness in Visual Cryptography
暂无分享,去创建一个
[1] Douglas R. Stinson,et al. Decomposition constructions for secret-sharing schemes , 1994, IEEE Trans. Inf. Theory.
[2] Kurt Mehlhorn,et al. On the program size of perfect and universal hash functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[3] Amos Beimel,et al. Universally ideal secret-sharing schemes , 1994, IEEE Trans. Inf. Theory.
[4] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[5] Alfredo De Santis,et al. Constructions and Bounds for Visual Cryptography , 1996, ICALP.
[6] J. Komlos,et al. On the Size of Separating Systems and Families of Perfect Hash Functions , 1984 .
[7] Douglas R Stinson,et al. Some recursive constructions for perfect hash families , 1996 .
[8] Moni Naor,et al. Visual Cryptography , 1994, Encyclopedia of Multimedia.
[9] Alfredo De Santis,et al. Randomness in Distribution Protocols , 1996, Inf. Comput..
[10] Alfredo De Santis,et al. Visual Cryptography for General Access Structures , 1996, Inf. Comput..
[11] Hans Ulrich Simon,et al. Contrast-optimal k out of n secret sharing schemes in visual cryptography , 1997, Theor. Comput. Sci..
[12] Douglas R Stinson,et al. New constructions for perfect hash families and related structures using combinatorial designs and codes , 2000 .
[13] Alfredo De Santis,et al. On the Contrast in Visual Cryptography Schemes , 1999, Journal of Cryptology.