Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Improved resilience of secret sharing scheme with augmented multifarious features

  • Original Research
  • Published:
International Journal of Information Technology Aims and scope Submit manuscript

Abstract

The requirement of greater flexibility and additional functionality in conventional secret sharing schemes is posed in many practical applications. To meet the flexibility requirements of applications, an extension of a secret sharing scheme with multiple features is proposed. The matrix projection property assorted with Lagrange’s interpolation, matrix subtraction, asymmetric key exchange algorithm, Pythagorean triples, AND-OR circuit structure design, and Least Significant Bit technique to implement the proposed scheme. The scheme is multifarious in a way that it supports different features such as verifiability of reconstructed secret, cheater/s identification, periodical renewal of shares, the flexibility of deciding access structure, and embedding of shares for enhanced security. Further flexibility is provided to the user in the selection of one, all, or any number of required features to support the applications. The scheme is applicable for sharing secret data of various forms like text, number, monochrome and multi-chrome images. The implementation of the proposed scheme is critically analysed with the help of experimentation. It is further compared with existing techniques and the results show that the proposed scheme satisfies relatively better accuracy, improved security, lesser time complexity, and lesser storage requirements while providing multiple features for secret sharing.

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
EUR 32.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 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
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Availability of data and material (data transparency)

Not applicable.

Code availability (software application or custom code)

If required can be provided

Abbreviations

SSS:

Secret sharing scheme

GAS:

General access structure

VSS:

Verifiable secret sharing

PSS:

Proactive secret sharing

LSB:

Least significant bit

SSIM:

Similarity Index

DSSIM:

Dissimilarity Index

