Abstract
We put forward a construction of visual cryptographic scheme (VCS) to address the scenario, where there are several levels of importance of shadows. Traditional (k, n)-threshold VCS does not distinguish among the shadows—all shadows are of equal importance. Any k of them can recover the secret image whereas less than or equal to \(k-1\) shadows do not reveal any information about the secret image. We consider the scenario where there are several levels of essential participants (labeled according to their importance) and there must be an agreement across the levels to recover the secret image. This captures the distribution of importance of parties across several levels or compartments. We give a novel construction of visual cryptographic scheme realizing such access structures, where the parties are compartmented into different levels according to their importance. We come up with closed mathematical formulae of pixel expansion and relative contrast. We also consider more efficient probabilistic construction and compare contrasts with several other probabilistic, non-expansible constructions. Numerical evidence shows that our scheme performs better than the available generic constructions.
S. Dutta is grateful to the NICT, Japan for the financial support under the NICT International Exchange Program.
K. Sardar is financially supported by a Ph.D. fellowship (award no. 09/028(0975)/2016) CSIR, India.
A. Adhikari is thankful to Presidency University for providing FRPDF grant.
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
References
Adhikari, A.: Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images. Des. Codes Cryptogr. 73(3), 865–895 (2014)
Adhikari, A., Dutta, T.K., Roy, B.: A new black and white visual cryptographic scheme for general access structures, In: INDOCRYPT 2004. LNCS, vol. 3348, pp. 399–413. Springer, Berlin (2004)
Arumugam, S., Lakshmanan, R., Nagar, A.K.: On \((k, n)^*\)-visual cryptography scheme. Des. Codes Cryptogr. 71(1), 153–162 (2014)
Ateniese, G., Blundo, C., De Santis, A., Stinson, D.R.: Visual cryptography for general access structures. Inf. Comput. 129, 86–106 (1996)
Cimato, S., De Prisco, R., De Santis, A.: Probabilistic visual cryptography schemes. Comput. J. 49(1), 97–107 (2006)
D’Arco, P., De Prisco, R., De Santis, A.: Measure-independent characterization of contrast optimal visual cryptography schemes. J. Syst. Softw. 95, 89–99 (2014)
Dutta, S., Adhikari, A.: XOR based non-monotone \(t\)-\((k, n)^*\)-visual cryptographic schemes using linear algebra. In: ICICS 2014. LNCS, vol. 8958, pp. 230–242. Springer, Berlin (2014)
Dutta, S., Singh, R.R., Adhikari, A.: Constructions and Analysis of Some Efficient \(t\)-\((k, n)^*\)-Visual Cryptographic Schemes Using Linear Algebraic Techniques. Des. Codes Cryptogr. 80(1), 165–196 (2016)
Guo, T., Liu, F., Wu, C.K., Ren, Y.W., Wang, W.: On \((k, n)\) visual cryptography scheme with \(t\) essential parties, ICITS 2013. LNCS, vol. 8371, pp. 56–68. Springer, Berlin (2014)
Ito, R., Kuwakado, H., Tanaka, H.: Image size invariant visual cryptography. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E82A(10), 2172–2177 (1999)
Kafri, O., Keren, E.: Encryption of pictures and shapes by random grids. Opt. Lett. 12(6), 377–379 (1987)
Naor, M., Shamir, A.: Visual Cryptography, EUROCRYPT 1994. LNCS, vol. 950, pp. 1–12. Springer, Berlin (1994)
Praveen, K., Rajeev, K., Sethumadhavan, M.: On the Extensions of \((k, n)^*\)-Visual Cryptographic Schemes, SNDS 2014. CCIS 420, 231–238 (2014)
Shyu, S.J.: Image encryption by random grids. Patt. Recogn. 40(3), 1014–1031 (2007)
Shyu, S.J.: Visual cryptograms of random Grids for General Access Structures. IEEE Trans. Circuits Syst. Video Techn. 23(3), 414–424 (2013)
Simmons, G.J.: How to (really) share a secret, CRYPTO 1988. LNCS 403, 390–448 (1990)
Wu, X., Sun, W.: Visual secret sharing for general access structures by random grids. IET Inf. Secur. 6(4), 299–309 (2012)
Yang, C.-N.: New visual secret sharing schemes using probabilistic method. Pattern Recognit. Lett. Elsevier 25, 481–494 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Dutta, S., Bhore, T., Sardar, M.K., Adhikari, A., Sakurai, K. (2021). Visual Secret Sharing Scheme with Distributed Levels of Importance of Shadows. In: Giri, D., Ho, A.T.S., Ponnusamy, S., Lo, NW. (eds) Proceedings of the Fifth International Conference on Mathematics and Computing. Advances in Intelligent Systems and Computing, vol 1170. Springer, Singapore. https://doi.org/10.1007/978-981-15-5411-7_2
Download citation
DOI: https://doi.org/10.1007/978-981-15-5411-7_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-5410-0
Online ISBN: 978-981-15-5411-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)