Skip to main content
SpringerLink
Log in

Efficient and secure multi secret sharing schemes based on boolean XOR and arithmetic modulo

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Multi Secret Sharing (MSS) scheme is an efficient method of transmitting more than one secret securely. In (n, n)-MSS scheme n secrets are used to create n shares and for reconstruction, all n shares are required. In state of the art schemes n secrets are used to construct n or n + 1 shares, but one can recover partial secret information from less than n shares. There is a need to develop an efficient and secure (n, n)-MSS scheme so that the threshold property can be satisfied. In this paper, we propose three different (n, n)-MSS schemes. In the first and second schemes, Boolean XOR is used and in the third scheme, we used Modular Arithmetic. For quantitative analysis, Similarity metrics, Structural, and Differential measures are considered. A proposed scheme using Modular Arithmetic performs better compared to Boolean XOR. The proposed (n, n)-MSS schemes outperform the existing techniques in terms of security, time complexity, and randomness of shares.

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.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Blundo C et al (1994) Multi-secret sharing schemes. Advances in Cryptology, CRYPTO-94 Springer Berlin Heidelberg

  2. Chen T-H, Tsao K-H (2011) Threshold visual secret sharing by random grids. Journal of Systems and Software 84.7:1197–1208

    Article  Google Scholar 

  3. Chen T-H, Chang-Sian W (2011) Efficient multi-secret image sharing based on Boolean operations. Signal Processing 91.1:90–97

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  5. Chen C-C, Wei-Jie W, Chen J-L (2015) Highly efficient and secure multi-secret image sharing scheme. Multimedia Tools and Applications 75(12):1–16

  6. Deshmukh M, Prasad MVNK (2014) Comparative study of visual secret sharing schemes to protect iris image. In: International Conference on Image and Signal Processing (ICISP), pp 91–98

  7. Feng J-B et al (2005) A new multi-secret images sharing scheme using Largrange’s interpolation. Journal of Systems and Software 76.3:327–339

    Article  Google Scholar 

  8. Guo C et al (2015) A multi-threshold secret image sharing scheme based on the generalized Chinese reminder theorem. Multimedia Tools and Applications 75(18):1–18

  9. Guo C, Chang C-C, Qin C (2012) A multi-threshold secret image sharing scheme based on MSP. Pattern Recognition Letters 33.12:1594–1600

    Article  Google Scholar 

  10. Guo T, Feng L, ChuanKun W (2014) k out of k extended visual cryptography scheme by random grids. Signal Process 94:90–101

    Article  Google Scholar 

  11. Hsu C-F, Harn L, Cui G (2014) An Ideal Multi-secret Sharing Scheme Based on Connectivity of Graphs. Wireless personal communications 77.1:383–394

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  13. Lin T-L et al (2010) A novel visual secret sharing scheme for multiple secrets without pixel expansion. Expert systems with applications 37.12:7858–7869

    Article  Google Scholar 

  14. Lu S, Manchala D, Ostrovsky R (2008) Visual cryptography on graphs Computing and Combinatorics, Springer Berlin Heidelberg. 225–234

  15. Nag A et al (2014) Secret image sharing scheme based on a boolean operation. Cybernetics and Information Technologies 14.2:98–113

    MathSciNet  Google Scholar 

  16. Naor M, Shamir A (1995) Visual cryptography. Advances in cryptology-EUROCRYPT’94 Springer Berlin/Heidelberg

  17. Shyu SJ (2007) Image encryption by random grids. Pattern Recognition 40.3:1014–1031

    Article  MATH  Google Scholar 

  18. Wang Z et al (2004) Image quality assessment: from error visibility to structural similarity. IEEE Transactions on Image Processing 13.4:600–612

    Article  Google Scholar 

  19. Wang Da et al (2007) Two secret sharing schemes based on Boolean operations. Pattern Recognition 40.10:2776–2785

    Article  MATH  Google Scholar 

  20. Wang R-Z et al (2010) Incrementing visual cryptography using random grids. Optics Communications 283.21:4242–4249

    Article  Google Scholar 

  21. Wei S-C, Hou Y-C, Yen-Chun L (2015) A technique for sharing a digital image. Computer Standards and Interfaces 40:53–61

    Article  Google Scholar 

  22. Yang C-N, Chen C-H, Cai S-R (2015) Enhanced Boolean-based multi secret image sharing scheme. J Syst Softw 116:22–34

Download references

Author information

Authors and Affiliations

  1. National Institute of Technology, NH 58, Srinagar, Uttarakhand, 246174, India

    Maroti Deshmukh

  2. Malviya National Institute of Technology, Jaipur, 302017, 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.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Deshmukh, M., Nain, N. & Ahmed, M. Efficient and secure multi secret sharing schemes based on boolean XOR and arithmetic modulo. Multimed Tools Appl 77, 89–107 (2018). https://doi.org/10.1007/s11042-016-4229-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-016-4229-x

Keywords

Search

Navigation