References

  1. Beimel A (2011) Secret-sharing schemes: a survey. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6639 LNCS, pp. 11–46. https://doi.org/10.1007/978-3-642-20901-7_2.

  2. Abhilash MH, Amberker BB (2022) Efficient group signature scheme using lattices. Int J Inf Tecnol. https://doi.org/10.1007/s41870-022-00891-3

    Article  Google Scholar 

  3. Slinko A (2015) Algebra for applications: cryptography, secret sharing, error-correcting, fingerprinting, compression.

  4. Li T, Rao B (2019) Algebraic preliminaries. Prog Nonlinear Differ Equ Appl 94:19–30

    Google Scholar 

  5. Guo C, Chang C (2013) A construction for secret sharing scheme with general access structure. J Inform Hid Multimed Signal Process Ubiquit Int 4(1):1–8

    Google Scholar 

  6. Komargodski I, Naor M, Yogev E (2018) How to share a secret, infinitely. IEEE Trans Inf Theory 64(6):4179–4190. https://doi.org/10.1109/TIT.2017.2779121

    Article  MathSciNet  MATH  Google Scholar 

  7. Benaloh J, Leichter J (1990) Generalized secret sharing and monotone functions. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 403 LNCS, pp 27–35. https://doi.org/10.1007/0-387-34799-2_3

  8. Li B (2006) A strong ramp secret sharing scheme using matrix projection. In: Proceedings—WoWMoM 2006: 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks, vol. 2006, pp 652–656. https://doi.org/10.1109/WOWMOM.2006.17

  9. Chou YC, Lin CH, Li PC, Li YC (2008) A (2,3) threshold secret sharing scheme using Sudoku. In: Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010, no. 2008, pp 43–46. https://doi.org/10.1109/IIHMSP.2010.18

  10. Benaloh J (1986) Secret sharing homomorphisms: keeping shares of a secret sharing. Adv Cryptol-CRYPTO, pp. 251–260

  11. Feldman P (1987) A practical scheme for non-interactive verifiable secret sharing paul feldman massachusetts institute of technology. Network: 427–437

  12. Nikov V, Nikova S (2006) On a relation between verifiable secret sharing schemes and a class of error-correct ing codes. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3969 LNCS, pp 275–290. https://doi.org/10.1007/11779360_22

  13. Rabin T, Ben-Or M (1989) Verifiable secret sharing and multiparty protocols with honest majority, pp. 73–85. https://doi.org/10.1145/73007.73014

  14. McEliece RJ, Sarwate DV (1981) On sharing secrets and reed-solomon codes. Commun ACM 24(9):583–584. https://doi.org/10.1145/358746.358762

    Article  MathSciNet  Google Scholar 

  15. Rose AA, Thampi SM (2015) A secure verifiable scheme for secret image sharing. Proc Comput Sci 58:140–150. https://doi.org/10.1016/j.procs.2015.08.042

    Article  Google Scholar 

  16. Sethi PC, Sahu N, Behera PK (2021) Group security using ECC. Int J Inf Tecnol. https://doi.org/10.1007/s41870-021-00613-1

    Article  Google Scholar 

  17. Basu S, Tomescu A, Abraham I, Malkhi D, Reiter MK, Gün Sirer E (2019) Efficient verifiable secret sharing with share recovery in BFT protocols. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

  18. Tompa M, Woll H (1987) How to share a secret with cheaters. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 263 LNCS, pp 261–265. https://doi.org/10.1007/3-540-47721-7_20.

  19. Lin PY, Chen YH, Hsu MC, Juang FM (2013) Secret sharing mechanism with cheater detection. In: 2013 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2013, pp 2–5. https://doi.org/10.1109/APSIPA.2013.6694288

  20. Wu TC, Wu TS (1995) Cheating detection and cheater identification in secret sharing schemes. IEE Proc Comput Digit Tech 142(5):367–369. https://doi.org/10.1049/ip-cdt:19952015

    Article  Google Scholar 

  21. Kolambe R (2012) Cheater detection and cheating identification based on shamir scheme. In: MPGI National Multi Conference 2012 (MPGINMC-2012), Proceedings published by International Journal of Computer Applications (IJCA), vol. 2012, pp 7–8

  22. Kaya K, Selçuk AA (2008) Robust threshold schemes based on the Chinese remainder theorem. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5023 LNCS, pp. 94–108. https://doi.org/10.1007/978-3-540-68164-9_7

  23. Huang P-C, Chang C-C, Li Y-H (2022) Efficient (k, n)-threshold secret sharing method with cheater prevention for QR code application. J Internet Technol 23(1):155–163

    Google Scholar 

  24. Liu YX, Sun QD, Yang CN (2018) (k, n) secret image sharing scheme capable of cheating detection. Eurasip J Wirel Commun Netw 2018(1):4–9. https://doi.org/10.1186/s13638-018-1084-7

    Article  Google Scholar 

  25. Ma Z, Ma Y, Huang X, Zhang M, Liu Y (2020) Applying cheating identifiable secret sharing scheme in multimedia security. Eurasip J Image Video Process. https://doi.org/10.1186/s13640-020-00529-z

    Article  Google Scholar 

  26. Meng K, Miao F, Ning Y et al (2021) A proactive secret sharing scheme based on Chinese remainder theorem. Front Comput Sci 15:152801. https://doi.org/10.1007/s11704-019-9123-z

    Article  Google Scholar 

  27. Cachin C, Kursawe K, Lysyanskaya A (2002) Asynchronous verifiable secret sharing and proactive cryptosystems. In: Proceedings of the ACM Conference on Computer and Communications Security, pp. 88–97. https://doi.org/10.1145/586123.586124.

  28. Zhou L, Schneider FB, Renesse RVAN (2005) APSS: proactive secret sharing in asynchronous systems 8(3): 259–286

  29. Bai L, Zou XK (2009) A proactive secret sharing scheme in matrix projection method. Int J Secur Netw 4(4):201–209. https://doi.org/10.1504/IJSN.2009.028667

    Article  Google Scholar 

  30. Hyun S, Shin S, Yoo K (2013) A proactive secret image sharing scheme over GF(2 8). J Korea Multimed Soc 16(5):577–590. https://doi.org/10.9717/kmms.2013.16.5.577

    Article  Google Scholar 

  31. Guo C, Zhang H, Fu Z, Feng B, Li M (2018) A novel proactive secret image sharing scheme based on LISS. Multimed Tools Appl 77(15):19569–19590. https://doi.org/10.1007/s11042-017-5412-4

    Article  Google Scholar 

  32. Ito M, Saito A, Nishizeki T (1989) Secret sharing scheme realizing general access structure. Electron Commun Jpn (Part III Fund Electron Sci) 72(9):56–64. https://doi.org/10.1002/ecjc.4430720906

    Article  MathSciNet  Google Scholar 

  33. Yuan J, Yang J, Wang C, Jia X, Fang-Wei F, Guoai X (2022) A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations. Inform Sci 592:36–49. https://doi.org/10.1016/j.ins.2022.01.053 (ISSN 0020-0255)

    Article  Google Scholar 

  34. Pang LJ, Li HX, Wang YM (2006) A secure and efficient secret sharing scheme with general access structures. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4223 LNAI, pp. 646–649. https://doi.org/10.1007/11881599_77

  35. Ye SZ, Yao GX, Guan QL (2009) A multiple secrets sharing scheme with general access structure. In: 2009 International Symposium on Intelligent Ubiquitous Computing and Education, IUCE 2009, pp. 461–464. https://doi.org/10.1109/IUCE.2009.65

  36. Patil S, Deshmukh P (2014) General access structure secret sharing in matrix projection. Int J Comput Appl 107(13):6–9. https://doi.org/10.5120/18809-0369

    Article  Google Scholar 

  37. Yan X, Lu Y, Liu L, Ma D (2018) Image secret sharing construction for general access structure with meaningful share. Int J Digit Crime Foren 10(3):66–77. https://doi.org/10.4018/IJDCF.2018070106

    Article  Google Scholar 

  38. Gutub A, Al-Ghamdi M (2020) Hiding shares by multimedia image steganography for optimized counting-based secret sharing. Multimed Tools Appl 79:7951–7985. https://doi.org/10.1007/s11042-019-08427-x

    Article  Google Scholar 

  39. Patil S, Deshmukh P (2014) Enhancing security in secret sharing with embedding of shares in cover images. Int J Adv Res Comput Commun Eng 3(5):6685–6688

    Google Scholar 

  40. http://sipi.usc.edu/services/database/Database.html

  41. Thien CC, Lin JC (2002) Secret image sharing. Comput Graph (Pergam) 26(5):765–770. https://doi.org/10.1016/S0097-8493(02)00131-0

    Article  Google Scholar 

Download references

Funding

Not applicable.

Author information

Authors and Affiliations

  1. Pimpri Chinchwad College of Engineering, Sector-26, Pradhikaran, Nigdi, Near Akurdi Railway Station, Pune, 411 044, India

    Sonali Patil, Sheetal Bhandari, Sudeep Thepade & Roshani Raut

  2. AISSMS College of Engineering, Kennedy Road, Near RTO Office Sangamvadi, Shivajinagar, Pune, Maharashtra, 411001, India

    Shashikant V. Athawale

Authors
  1. Sonali Patil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sheetal Bhandari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sudeep Thepade
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Roshani Raut
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shashikant V. Athawale
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sonali Patil.

Ethics declarations

Conflict of interest (include appropriate disclosures)

Not applicable

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Patil, S., Bhandari, S., Thepade, S. et al. Improved resilience of secret sharing scheme with augmented multifarious features. Int. j. inf. tecnol. 14, 2633–2644 (2022). https://doi.org/10.1007/s41870-022-00941-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41870-022-00941-w

Keywords

Search

Navigation