[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Secret sharing scheme based on binary trees and Boolean operation

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

Conventional visual secret sharing schemes hide a secret into a number of shares, which are either printed or in digital form. Noise-like pixels appear due to hiding a secret in shares, but during the transmission of shares, it increases the interception risk. Hence, visual secret sharing schemes suffer from a transmission risk problem. To solve this problem, we propose a secret sharing scheme which will allow the sender to divide the secret into \(2^h\) shares using a full binary tree structure and Boolean XOR, where h is the height of the tree. A man-in-the-middle attack is only possible if the attacker knows the number of shares the sender has generated. The attacker cannot decipher the secret using less than \(2^h\) number of shares. This scheme is secure and takes minimum computation time for sharing as well as recovery of a secret. The proposed scheme works good on binary, grayscale, and colored images, and recovery of this scheme is lossless.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Blakley GR (1979) Safeguarding cryptographic keys. Proc Natl Comput Conf 1979(48):313–317

    Google Scholar 

  3. Chen T-H, Lee Y-S, Huang W-L, Juan JS-T, Chen Y-Y, Li M-J (2013) Quality-adaptive visual secret sharing by random grids. J Syst Softw 86(5):1267–1274

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Naor M, Shamir A (1995) Visual cryptography. In: De Santis (ed) Advances in cryptology—EUROCRYPT’94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, pp 1–12

  6. Kafri O, Keren E (1987) Encryption of pictures and shapes by random grids. Opt Lett 12(6):377–379

    Article  Google Scholar 

  7. Chen T-H, Tsao K-H (2009) Visual secret sharing by random grids revisited. Pattern Recognit 42(9):2203–2217

    Article  MATH  Google Scholar 

  8. Tuncer T, Avci E (2016) A reversible data hiding algorithm based on probabilistic DNA-XOR secret sharing scheme for color images. Displays 41:1–8

    Article  Google Scholar 

  9. Jarecki S, Kiayias A, Krawczyk H, Xu J (2016) Highly-efficient and composable password-protected secret sharing (or: how to protect your bitcoin wallet online). In: 2016 IEEE European symposium on security and privacy (EuroS&P). IEEE, pp 276–291

  10. Beimel A (2011) Secret-sharing schemes: a survey. In: International conference on coding and cryptology. Springer, pp 11–46

  11. Karchmer M, Wigderson A (1993) On span programs. In: Proceedings of the eighth annual structure in complexity theory conference, 1993. IEEE, pp 102–111

  12. Csirmaz L, Tardos G (2009) Secret sharing on trees: problem solved

  13. Sun H-M, Shieh S-P (1996) An efficient construction of perfect secret sharing schemes for graph-based structures. Comput Math Appl 31(7):129–135

    Article  MathSciNet  MATH  Google Scholar 

  14. Thien C-C, Lin J-C (2002) Secret image sharing. Comput Graph 26(5):765–770

    Article  Google Scholar 

  15. Guo T, Liu F, ChuanKun W (2014) k Out of k extended visual cryptography scheme by random grids. Signal Process 94:90–101

    Article  Google Scholar 

  16. Shyu SJ (2007) Image encryption by random grids. Pattern Recognit 40(3):1014–1031

    Article  MATH  Google Scholar 

  17. Wang R-Z, Lan Y-C, Lee Y-K, Huang S-Y, Shyu S-J, Chia T-L (2010) Incrementing visual cryptography using random grids. Opt Commun 283(21):4242–4249

    Article  Google Scholar 

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

    Article  Google Scholar 

  19. Chen T-H, Chang-Sian W (2011) Efficient multi-secret image sharing based on Boolean operations. Signal Process 91(1):90–97

    Article  MATH  Google Scholar 

  20. 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 

  21. Deshmukh M, Nain N, Ahmed M (2018) Efficient and secure multi secret sharing schemes based on Boolean XOR and arithmetic modulo. Multimed Tools Appl 77:1–19

    Article  Google Scholar 

  22. Deshmukh M, Nain N, Ahmed M (2016) 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). IEEE, pp 690–697

  23. Deshmukh M, Nain N, Ahmed M (2016) A novel approach of an (n, n) multi secret image sharing scheme using additive modulo. In: International conference on computer vision and image processing

  24. 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, pp 212–224

  25. Mignotte M (1982) How to share a secret. In: Beth T (ed) Cryptography. EUROCRYPT 1982. Lecture Notes in Computer Science, vol 149. Springer, Berlin, pp 371–375

  26. Asmuth C, Bloom J (1983) A modular approach to key safeguarding. IEEE Trans Inf Theory 29(2):208–210

    Article  MathSciNet  Google Scholar 

  27. Deshmukh M, Nain N, Ahmed M (2017) A novel approach for sharing multiple color images by employing chinese remainder theorem. J Vis Commun Image Represent 49:291–302

    Article  Google Scholar 

  28. Yue Wu, Noonan Joseph P, Sos Agaian (2011) NPCR and UACI randomness tests for image encryption. Cyber J Multidiscip J Sci Technol J Sel Areas Telecommun (JSAT) 1:31–38

    Google Scholar 

  29. Feng J-B, Hsien-Chu W, Tsai C-S, Chu Y-P (2005) A new multi-secret images sharing scheme using largrange’s interpolation. J Syst Softw 76(3):327–339

    Article  Google Scholar 

  30. Guo C, Chang C-C, Qin C (2012) A multi-threshold secret image sharing scheme based on msp. Pattern Recognit Lett 33(12):1594–1600

    Article  Google Scholar 

  31. Guo C, Zhang H, Song Q, Li M (2015) A multi-threshold secret image sharing scheme based on the generalized chinese reminder theorem. Multimed Tools Appl 75:1–18

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Institute of Technology, Uttarakhand, Srinagar, India

    Maroti Deshmukh

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

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. Secret sharing scheme based on binary trees and Boolean operation. Knowl Inf Syst 60, 1377–1396 (2019). https://doi.org/10.1007/s10115-018-1268-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-018-1268-9

Keywords

Search

Navigation