Abstract
Traditional Visual Cryptography method produces random shares which is susceptible to attackers. Some methods have been proposed to generate innocent-looking shares so that attacker cannot get doubtful by looking at the random pattern of the share. They look like a valid image and the adversary cannot judge whether it is a secret share or not. However many of them use additional data structure and take much time in encoding the secret. In this paper, we propose a method which produces meaningful shares for color images without the need of any additional data structure and takes less time for encoding. The share size does not vary with the number of colors present in the secret image. The method is further extended to share multiple secrets together to reduce the overhead of keeping too many shares.
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)
Hou, Y.C.: Visual cryptography for color images. Pattern Recognition 36, 1619–1629 (2003)
Chang, C.-C., Chuang, J.-C., Lin, P.-Y.: Sharing A Secret Two-Tone Image In Two Gray-Level Images. In: Proceedings of the 11th International Conference on Parallel and Distributed Systems, ICPADS 2005 (2005)
Chang, C., Tsai, C., Chen, T.: A New Scheme For Sharing Secret Color Images In Computer Network. In: Proceedings of International Conference on Parallel and Distributed Systems, pp. 21–27 (2000)
Chang, C.-C., Yu, T.-X.: Sharing A Secret Gray Image In Multiple Images. In: First International Symposium on Cyber Worlds, CW 2002 (2002)
Wu, Y.S., Thien, C.C., Lin, J.C.: Sharing and hiding secret images with size constraint. Pattern Recognition 37, 137–138 (2004)
Tsai, D.-S., Horng, G., Chen, T.-H., Huang, Y.-T.: A Novel Secret Image Sharing Scheme For True-Color Images With Size Constraint. Information Sciences 179, 324–325 (2009)
Droste, S.: New results on visual cryptography. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 401–415. Springer, Heidelberg (1996)
Wu, H.-C., Chang, C.-C.: Sharing visual multi-secrets using circle shares. Computer Standards & Interfaces 28, 123–135 (2005)
Shyu, S.J., Huang, S.-Y., Lee, Y.-K., Wang, R.-Z., Chen, K.: Sharing multiple secrets in visual cryptography. Pattern Recognition 40, 3633–3651 (2007)
Feng, J.-B., Wu, H.-C., Tsai, C.-S., Chang, Y.-F., Chu, Y.-P.: Visual secret sharing for multiple secrets. Pattern Recognition 41, 3572–3581 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jaya, Sardana, A. (2011). Multiple Secrets Sharing with Meaningful Shares. In: Abraham, A., Mauri, J.L., Buford, J.F., Suzuki, J., Thampi, S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22726-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-22726-4_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22725-7
Online ISBN: 978-3-642-22726-4
eBook Packages: Computer ScienceComputer Science (R0)