Skip to main content
SpringerLink
Log in

Enhanced Modulo Based Multi Secret Image Sharing Scheme

  • Conference paper
  • First Online:
Book cover Information Systems Security (ICISS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10063))

Included in the following conference series:

Abstract

Multi Secret Image Sharing (MSIS) scheme is a protected method to transmit more than one secret image over a communication channel. Traditionally, a single secret image is shared over a channel at a time. But as technology deepen, there arises a need for sharing more than one secret image. An (n, n)-MSIS scheme is used to encrypt n secret images into n meaningless shared images. To recover n secret images all n shared images are needed. In the state of the art, secrets are partially revealed from less than n shares. In this paper, we propose enhanced (n, n)-MSIS scheme based on modulo operation for binary, grayscale, and colored images. To increase the randomness of shared images we used Bitshift and Reversebit function. The experimental results show that the proposed scheme is highly secure and outperforms the existing MSIS schemes in terms of security.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Beimel, A., Farràs, O., Mintz, Y.: Secret sharing schemes for very dense graphs. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 144–161. Springer, Heidelberg (2012). doi:10.1007/978-3-642-32009-5_10

    Chapter  Google Scholar 

  2. Blakley, G.R.: Safeguarding cryptographic keys. In: Proceeding of the National Computer Conference 1979, vol. 48, pp. 313–317 (1979)

    Google Scholar 

  3. Blundo, C., Santis, A., Crescenzo, G., Gaggia, A.G., Vaccaro, U.: Multi-secret sharing schemes. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 150–163. Springer, Heidelberg (1994). doi:10.1007/3-540-48658-5_17

    Google Scholar 

  4. Chen, C.-C., Wu, W.-J.: A secure Boolean-based multi-secret image sharing scheme. J. Syst. Softw. 92, 107–114 (2014)

    Article  Google Scholar 

  5. Chen, T.-H., Tsao, K.-H.: Threshold visual secret sharing by random grids. J. Syst. Softw. 84(7), 1197–1208 (2011)

    Article  Google Scholar 

  6. Chen, T.-H., Wu, C.-S.: Efficient multi-secret image sharing based on boolean operations. Signal Process. 91(1), 90–97 (2011)

    Article  MATH  Google Scholar 

  7. Deshmukh, M., Nain, N., Ahmed, M.: An (n, n)-multi secret image sharing scheme using boolean XOR and modular arithmetic. In: 2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA), pp. 690–697. IEEE (2016)

    Google Scholar 

  8. Deshmukh, M., Nain, N., Ahmed, M.: A novel approach of an (n, n) multi secret image sharing scheme using additive modulo. In: International Conference on Computer Vision and Image Processing (2016)

    Google Scholar 

  9. Deshmukh, M., Prasad, M.: Comparative study of visual secret sharing schemes to protect iris image. Int. J. Inf. Process. 8(4), 91–98 (2014)

    Google Scholar 

  10. Hsu, C.-F., Harn, L., Cui, G.: An ideal multi-secret sharing scheme based on connectivity of graphs. Wireless Pers. Commun. 77(1), 383–394 (2014)

    Article  Google Scholar 

  11. Kumar, S., Sharma, R.K.: Threshold visual secret sharing based on boolean operations. Secur. Commun. Netw. 7(3), 653–664 (2014)

    Article  Google Scholar 

  12. Lin, K.-S., Lin, C.-H., Chen, T.-H.: Distortionless visual multi-secret sharing based on random grid. Inf. Sci. 288, 330–346 (2014)

    Article  Google Scholar 

  13. Naor, M., Shamir, A.: Visual cryptography. In: Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 1–12. Springer, Heidelberg (1995). doi:10.1007/BFb0053419

    Google Scholar 

  14. Rajput, M., Deshmukh, M.: Secure (n, n+1)-multi secret image sharing scheme using additive modulo. Procedia Comput. Sci. 89, 677–683 (2016)

    Article  Google Scholar 

  15. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  16. Shyu, S.J.: Image encryption by random grids. Pattern Recogn. 40(3), 1014–1031 (2007)

    Article  MATH  Google Scholar 

  17. Wang, D., Zhang, L., Ma, N., Li, X.: Two secret sharing schemes based on boolean operations. Pattern Recogn. 40(10), 2776–2785 (2007)

    Article  MATH  Google Scholar 

  18. Enhanced boolean-based multi secret image sharing scheme: C.-N. Yang, C.-H. Chen, and S.-R. Cai. Journal of Systems and software 116, 22–34 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, National Institute of Technology, Srinagar, 246174, Uttarakhand, India

    Maroti Deshmukh

  2. Malviya National Institute of Technology, Jaipur, India

    Maroti Deshmukh, Neeta Nain & Mushtaq Ahmed

Authors
  1. Maroti Deshmukh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Neeta Nain
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mushtaq Ahmed
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maroti Deshmukh .

Editor information

Editors and Affiliations

  1. Colorado State University, Fort Collins, Colorado, USA

    Indrajit Ray

  2. Malaviya National Institute of Technology, Jaipur, India

    Manoj Singh Gaur

  3. University of Padua, Padua, Italy

    Mauro Conti

  4. IIIT Delhi, Delhi, India

    Dheeraj Sanghi

  5. IIT Madras, Madras, India

    V. Kamakoti

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Deshmukh, M., Nain, N., Ahmed, M. (2016). Enhanced Modulo Based Multi Secret Image Sharing Scheme. In: Ray, I., Gaur, M., Conti, M., Sanghi, D., Kamakoti, V. (eds) Information Systems Security. ICISS 2016. Lecture Notes in Computer Science(), vol 10063. Springer, Cham. https://doi.org/10.1007/978-3-319-49806-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49806-5_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49805-8

  • Online ISBN: 978-3-319-49806-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation