Abstract
The visual secret sharing scheme (for short the VSS scheme) with access structure based on graph has been proposed as one of the (2,n)-threshold visual secret sharing schemes. Ateniese et al.1 showed a decomposition method into star graphs from a given graph which edges are specified by qualified sets, that is, two different participants (two vertices in the graph) have a common edge if and only if they can decrypt the secret image by stacking each share images. In this paper, we expand the definition of black-white visual secret sharing scheme and propose new decomposition methods by splitting complete n-partite graphs. These methods improve contrast of the decoded secret image. Moreover, we obtain several optimal examples and evaluate on graph-based VSS schemes.
Chapter PDF
References
G. Ateniese, C. Blundo, A.D. Santis, D.R. Stinson, Visual Cryptography for General Access Structures, Information and Computation 129, 86–106, 1996.
C. Blundo, A.D. Santis, D.R. Stinson, U. Vaccaro, Graph decompositions and secret sharing schemes, EUROCRYPT’92, pp.1–24, 1992.
E. Bannai and T. Ito, Algebraic Combinatorics I:Association schemes, Benjamin / Cummings, Menlo Park, California, 1984.
C. Blundo, A.D. Santis, D.R. Stinson, On the Contrast in Visual Cryptography Schemes, Journal of Cryptology 12, 261–289, 1999.
J. Clark, D.A. Holton, A First Look at Graph Theory, World Scientific Publishing, 1991.
New results on visual cryptography, CRYPTO’96, pp.401–415, 1996
M. Iwamoto, H. Ymamamoto, A visual secret sharing scheme for plural images (in Japanese), SITA2001, pp.565–568, 2001.
T. Kato, H. Imai, An extended construction method of visual secret sharing scheme (in Japanese), IEICE Trans., vol. J79-A, no.8, pp.1344–1351, 1996.
H. Koga, H. Yamamoto, Proposal of a Lattice-Based VSSS for Color and Gray-scale Images, IEICE Trans. on Fundmentals, vol. E81-A, no.6, pp.1262–1269, 1998.
H. Kuwakado, H. Tanaka, Polynomial representation of visual secret sharing scheme for black-white images, 2001 Symposium on Cryptography and Information Security, pp.417–422, 2001.
M. Naor, A. Shamir, Visual Cryptography, EUROCRYPT’94, pp.1–12, 1994.
M. Naor, A. Shamir, Visual Cryptography 2, Lecture Notes in Computer Science 1189, pp. 179–202, 1997.
A. Shamir, “How to Share a Secret”, Commun.of ACM, Vol.22, No. 11, pp.612–613, 1979.
Y. Suga, K. Iwamura, K. Sakurai, H. Imai, Extended Graph-type Visual Secret Sharing Schemes with Embedded Plural Secret Images (in Japanese), IPSJ JOURNAL Vol.42 No.08, pp.2106–2113, 2001.
E.R. Verheul, H.C.A. van Tilborg, Constructions and properties of k out of n visual secret sharing scheme, Designs, Codes, and Cryptography, vol.1, no.2, pp.179–196, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Suga, Y. (2005). New Paradigm in Graph-Based Visual Secret Sharing Scheme by Accepting Reversal in Black-White Images. In: Sasaki, R., Qing, S., Okamoto, E., Yoshiura, H. (eds) Security and Privacy in the Age of Ubiquitous Computing. SEC 2005. IFIP Advances in Information and Communication Technology, vol 181. Springer, Boston, MA. https://doi.org/10.1007/0-387-25660-1_34
Download citation
DOI: https://doi.org/10.1007/0-387-25660-1_34
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25658-0
Online ISBN: 978-0-387-25660-3
eBook Packages: Computer ScienceComputer Science (R0)