Skip to main content
Erschienen in: Knowledge and Information Systems 3/2019

08.09.2018 | Regular Paper

Secret sharing scheme based on binary trees and Boolean operation

verfasst von: Maroti Deshmukh, Neeta Nain, Mushtaq Ahmed

Erschienen in: Knowledge and Information Systems | Ausgabe 3/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Blakley GR (1979) Safeguarding cryptographic keys. Proc Natl Comput Conf 1979(48):313–317 Blakley GR (1979) Safeguarding cryptographic keys. Proc Natl Comput Conf 1979(48):313–317
3.
Zurück zum Zitat 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–1274CrossRef 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–1274CrossRef
4.
Zurück zum Zitat Wang D, Zhang L, Ma N, Li X (2007) Two secret sharing schemes based on Boolean operations. Pattern Recognit 40(10):2776–2785CrossRefMATH Wang D, Zhang L, Ma N, Li X (2007) Two secret sharing schemes based on Boolean operations. Pattern Recognit 40(10):2776–2785CrossRefMATH
5.
Zurück zum Zitat 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 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.
Zurück zum Zitat Kafri O, Keren E (1987) Encryption of pictures and shapes by random grids. Opt Lett 12(6):377–379CrossRef Kafri O, Keren E (1987) Encryption of pictures and shapes by random grids. Opt Lett 12(6):377–379CrossRef
7.
Zurück zum Zitat Chen T-H, Tsao K-H (2009) Visual secret sharing by random grids revisited. Pattern Recognit 42(9):2203–2217CrossRefMATH Chen T-H, Tsao K-H (2009) Visual secret sharing by random grids revisited. Pattern Recognit 42(9):2203–2217CrossRefMATH
8.
Zurück zum Zitat Tuncer T, Avci E (2016) A reversible data hiding algorithm based on probabilistic DNA-XOR secret sharing scheme for color images. Displays 41:1–8CrossRef Tuncer T, Avci E (2016) A reversible data hiding algorithm based on probabilistic DNA-XOR secret sharing scheme for color images. Displays 41:1–8CrossRef
9.
Zurück zum Zitat 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 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.
Zurück zum Zitat Beimel A (2011) Secret-sharing schemes: a survey. In: International conference on coding and cryptology. Springer, pp 11–46 Beimel A (2011) Secret-sharing schemes: a survey. In: International conference on coding and cryptology. Springer, pp 11–46
11.
Zurück zum Zitat Karchmer M, Wigderson A (1993) On span programs. In: Proceedings of the eighth annual structure in complexity theory conference, 1993. IEEE, pp 102–111 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.
Zurück zum Zitat Csirmaz L, Tardos G (2009) Secret sharing on trees: problem solved Csirmaz L, Tardos G (2009) Secret sharing on trees: problem solved
13.
Zurück zum Zitat 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–135MathSciNetCrossRefMATH 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–135MathSciNetCrossRefMATH
14.
Zurück zum Zitat Thien C-C, Lin J-C (2002) Secret image sharing. Comput Graph 26(5):765–770CrossRef Thien C-C, Lin J-C (2002) Secret image sharing. Comput Graph 26(5):765–770CrossRef
15.
Zurück zum Zitat Guo T, Liu F, ChuanKun W (2014) k Out of k extended visual cryptography scheme by random grids. Signal Process 94:90–101CrossRef Guo T, Liu F, ChuanKun W (2014) k Out of k extended visual cryptography scheme by random grids. Signal Process 94:90–101CrossRef
16.
17.
Zurück zum Zitat 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–4249CrossRef 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–4249CrossRef
18.
Zurück zum Zitat Chen T-H, Tsao K-H (2011) Threshold visual secret sharing by random grids. J Syst Softw 84(7):1197–1208CrossRef Chen T-H, Tsao K-H (2011) Threshold visual secret sharing by random grids. J Syst Softw 84(7):1197–1208CrossRef
19.
Zurück zum Zitat Chen T-H, Chang-Sian W (2011) Efficient multi-secret image sharing based on Boolean operations. Signal Process 91(1):90–97CrossRefMATH Chen T-H, Chang-Sian W (2011) Efficient multi-secret image sharing based on Boolean operations. Signal Process 91(1):90–97CrossRefMATH
20.
Zurück zum Zitat Chen C-C, Wei-Jie W (2014) A secure Boolean-based multi-secret image sharing scheme. J Syst Softw 92:107–114CrossRef Chen C-C, Wei-Jie W (2014) A secure Boolean-based multi-secret image sharing scheme. J Syst Softw 92:107–114CrossRef
21.
Zurück zum Zitat 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–19CrossRef 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–19CrossRef
22.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
27.
Zurück zum Zitat 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–302CrossRef 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–302CrossRef
28.
Zurück zum Zitat 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 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
29.
Zurück zum Zitat 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–339CrossRef 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–339CrossRef
30.
Zurück zum Zitat Guo C, Chang C-C, Qin C (2012) A multi-threshold secret image sharing scheme based on msp. Pattern Recognit Lett 33(12):1594–1600CrossRef Guo C, Chang C-C, Qin C (2012) A multi-threshold secret image sharing scheme based on msp. Pattern Recognit Lett 33(12):1594–1600CrossRef
31.
Zurück zum Zitat 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 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
Metadaten
Titel
Secret sharing scheme based on binary trees and Boolean operation
verfasst von
Maroti Deshmukh
Neeta Nain
Mushtaq Ahmed
Publikationsdatum
08.09.2018
Verlag
Springer London
Erschienen in
Knowledge and Information Systems / Ausgabe 3/2019
Print ISSN: 0219-1377
Elektronische ISSN: 0219-3116
DOI
https://doi.org/10.1007/s10115-018-1268-9

Weitere Artikel der Ausgabe 3/2019

Knowledge and Information Systems 3/2019 Zur Ausgabe