Abstract
A secret sharing scheme is a method for sharing a secret among a set P of n participants. The secret is encoded into n pieces called shares each of which is given to a distinct participant. Certain qualified subsets of participants can recover the secret by pooling together their information, whereas forbidden subsets of participants have no information on the secret. The specification of the qualified sets and the forbidden sets is called access structure.
A special kind of secret sharing schemes are visual cryptography schemes (VCSs), that is, schemes where the secret to share is an image and the shares consist of xeroxed transparencies which are stacked to recover the shared image.
In this paper we analyze the relationship between secret sharing schemes and VCSs, focusing our attention on the amount of randomness required to generate the shares. We show how to transform a secret sharing scheme for a given access structure into a VCS for the same access structure while preserving the randomness of the original scheme. An important consequence of this transformation is that lower bounds on the randomness of visual cryptography schemes apply to general secret sharing schemes. Our randomness preserving transformation has also been applied to derive a new upper bound on the randomness of (k, n)-threshold VCSs which dramatically improves on the previously known bounds. All VCSs obtained by applying our randomness preserving transformation allow a perfect reconstruction of black pixels.
Chapter PDF
Similar content being viewed by others
References
G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, Visual Cryptography for General Access Structures. Information and Computation, 129–2, 86–106 (1996).
G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, Constructions and Bounds for Visual Cryptography. Proc. 23rd International Colloquium on Automata, Languages and Programming, LNCS 1099, 416–428 (1996).
A. Beimel and B. Chor, Universally Ideal Secret Sharing Schemes. IEEE Trans. on Info. Theory. 40(3), 786–794 (1994) (Extended abstract in CRYPTO’ 92).
J. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions. Lecture Notes in Computer Science, 403, 27–35 (1990).
G. R. Blakley, Safeguarding Cryptographic Keys. AFIPS Conference Proceedings, 48, 313–317 (1979).
C. Blundo and A. De Santis, Visual Cryptography Schemes with Perfect Reconstruction of Black Pixels. Journal for Computers & Graphics, Special Issue: “Data Security in Image Communication and Network”, 22–4, 449–455 (1998).
C. Blundo, A. De Santis, and U. Vaccaro, Randomness in Distribution Protocols. Information and Computation, 131, 111–139 (1996).
A. De Bonis and A. De Santis, New Results on the Randomness of Visual Cryptography, Proc. of Workshop on Cryptography and Computational Number Theory, CCNT’99, Birkhauser, 187–201.
A. De Bonis and A. De Santis, Randomness in Visual Cryptography. Proc. 17th International Symposium on Theoretical Aspects of Computer Science, STACS 2000, LNCS 1770, 626–638 (2000).
R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits. Proc. 21st Annual ACM Symp. on Theory of Computing, 248–255 (1989).
M. Ito, A. Saito, and T. Nishizeki, Secret Sharing Scheme Realizing General Access Structure. Proc. IEEE Global Telecommunications Conf., Globecom 87, 99–102 (1987).
K. M. Martin, New Secret Sharing Schemes from Old. J. of Combin. Math. and Combin. Comput., 14, 65–77 (1993).
M. Naor and A. Shamir, Visual Cryptography. Advances in Cryptology-EUROCRYPT’ 94, LNCS 950, 1–12 (1995).
A. Shamir, How to Share a Secret. Commun. of the ACM, 22, 612–613 (1979).
D. R. Stinson, An Introduction to Visual Cryptography. Presented at Public Key Solutions’ 97, Toronto, Canada, April 28–30 (1997). Available as http://bibd.unl.edu/stinson/VKS-PKS.ps.
D. R. Stinson, Cryptography, Theory and Practice, 1995, CRC Press, Inc., Boca Raton, Florida.
G. J. Simmons, W. Jackson, and K. Martin, The Geometry of Shared Secret Schemes. Bulletin of the ICA, 1, 71–88 (1991).
E. R. Verheul and H. C. A. van Tilborg, Constructions and Properties of k out of n Visual Secret Sharing Schemes. Designs, Codes, and Cryptography 11–2, 179–196 (1997).
D. Zuckerman, Simulating BPP Using a General Weak Random Source. Proc. 32nd IEEE Symp. on Foundations of Comp. Science, 79–89 (1991).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 IFIP International Federation for Information Processing
About this paper
Cite this paper
De Bonis, A., De Santis, A. (2001). Secret Sharing and Visual Cryptography Schemes. In: Dupuy, M., Paradinas, P. (eds) Trusted Information. SEC 2001. IFIP International Federation for Information Processing, vol 65. Springer, Boston, MA. https://doi.org/10.1007/0-306-46998-7_9
Download citation
DOI: https://doi.org/10.1007/0-306-46998-7_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7389-6
Online ISBN: 978-0-306-46998-5
eBook Packages: Springer Book Archive