Skip to main content
SpringerLink
Log in

Maximal contrast color visual secret sharing schemes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

The transition of visual secret sharing from a black & white secret image to a color image is not straight-forward. There are several models of color superposition principle. In this paper we present color visual cryptographic scheme realizing monotone access structure. We first give a generic construction method to share a color image in same color model. In particular, our construction achieves maximal contrast. We also give a direct and efficient construction of visual secret sharing for \((k,n)^*\)-access structure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. 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).

    Article  MathSciNet  MATH  Google Scholar 

  2. Adhikari A., Bose M.: A new visual cryptographic scheme using latin squares. In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 87(5), 1198–1202 (2004).

  3. Adhikari A., Dutta T.K., Roy B.: A New Black and White Visual Cryptographic Scheme for General Access Structures. In: INDOCRYPT’04. LNCS 3348, 399–413 (2004).

  4. Adhikari A., Sikdar S.: A New \((2, n)\)-Visual Threshold Scheme for Color Images. In: INDOCRYPT’03. LNCS 2904, 148–161 (2003).

  5. Adhikari A., Bose M., Kumar D., Roy B.K.: Applications of partially balanced incomplete block designs in developing (2, n) visual cryptographic schemes. In: IEICE Transactions 90–A(5), 949–951 (2007).

  6. Arumugam S., Lakshmanan R., Nagar A.K.: On (k, n)*-visual cryptography scheme. Des. Codes Cryptogr. 71(1), 153–162 (2014).

    Article  MathSciNet  MATH  Google Scholar 

  7. Ateniese G., Blundo C., De Santis A., Stinson D.R.: Visual cryptography for general access structures. Inf. Comput. 129, 86–106 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  8. Ateniese G., Blundo C., De Santis A., Stinson D.R.: Constructions and Bounds for Visual Cryptography. In: ICALP’96. LNCS 1099, 416–428 (1996).

  9. Blundo C., D’arco P., De Santis A., Stinson D.R.: Contrast optimal threshold visual cryptography. SIAM J. Discret. Math. 16(2), 224–261 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  10. Blundo C., De Bonis A., De Santis A.: Improved schemes for visual cryptography. Des. Codes Cryptogr. 24(3), 255–278 (2001).

    Article  MathSciNet  MATH  Google Scholar 

  11. Cimato S., De Prisco R., De Santis A.: Optimal colored threshold visual cryptography schemes. Des. Codes Cryptogr. 35(3), 311–335 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  12. Cimato S., De Prisco R., De Santis A.: Colored visual cryptography without color darkening. Theor. Comput. Sci. 374(1–3), 261–276 (2007).

    Article  MathSciNet  MATH  Google Scholar 

  13. Cimato S., Yang C.N.: Visual Cryptography and Secret Image Sharing. Taylor & Francis, CRC Press, Boca Raton (2011).

    Book  MATH  Google Scholar 

  14. Dutta S., Rohit R.S., 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).

    Article  MathSciNet  MATH  Google Scholar 

  15. Dutta S., Adhikari A.: XOR based non-monotone \(t-(k, n)^*\)-visual cryptographic schemes using linear algebra. ICICS 2014, 230–242 (2014).

    MATH  Google Scholar 

  16. Dutta S., Adhikari A.: Contrast optimal XOR based visual cryptographic schemes. ICITS 2017, 58–72 (2017).

    MathSciNet  MATH  Google Scholar 

  17. Guo T., Liu F., Wu C.K., Ren Y.W., Wang W.: On (k, n) Visual Cryptography Scheme with t Essential Parties. In: ICITS’13. LNCS 8317, 56–68 (2014).

  18. Hou Y.-C.: Visual cryptography for color images. Pattern Recognit. 36(7), 1619–1629 (2003).

    Article  Google Scholar 

  19. Iwamoto M.: A weak security notion for visual secret sharing schemes. IEEE Trans. Inf. Forensics Secur. 7(2), 372–382 (2012).

    Article  Google Scholar 

  20. Jin D., Yan W.-Q., Kankanhalli M.S.: Progressive color visual cryptography. J. Electron. Imaging 14(3), 033019 (2005).

    Article  Google Scholar 

  21. Koga H., Yamamoto H.: Proposal of a lattice-based visual secret sharing scheme for color and gray-scale images. In: IEICE Transactions on Fundamentals of Electronics, Communications & Computer Sciences E81–A(6), 1262–1269 (1998).

  22. Liu F., Wu C.K., Lin X.J.: Colour visual cryptography schemes. IET Inf. Secur. 2(4), 151–165 (2008).

    Article  Google Scholar 

  23. Naor M., Shamir A.: Visual Cryptography. In: EUROCRYPT’94. LNCS 950, 1–12 (1994).

  24. Rijmen, V., Preneel, B.: Efficient colour visual encryption or shared colors of benetton. EUROCRYPT’96 Rump Section. http://www.iacr.org/conference/ec96/rump/preneel.ps.gz

  25. Praveen K., Rajeev K., Sethumadhavan M.: On the Extensions of \((k, n)^*\)-Visual Cryptographic Schemes. In: SNDS’14, CCIS 420, 231–238 (2014).

  26. Shyu S.J.: Efficient visual secret sharing scheme for color images. Pattern Recognit. 39(5), 866–880 (2006).

    Article  MATH  Google Scholar 

  27. Verheul E.R., Tilborg H.C.A.: Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes. Des. Codes Cryptogr. 11(2), 179–196 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  28. Yang C.-N., Laih C.-S.: New colored visual secret sharing schemes. Des. Codes Cryptogr. 20(3), 325–336 (2000).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors are thankful to the anonymous reviewers for their comments and suggestions. The authors are also thankful to Md. Kutubuddin Sardar of Department of Pure Mathematics, University of Calcutta for fruitful discussions and implementations during the preparation of manuscript. Research of Dr. Adhikari is partially supported by National Board for Higher Mathematics, Department of Atomic Energy, Government of India (No 2/48(10)/2013/NBHM(R.P.)/R & D II/695).

Author information

Authors and Affiliations

  1. R C Bose Centre for Cryptology & Security, Indian Statistical Institute, 203, B T Road, Kolkata, 700108, India

    Sabyasachi Dutta

  2. Department of Pure Mathematics, University of Calcutta, 35, Ballygunge Circular Road, Kolkata, 700019, India

    Avishek Adhikari

  3. Cryptology & Security Research Unit, Computer & Communication Sciences Division, Indian Statistical Institute, 203, B T Road, Kolkata, 700108, India

    Sushmita Ruj

Authors
  1. Sabyasachi Dutta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Avishek Adhikari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sushmita Ruj
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Avishek Adhikari.

Additional information

Communicated by C. Blundo.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dutta, S., Adhikari, A. & Ruj, S. Maximal contrast color visual secret sharing schemes. Des. Codes Cryptogr. 87, 1699–1711 (2019). https://doi.org/10.1007/s10623-018-0570-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-018-0570-6

Keywords

Mathematics Subject Classification

Search

Navigation