Skip to main content
Erschienen in: The Journal of Supercomputing 10/2021

06.04.2021

A novel approach for multilevel multi-secret image sharing scheme

verfasst von: Kanchan Bisht, Maroti Deshmukh

Erschienen in: The Journal of Supercomputing | Ausgabe 10/2021

Einloggen

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

search-config
loading …

Abstract

Multi-secret sharing (MSS) is an effective technique that securely encodes multiple secrets to generate shares and distributes them among the participants in such a way that these shares can be used later to reconstruct the secrets. MSS schemes have a considerable advantage over the single-secret sharing schemes for secure multimedia data transmission. This paper presents a novel secret image sharing approach, namely ‘(nml)-Multilevel Multi-Secret Image Sharing (MMSIS) scheme.’ The proposed MMSIS scheme encodes ‘n’ distinct secret images to generate ‘m’ shares and distributes them among ‘m’ participants allocated to ‘l’ distinct levels. The paper proposes two variants of the MMSIS scheme. The first variant is an \((n,n+1,l)\)-MMSIS scheme which encodes ‘n’ secret images each having a unique level id \(L_k\) into \((n+1)\) shares. The image shares are then distributed among \((n+1)\) participants assigned to ‘\(l=n\)’ different levels. With the increase in level id, the number of shares required to reconstruct the secret image also increases. To reconstruct a secret image of a particular level \(L_k\), all the shares at level \(L_k\) and its preceding levels need to be acquired, which requires the consensus of all participants holding the shares up to level \(L_k\). The second variant, namely extended-MMSIS (EMMSIS) scheme is a generalized (nml) version of the former scheme that allows to generate more shares for a specific secret image at a particular level in accordance with the consensus requirements for its reconstruction. The multilevel structure of the scheme makes it useful for multi-secret distribution in a multilevel organizational structure.

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

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!

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!

