Randomness in secret sharing and visual cryptography schemes

Theoretical Computer Science

Volumn 314, Issue 3, 2004, Pages 351-374

  De Bonis, Annalisa ^a   De Santis, Alfredo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

Cryptography; Randomness; Secret sharing; Visual cryptography

Indexed keywords

ALGORITHMS; IMAGE ANALYSIS; IMAGE CODING; SET THEORY; TRANSPARENCY;

RANDOMNESS; SECRET SHARING; VISUAL CRYPTOGRAPHY (VC);

CRYPTOGRAPHY;

EID: 1642601966     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.12.018     Document Type: Article

References (33)

1. Ateniese G., Blundo C., De Santis A., Stinson D.R. Visual cryptography for general access structures. Inform. and Comput. 129(2):1996;86-106.
2. G. Ateniese, C. Blundo, A. De Santis, D.R. Stinson, Constructions and bounds for visual cryptography ICALP 1996, Lecture Notes in Computer Science, Vol. 1099, 1996, pp. 416-428.
3. Atici M., Magliveras S.S., Stinson D.R., Wei W.-D. Some recursive constructions for perfect hash families. J. Combin. Design. 4:1996;352-363.
4. Beimel A., Chor B. Universally ideal secret sharing schemes. IEEE Trans. Inform. Theory. 40(3):1994;786-794.
5. J. Benaloh, J. Leichter, Generalized secret sharing and monotone functions, Proc. Crypto '88, Advances in Cryptology, Lecture Notes in Computer Science, Vol. 403, 1990, pp. 27-35.
6. G.R. Blakley, Safeguarding cryptographic keys, AFIPS Conf. Proc., vol. 48, 1979, pp. 313-317.
7. Blundo C., D'Arco P., De Santis A., Stinson D.R. Contrast optimal threshold visual cryptography schemes. SIAM J. Discrete Math. 16(2):2003;224-261.
8. C. Blundo, A. De Bonis, New constructions for visual cryptography, in: P. Degano, U. Vaccaro, G. Pirillo (Eds.), Proc. ICTCS '98, World Scientific, Singapore, 1998, pp. 290-303.
9. Blundo C., De Bonis A., De Santis A. Improved schemes for visual cryptography. Design Codes Cryptogr. 24:2001;255-278.
10. Blundo C., De Santis A. Visual cryptography schemes with perfect reconstruction of black pixels. J. Comput. Graphics (Special issue: data security in image communication and network). 22(3):1998.
11. Blundo C., De Santis A., Stinson D.R., Vaccaro U. Graph decompositions and secret sharing schemes. J. Cryptology. 8(1):1995;39-64.
12. Blundo C., De Santis A., Stinson D.R. On the contrast in visual cryptography schemes. J. Cryptology. 12:1999;261-289.
13. Blundo C., De Santis A., Vaccaro U. Randomness in distribution protocols. Inform. and Comput. 31:1996;111-139.
14. Brickell E.F. Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput. 9:1989;105-113.
15. Brickell E.F., Stinson D.R. Some improved bounds on the information rate of perfect secret sharing schemes. J. Cryptology. 5:1992;153-166.
16. A. De Bonis, A. De Santis, Randomness in visual cryptography, in: Proc. 17th Internat. Symp. on Theoretical Aspects of Computer Science, STACS 2000, Lecture Notes in Computer Science, Vol. 1770, 2000, pp. 626-638.
17. A. De Bonis, A. De Santis, Randomness optimal visual cryptography schemes for strong access structures on at most four participants, Tech. Report, Università di Salerno, June 2001.
18. A. De Bonis, A. De Santis, Secret sharing and visual cryptography schemes (a randomness preserving transformation), in: Proc. IFIP/SEC 2001, 2001, pp. 123-137.
19. A. De Bonis, A. De Santis, New results on the randomness of visual cryptography, in: Proc Workshop on Cryptography and Computational Number Theory, CCNT'99, Birkhäuser, 2001, pp. 187-201.
20. Elias P. Zero error capacity under list decoding. IEEE Trans. Inform. Theory. 34(5):1988;1070-1074.
21. Fredman M.L., Komlós J. On the size of separating system and families of perfect hash functions. SIAM J. Algebraic Discrete Math. 5(1):1984.
22. T. Hofmeister, M. Krause, H.U. Simon, Contrast-optimal k out of n secret sharing schemes in visual cryptography, COCOON '97, Lecture Notes in Computer Science, Vol. 1276, 1997, pp. 176-185.
23. R. Impagliazzo, D. Zuckerman, How to recycle random bits, Proc. 21st Ann. ACM Symp. Theory of Computing, 1989, pp. 248-255.
24. M. Ito, A. Saito, T. Nishizeki, Secret sharing scheme realizing general access structure, Proc. IEEE Global Telecommunications Conf., Globecom 87, Tokyo, Japan, 1987.
25. Martin K.M. New secret sharing schemes from Old. J. Combin. Math. Combin. Comput. 14:1993;65-77.
26. M. Naor, A. Shamir, Visual cryptography, Advances in Cryptology - EUROCRYPT '94, Lecture Notes in Computer Science, Vol. 950, 1995, pp. 1-12.
27. Shamir A. How to share a secret. Comm. ACM. 22:1979;612-613.
28. Simmons G.J., Jackson W.-A., Martin K. Decomposition constructions for secret sharing schemes. Bull. ICA. 1:1991;72-88.
29. Stinson D.R. Decomposition constructions for secret sharing schemes. IEEE Trans. Inform. Theory. 20(1):1994;110-125.
30. Stinson D.R. Cryptography, Theory and Practice. 1995;CRC Press, Boca Raton, FL.
31. D.R. Stinson, An introduction to visual cryptography, Presented at Public Key Solutions '97, Toronto, Canada, 28-30 April 1997. Available as http://bibd.unl.edu/~stinson/VKS-PKS.ps.
32. Verheul E.R., van Tilborg H.C.A. Constructions and properties of. k out of n visual secret sharing schemes Designs Codes and Cryptogr. 11(2):1997;179-196.
33. D. Zuckerman, Simulating BPP using a general weak random source, Proc. 32nd IEEE Symp. Foundations of Computer Science, 1991, pp. 79-89.