Skip to main content
SpringerLink
Log in

Non-interactive verifiable LWE-based multi secret sharing scheme

  • 1187: Recent Advances in Multimedia Information Security: Cryptography and Steganography
  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

The learning with errors (LWE) problem has emerged as the most popular hard problem for constructing lattice based cryptographic solutions. In this paper, we propose a verifiable multi secret sharing scheme based on LWE problem and prove the security of our scheme in the standard model. It is a threshold scheme and every t participants (t ≤ n) can recover multiple secrets, in one stage. Moreover, it has a non-interactive verification and no extra communication is needed among participants and the dealer in the verification phase. In short, it is the first LWE based threshold multi secret sharing scheme that has formal security in the standard model.

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

Similar content being viewed by others

References

  1. Amini Khorasgani H, Asaad S, Eghlidos T, Aref MR (2014) A lattice-based threshold secret sharing scheme. In: 11th Int. ISC Conf. on Inf. Security Cryptology. IEEE, pp 173–179

  2. Amini Khorasgani H, Asaad S, Pilaram H, Eghlidos T, Aref MR (2016) On the design and security of a lattice-based threshold secret sharing scheme. The ISC intl journal of information security pp 25–38

  3. Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: Proceedings of the twenty-eighth annual ACM symposium on theory of computing. ACM, New York, pp 99–108

  4. Biggs N (2002) Discrete mathematics, 2nd Edition Oxford University Press

  5. Bernstein D, Buchmann J, Dahmen E (2009) Post-Quantum cryptography springer

  6. Blakley GR (1979) Safeguarding cryptographic keys. In: Proceedings AFIPS 1979 national computer conference, pp 313–317

  7. Blundo C, De Santis A, Di Crescenzo G, Gaggia AG, Vaccaro U (1994) Multi-secret sharing schemes, advances in cryptology CRYPTO94, Springer, pp 150–163

  8. Chen D, Lu W, Xing W, Wang NN (2019) An efficient verifiable threshold Multi-secret sharing scheme with different stages. IEEE Access 7:107104–107110

    Article  Google Scholar 

  9. Chor B, Goldwasser Sh, Micali S, Awerbuch B (1985) Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). FOCS. pp 383–395

  10. Dehkordi MHS, Mashhadi H, Oraei A (2018) Proactive multi stage secret sharing scheme for any given access structure. Wirel Pers Commun 104:491–503

    Article  Google Scholar 

  11. El Bansarkhani R, Meziani M (2012) An efficient lattice-based secret sharing construction, information security theory and practice. Security, privacy and trust in computing systems and ambient intelligent ecosystems, ser. Lecture notes in computer science, Springer. vol 7322. pp 160–168

  12. Georgescu A (2011) A lwe-based secret sharing scheme. IJCA special issue on network security and cryptography NSC(3):27–29

    Google Scholar 

  13. Goldreich O, Goldwasser S, Halevi S (1996) Collision-free hashing from lattice problems

  14. Goldreich O, Goldwasser S, Halevi S (1997) Public-key cryptosystems from lattice reduction problems. Advances in Cryptology CRYPTO 97, Lecture Notes in Computer Science, Springer vol 1294 pp 112–131

  15. Gutub A, Al-Juaid N, Khan E (2019) Counting-based secret sharing technique for multimedia applications. Multimed Tools Appl 78:5591–5619

    Article  Google Scholar 

  16. Hadian M, Ghasemi R (2016) A lightweight public verifiable multi secret sharing scheme using short integer solution. Wirel Pers Commun 91:1459–1469

    Article  Google Scholar 

  17. Hoffstein J, Pipher J, Silverman J (1998) Ntru: a ring-based public key cryptosystem. In: Buhler J (ed) Algorithmic number theory. Lecture notes in computer science, vol 1423. Springer Berlin Heidelberg, pp 267–288

  18. Karimani S, Naghdabadi Z, Eghlidos T, Aref MR (2019) An LWE-based verifiable threshold secret sharing scheme. Mat Vopr Kriptogr 10(2):97–106

    Article  MathSciNet  MATH  Google Scholar 

  19. Knospe H (2019) A course in cryptography, american mathematical society american mathematical society

  20. Li Ch, Tian Y, Chen X, Li J (2021) An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems. Inf Sci 546:253–264

    Article  MathSciNet  MATH  Google Scholar 

  21. Li Y, Ge G (2019) Cryptographic and parallel hash function based on cross coupled map lattices suitable for multimedia communication security. Multimed Tools Appl 78:17973–17994

    Article  MathSciNet  Google Scholar 

  22. Lipshutz S, Lipson M (2017) Schaum’s outlines linear algebra. McGraw-Hill Eduction, Sixth Edition

    Google Scholar 

  23. Liu W, Liu Z, Nguyen Kh, Yang G, Yu Y (2020) A lattice-based key-insulated and privacy-preserving signature scheme with publicly derived public key. European symposium on research in computer security, ESORICS 2020, pp 357–377

  24. Mashhadi S (2020) A CSA-secure multi-secret sharing scheme in the standard model. J Appl Secur Res 15:84–95

    Article  Google Scholar 

  25. Mashhadi S (2015) Computationally secure multiple secret sharing: models, schemes, and formal security analysis. ISC Int J Inf Secur 7:91–99

    Google Scholar 

  26. Mashhadi S, Dehkordi MH, Kiamari N (2017) Provably secure verifiable multi-stage secret sharing scheme based on monotone span program. IET Inf Secur 11(6):326–331

    Article  Google Scholar 

  27. McEliece R. J. (1978) A public-key cryptosystem based on algebraic coding theory. DSN Progress Report 42(44):114–116

    Google Scholar 

  28. Mesnager S, Sinak A, Yayla O (2020) Threshold-based post-quantum secure verifiable multi-secret sharing for distributed storage blockchain. Mathematics 8:22189. https://doi.org/10.3390/math8122218

    Article  Google Scholar 

  29. Miao F, Wang L, Ji Y, Xiong Y (2017) GOMSS: a simple group oriented (t, m, n) multi-secret sharing scheme. Chin J Electron 26(3):557–563

    Article  Google Scholar 

  30. Mishra A, Gupta A (2018) Multi secret sharing scheme using iterative method. J Inf Optim Sci 39:631–641

    MathSciNet  Google Scholar 

  31. Pilaram H, Eghlidos T (2015) An efficient lattice based multi-stage secret sharing scheme. IEEE Trans Dependable Secur Comput 14:2–8

    Google Scholar 

  32. Rajabi B, Eslami Z (2019) A verifiable threshold secret sharing scheme based on lattices. Inf Sci 501:655–661

    Article  MathSciNet  MATH  Google Scholar 

  33. Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM 56(6):34–40

    Article  MathSciNet  MATH  Google Scholar 

  34. Sehrawat VS, Yeo FY, Desmedt Y Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification. Thorical Computer Science, 2021. https://doi.org/10.1016/j.tcs.2021.07.022

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

    Article  MathSciNet  MATH  Google Scholar 

  36. Sheikhi M, Bahramian M, Doche C (2019) Threshold verifiable multi-secret sharing based on elliptic curves and Chinese remainder theorem. IET Inf Secur 13:278–284

    Article  Google Scholar 

  37. Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th annual symposium on foundations of computer science, Washington, DC, USA, pp 124–134

  38. Wu F, Yao W, Zhang X, Zheng Z (2019) Lattice based signature with outsourced revocation for multimedia social networks in cloud computing. Multimed Tools Appl 78:3511–3528

    Article  Google Scholar 

  39. Xu Z, He D, Vijayakumar P, Kwang K, Choo R, Li L (2020) Efficient NTRU lattice-based certificateless signature scheme for medical cyber-physical systems. J Med Syst 44(92):. https://doi.org/10.1007/s10916-020-1527-7

  40. Yang Y, Zheng X, Chang V, Ye Sh, Tang Ch (2018) Lattice assumption based fuzzy information retrieval scheme support multi-user for secure multimedia cloud. Multimed Tools Appl 77:9927–9941

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cryptography and Data Security Laboratory, School of Mathematics, Iran University of Science & Technology, Narmak, Tehran, 16846 13114, Iran

    Niloofar Kiamari, Massoud Hadian & Samaneh Mashhadi

Authors
  1. Niloofar Kiamari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Massoud Hadian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Samaneh Mashhadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Samaneh Mashhadi.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kiamari, N., Hadian, M. & Mashhadi, S. Non-interactive verifiable LWE-based multi secret sharing scheme. Multimed Tools Appl 82, 22175–22187 (2023). https://doi.org/10.1007/s11042-022-13347-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-022-13347-4

Keywords

Search

Navigation