Abstract
In this paper we give an explicit construction of basis matrices for a (k, n)-visual cryptography scheme \((k,n){\hbox {-}}\mathrm{VCS}\) for integers k and n with \(2\le k \le n\). In balanced VCS every set of participants with equal cardinality has same relative contrast. The VCS constructed in this paper is a balanced \((k,n){\hbox {-}}\mathrm{VCS}\) for general k. Also we obtain a formula for pixel expansion and relative contrast. We also prove that our construction gives optimal contrast and minimum pixel expansion when \(k=n\) and \(n-1\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adhikari A., Dutta T.K., Roy B.: A new black and white visual cryptographic scheme for a general access structures. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. Lecture Notes in Computer Science, pp. 399–413. Springer, Berlin (2004).
Aigner M.: A Course in Enumeration, p. 182. Springer, Berlin (2007).
Ateniese G., Blundo C., De Santis A., Stinson D.R.: Visual cryptography for general access structures. Inf. Comput. 129, 86–106 (1996).
Blundo C., De Santis A., Stinson D.R.: On the contrast in visual cryptography schemes. J. Cryptol. 12(4), 261–289 (1999).
Blundo C., De Bonis A., De Santis A.: Improved scheme for visual cryptography. Des. Codes Cryptogr. 24, 255–278 (2001).
Blundo C., D’Arco P., De Santis A., Stinson D.R.: Contrast of optimal threshold visual cryptography scheme. SIAM J. Discret. Math. 16(2), 224–261 (2003).
Bose M., Mukerjee R.: Optimal \((k, n)\) visual cryptography schemes for general \(k,\) Des. Codes Cryptogr. 55, 19–35 (2010).
Choi C.K., Yang S.S., Park J.S., Kohno R.: New construction for improving contrast in visual cryptography. In: Proceedings of ISITA, Mexico City, Mexico, pp. 368–371 (1998).
De Prisco R., De Santis A.: On the relation of random grid and deterministic visual cryptography. IEEE Trans. Inf. Forensics Secur. 9(4), 653–665 (2014).
Droste S.: New results on visual cryptography. In: Koblitz, N. (ed.) Advances in Cryptology-CRYPTO’ 96. Lecture Notes in Computer Science, vol. 1109, pp. 401–415. Springer, Berlin (1996).
Eisen P.A., Stinson D.R.: Threshold visual cryptography scheme with specified whiteness level of reconstructed pixels. Des. Codes Cryptogr. 25(1), 15–61 (2002).
Fang W.P., Lin J.C.: Progressive viewing and sharing of sensitive Images. Patt. Recog. Image Anal. 16(4), 638–642 (2006).
Hofmeister T., Krause M., Simon H.U.: Contrast-optimal \(k\) out of \(n\) secret sharing schemes in visual cryptography. Theor. Comput. Sci. 240, 471–485 (2000).
Kato T., Ima H.: An extented construction method of visual secret sharing scheme. IEICE Trans. J79-A(8), 1344–1351 (1996).
Koga H.: A general formula of the threshold visual secret sharing scheme. In: Advances in Cryptology-ASIACRYPT 2002. LNCS, vol. 2501, pp. 328–345. Springer, Berlin (2002).
Koga H., Ueda E.: Basic properties of \((t, n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels. Des. Codes Cryptogr. 40, 81–102 (2006).
Krause M., Simon H.U.: Determining the optimal contrast for secret sharing schemes in visual cryptography. Comb. Probab. Comput. 12(3), 285–299 (2003).
Naor M., Shamir A.: Visual cryptography. In: De Santis, A. (ed.) Advances in Cryptography-EUROCRYPT’ 94. Lecture Notes in Computer Science, vol. 950, pp. 1–12. Springer, Berlin (1995).
Verheul E.R., Van Tilborg H.C.A.: Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes. Des. Codes Cryptogr. 11(2), 179–196 (1997).
Acknowledgments
The authors are thankful to the Department of Science and Technology, New Delhi for its support through the n-CARDMATH Project SR/S4/MS:427/07. Also the authors would like to acknowledge the Editors of the Journal and anonymous reviewers for their encouragement and constructive comments in revising the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C. Blundo.
Rights and permissions
About this article
Cite this article
Lakshmanan, R., Arumugam, S. Construction of a (k, n)-visual cryptography scheme. Des. Codes Cryptogr. 82, 629–645 (2017). https://doi.org/10.1007/s10623-016-0181-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-016-0181-z