Literatur
2.
Zurück zum Zitat Blakley GR (1979) Safeguarding cryptographic keys. In: International Workshop on Managing Requirements Knowledge, Los Alamitos, CA, USA. IEEE Computer Society, p 313 Blakley GR (1979) Safeguarding cryptographic keys. In: International Workshop on Managing Requirements Knowledge, Los Alamitos, CA, USA. IEEE Computer Society, p 313
3.
Zurück zum Zitat Li L, Yuliang L, Yan X, Liu L, Tan L (2019) Lossless \((k, n)\)-threshold image secret sharing based on the Chinese remainder theorem without auxiliary encryption. IEEE Access 7:75113–75121CrossRef Li L, Yuliang L, Yan X, Liu L, Tan L (2019) Lossless \((k, n)\)-threshold image secret sharing based on the Chinese remainder theorem without auxiliary encryption. IEEE Access 7:75113–75121CrossRef
4.
Zurück zum Zitat Tan L, Yuliang L, Yan X, Liu L, Li L (2019) Weighted secret image sharing for a \((k, n)\) threshold based on the Chinese remainder theorem. IEEE Access 7:59278–59286CrossRef Tan L, Yuliang L, Yan X, Liu L, Li L (2019) Weighted secret image sharing for a \((k, n)\) threshold based on the Chinese remainder theorem. IEEE Access 7:59278–59286CrossRef
5.
Zurück zum Zitat Chen D, Wei L, Xing W, Wang N (2019) An efficient verifiable threshold multi-secret sharing scheme with different stages. IEEE Access 7:107104–107110CrossRef Chen D, Wei L, Xing W, Wang N (2019) An efficient verifiable threshold multi-secret sharing scheme with different stages. IEEE Access 7:107104–107110CrossRef
6.
Zurück zum Zitat Ben-Hui Zhang, Yuan-Sheng Tang (2018) On the construction and analysis of verifiable multi-secret sharing based on non-homogeneous linear recursion. J Inf Sci Eng 34(3):749–763MathSciNet Ben-Hui Zhang, Yuan-Sheng Tang (2018) On the construction and analysis of verifiable multi-secret sharing based on non-homogeneous linear recursion. J Inf Sci Eng 34(3):749–763MathSciNet
7.
Zurück zum Zitat Chao H-C, Fan T-Y (2017) Xor-based progressive visual secret sharing using generalized random grids. Displays 49:6–15CrossRef Chao H-C, Fan T-Y (2017) Xor-based progressive visual secret sharing using generalized random grids. Displays 49:6–15CrossRef
8.
Zurück zum Zitat Kannojia SP, Kumar J (2019) Xor-based unexpanded meaningful visual secret sharing scheme. IJSN 14(1):1–9CrossRef Kannojia SP, Kumar J (2019) Xor-based unexpanded meaningful visual secret sharing scheme. IJSN 14(1):1–9CrossRef
9.
Zurück zum Zitat Manupriya P, Sinha S, Kumar K (2017) Vsee: video secret sharing encryption technique. In 2017 Conference on Information and Communication Technology (CICT), IEEE, pp 1–6 Manupriya P, Sinha S, Kumar K (2017) Vsee: video secret sharing encryption technique. In 2017 Conference on Information and Communication Technology (CICT), IEEE, pp 1–6
10.
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
11.
Zurück zum Zitat Duseja T, Deshmukh M (2019) Image compression and encryption using Chinese remainder theorem. Multimedia Tools Appl 78(12):16727–16753CrossRef Duseja T, Deshmukh M (2019) Image compression and encryption using Chinese remainder theorem. Multimedia Tools Appl 78(12):16727–16753CrossRef
12.
Zurück zum Zitat Deshmukh M, Nain N, Ahmed M (2019) Secret sharing scheme based on binary trees and Boolean operation. Knowl Inf Syst 60(3):1377–1396CrossRef Deshmukh M, Nain N, Ahmed M (2019) Secret sharing scheme based on binary trees and Boolean operation. Knowl Inf Syst 60(3):1377–1396CrossRef
13.
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
14.
Zurück zum Zitat Gupta M, Gupta M, Deshmukh M (2020) Single secret image sharing scheme using neural cryptography. In: Multimedia Tools and Applications, pp 1–22 Gupta M, Gupta M, Deshmukh M (2020) Single secret image sharing scheme using neural cryptography. In: Multimedia Tools and Applications, pp 1–22
15.
Zurück zum Zitat Agarwal A, Deshmukh M (2021) 3-d plane based extended Shamir’s secret sharing. Int J Inf Technol 1–4 Agarwal A, Deshmukh M (2021) 3-d plane based extended Shamir’s secret sharing. Int J Inf Technol 1–4
16.
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
17.
Zurück zum Zitat Yang C-N, Chen T-S, Kun Hsuan Yu, Wang C-C (2007) Improvements of image sharing with steganography and authentication. J Syst Softw 80(7):1070–1076CrossRef Yang C-N, Chen T-S, Kun Hsuan Yu, Wang C-C (2007) Improvements of image sharing with steganography and authentication. J Syst Softw 80(7):1070–1076CrossRef
18.
Zurück zum Zitat Ding W, Liu K, Yan X, Liu L (2018) Polynomial-based secret image sharing scheme with fully lossless recovery. Int J Digit Crime Forensics (IJDCF) 10(2):120–136CrossRef Ding W, Liu K, Yan X, Liu L (2018) Polynomial-based secret image sharing scheme with fully lossless recovery. Int J Digit Crime Forensics (IJDCF) 10(2):120–136CrossRef
19.
Zurück zum Zitat Zhou X, Yuliang L, Yan X, Wang Y, Liu L (2018) Lossless and efficient polynomial-based secret image sharing with reduced shadow size. Symmetry 10(7):249CrossRef Zhou X, Yuliang L, Yan X, Wang Y, Liu L (2018) Lossless and efficient polynomial-based secret image sharing with reduced shadow size. Symmetry 10(7):249CrossRef
20.
Zurück zum Zitat Gong Q, Wang Y, Yan X, Liu L (2019) Efficient and lossless polynomial-based secret image sharing for color images. IEEE Access 7:113216–113222CrossRef Gong Q, Wang Y, Yan X, Liu L (2019) Efficient and lossless polynomial-based secret image sharing for color images. IEEE Access 7:113216–113222CrossRef
21.
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
22.
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. Multimedia Tools Appl 77(1):89–107CrossRef Deshmukh M, Nain N, Ahmed M (2018) Efficient and secure multi secret sharing schemes based on Boolean XOR and arithmetic modulo. Multimedia Tools Appl 77(1):89–107CrossRef
23.
Zurück zum Zitat Rajput M, Deshmukh M (2016) Secure (n, n+ 1)-multi secret image sharing scheme using additive modulo. Procedia Comput Sci 89:677–683CrossRef Rajput M, Deshmukh M (2016) Secure (n, n+ 1)-multi secret image sharing scheme using additive modulo. Procedia Comput Sci 89:677–683CrossRef
24.
Zurück zum Zitat Meghrajani YK, Desai LS, Mazumdar HS (2019) Secure and efficient arithmetic-based multi-secret image sharing scheme using universal share. J Inf Secur Appl 47:267–274 Meghrajani YK, Desai LS, Mazumdar HS (2019) Secure and efficient arithmetic-based multi-secret image sharing scheme using universal share. J Inf Secur Appl 47:267–274
25.
Zurück zum Zitat Lin K-S, Lin C-H, Chen T-H (2014) Distortionless visual multi-secret sharing based on random grid. Inf Sci 288:330–346CrossRef Lin K-S, Lin C-H, Chen T-H (2014) Distortionless visual multi-secret sharing based on random grid. Inf Sci 288:330–346CrossRef
26.
Zurück zum Zitat Salehi S, Balafar MA (2014) Visual multi secret sharing by cylindrical random grid. J Inf Secur Appl 19(3):245–255 Salehi S, Balafar MA (2014) Visual multi secret sharing by cylindrical random grid. J Inf Secur Appl 19(3):245–255
27.
Zurück zum Zitat Rajput M, Deshmukh M, Nain N, Ahmed M (2018) Securing data through steganography and secret sharing schemes: trapping and misleading potential attackers. IEEE Consum Electron Mag 7(5):40–45CrossRef Rajput M, Deshmukh M, Nain N, Ahmed M (2018) Securing data through steganography and secret sharing schemes: trapping and misleading potential attackers. IEEE Consum Electron Mag 7(5):40–45CrossRef
28.
Zurück zum Zitat Chen T-H, Chang-Sian W (2011) Efficient multi-secret image sharing based on boolean operations. Sig Process 91(1):90–97CrossRef Chen T-H, Chang-Sian W (2011) Efficient multi-secret image sharing based on boolean operations. Sig Process 91(1):90–97CrossRef
29.
Zurück zum Zitat Ghodosi H, Pieprzyk J, Safavi-Naini R (1998) Secret sharing in multilevel and compartmented groups. In: Australasian Conference on Information Security and Privacy. Springer, pp 367–378 Ghodosi H, Pieprzyk J, Safavi-Naini R (1998) Secret sharing in multilevel and compartmented groups. In: Australasian Conference on Information Security and Privacy. Springer, pp 367–378
30.
Zurück zum Zitat Simmons GJ (1988) How to (really) share a secret. In: Conference on the Theory and Application of Cryptography. Springer, pp 390–448 Simmons GJ (1988) How to (really) share a secret. In: Conference on the Theory and Application of Cryptography. Springer, pp 390–448
31.
Zurück zum Zitat Lin CH, Lein YD (2009) Ideal perfect multilevel threshold secret sharing scheme. In: 2009 Fifth International Conference on Information Assurance and Security, IEEE, vol 2, pp 118–121 Lin CH, Lein YD (2009) Ideal perfect multilevel threshold secret sharing scheme. In: 2009 Fifth International Conference on Information Assurance and Security, IEEE, vol 2, pp 118–121
32.
Zurück zum Zitat Siva Kumar PV, Kurra RR, Tentu AN, Padmavathi G (2014) Multi-level secret sharing scheme for mobile ad-hoc networks. Int J Adv Netw Appl 6(2):2253 Siva Kumar PV, Kurra RR, Tentu AN, Padmavathi G (2014) Multi-level secret sharing scheme for mobile ad-hoc networks. Int J Adv Netw Appl 6(2):2253
33.
Zurück zum Zitat Harn L, Fuyou M (2014) Multilevel threshold secret sharing based on the Chinese remainder theorem. Inf Process Lett 114(9):504–509MathSciNetCrossRef Harn L, Fuyou M (2014) Multilevel threshold secret sharing based on the Chinese remainder theorem. Inf Process Lett 114(9):504–509MathSciNetCrossRef
34.
35.
Zurück zum Zitat Mignotte M (1982) How to share a secret. In: Workshop on Cryptography. Springer, pp 371–375 Mignotte M (1982) How to share a secret. In: Workshop on Cryptography. Springer, pp 371–375
36.
Zurück zum Zitat Meng K, Miao F, Huang W, Xiong Y (2019) Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem. Discrete Appl Math 268:152–163MathSciNetCrossRef Meng K, Miao F, Huang W, Xiong Y (2019) Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem. Discrete Appl Math 268:152–163MathSciNetCrossRef
37.
Zurück zum Zitat Singh N, Naidu TA, Basit A, Venkaiah VC (2016) Sequential secret sharing scheme based on Chinese remainder theorem. In: 2016 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), IEEE, pp 1–6 Singh N, Naidu TA, Basit A, Venkaiah VC (2016) Sequential secret sharing scheme based on Chinese remainder theorem. In: 2016 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), IEEE, pp 1–6
38.
Zurück zum Zitat Basit A, Chaitanya Kumar N, Venkaiah VC, Abdul MS, Naidu TA, Naik W (2017) Multi-stage multi-secret sharing scheme for hierarchical access structure. In: 2017 International Conference on Computing, Communication and Automation (ICCCA), IEEE, pp 557–563 Basit A, Chaitanya Kumar N, Venkaiah VC, Abdul MS, Naidu TA, Naik W (2017) Multi-stage multi-secret sharing scheme for hierarchical access structure. In: 2017 International Conference on Computing, Communication and Automation (ICCCA), IEEE, pp 557–563
39.
Zurück zum Zitat Wang R-Z, Lee Y-K, Huang S-Y, Chia T-L (2007) Multilevel visual secret sharing. In: Second International Conference on Innovative Computing, Information and Control (ICICIC 2007), IEEE, pp 283–283 Wang R-Z, Lee Y-K, Huang S-Y, Chia T-L (2007) Multilevel visual secret sharing. In: Second International Conference on Innovative Computing, Information and Control (ICICIC 2007), IEEE, pp 283–283
40.
Zurück zum Zitat Koikara R, Paul A, Yoo K-Y (2016) Multilevel threshold secret image sharing based on the Chinese remainder theorem. In: Proceedings of the International Conference on Security and Management (SAM). The Steering Committee of The World Congress in Computer Science, Computer, p 318 Koikara R, Paul A, Yoo K-Y (2016) Multilevel threshold secret image sharing based on the Chinese remainder theorem. In: Proceedings of the International Conference on Security and Management (SAM). The Steering Committee of The World Congress in Computer Science, Computer, p 318
Metadaten
Titel
A novel approach for multilevel multi-secret image sharing scheme
verfasst von
Kanchan Bisht
Maroti Deshmukh
Publikationsdatum
06.04.2021
Verlag
Springer US
Erschienen in
The Journal of Supercomputing / Ausgabe 10/2021
Print ISSN: 0920-8542
Elektronische ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-021-03747-y

Weitere Artikel der Ausgabe 10/2021

The Journal of Supercomputing 10/2021 Zur Ausgabe