Abstract
Pixel expansion has been a major issue of visual secret sharing (VSS) schemes. A number of probabilistic VSS schemes with minimum pixel expansion have been proposed for black-and-white (binary) secret images. This paper presents a probabilistic (n, n)-VSS scheme for grayscale images. Its pixel expansion is significantly smaller than that of previous methods. The construction of the shadow images (shares) is based on the Boolean XOR operation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Naor, M., Shamir, A.: Visual Cryptography. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 1–12. Springer, Heidelberg (1995)
Rijmen, V., Preneel, B.: Efficient Colour Visual Encryption or ‘Shared Colors of Benetton’. In: Rump Session of EUROCRYPTO 1996 (1996), http://www.iacr.org/conferences/ec96/rump/preneel.ps
Yang, C.N.: A Note on Efficient Color Visual Encryption. Journal of Information Science and Engineering 18(3), 367–372 (2002)
Hou, Y.C.: Visual Cryptography for Color Images. Pattern Recognition 36(7), 1619–1629 (2003)
Verheul, E.R., Van Tilborg, H.C.A.: Constructions and Properties of k out of n Visual Secret Sharing Schemes. Designs, Codes, and Cryptography 11, 179–196 (1997)
Blundo, C., De Bonis, A., De Santis, A.: Improved Schemes for Visual Cryptography. Designs, Codes, and Cryptography 24, 255–278 (2001)
Yang, C.N., Laih, C.S.: New Colored Visual Secret Sharing Schemes. Designs, Codes, and Cryptography 20, 325–335 (2000)
Cimato, S., De Prisco, R., De Santis, A.: Contrast Optimal Colored Visual Cryptography Schemes. In: IEEE Information Theory Workshop, pp. 139–142. IEEE Press, New York (2003)
Blundo, C., De Santis, A., Naor, M.: Visual Cryptography for Grey Level images. Information Processing Letters 75, 255–259 (2000)
Iwamoto, M., Yamamoto, H.: The Optimal n -out of- n Visual Secret Sharing Scheme for Gray-scale Images. IEICE Transactions on Fundamentals of Electronics E85-A (10), 2238–2247 (2002)
Ito, R., Kuwakado, H., Tanaka, H.: Image Size Invariant Visual Cryptography. IEICE Transactions on Fundamentals of Electronics E82-A (10), 2172–2177 (1999)
Yang, C.N.: New Visual Secret Sharing Schemes Using Probabilistic Method. Pattern Recognition Letters 25, 481–494 (2004)
Cimato, S., De Prisco, R., De Santis, A.: Probabilistic Visual Cryptography Schemes. Computer Journal 49(1), 97–107 (2006)
Hsu, C.S., Tu, S.F., Hou, Y.C.: An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds.) ISMIS 2006. LNCS (LNAI), vol. 4203, pp. 58–67. Springer, Heidelberg (2006)
Wang, D.S., Zhang, L., Ma, N., Li, X.: Two Secret Sharing Schemes Based on Boolean Operations. Pattern Recognition 40, 2776–2785 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, D., Li, X., Yi, F. (2008). Probabilistic (n, n) Visual Secret Sharing Scheme for Grayscale Images. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds) Information Security and Cryptology. Inscrypt 2007. Lecture Notes in Computer Science, vol 4990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79499-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-79499-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79498-1
Online ISBN: 978-3-540-79499-8
eBook Packages: Computer ScienceComputer Science (R0)