{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T12:14:02Z","timestamp":1784290442878,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001410","name":"Human Resource Development Group","doi-asserted-by":"publisher","award":["09\/1032(0022)\/2020-EMR-I"],"award-info":[{"award-number":["09\/1032(0022)\/2020-EMR-I"]}],"id":[{"id":"10.13039\/501100001410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-023-02274-2","type":"journal-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T13:01:46Z","timestamp":1697893306000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Lattice-Based Single-Share Secret Sharing Scheme"],"prefix":"10.1007","volume":"4","author":[{"given":"Ramakant","family":"Kumar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6863-6123","authenticated-orcid":false,"given":"Sahadeo","family":"Padhye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"2274_CR1","doi-asserted-by":"crossref","unstructured":"Chunying W, Shundong L, Yiying Z. Key management scheme based on secret sharing for wireless sensor network. In: Fourth International Conference on Emerging Intelligent Data and Web Technologies (EIDWT); 2013. p. 574\u20138.","DOI":"10.1109\/EIDWT.2013.103"},{"key":"2274_CR2","unstructured":"Attasena V, Harbi N, Darmont J, et al. Sharing-based privacy and availability of cloud data warehouses. In: 9\u00e8mes journ\u00e9es francophones sur les Entrep\u00f4ts de Donn\u00e9es et l\u2019Analyse en ligne; 2006. p. 17\u201332."},{"key":"2274_CR3","doi-asserted-by":"crossref","unstructured":"Schoenmakers B. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Advances in CryptologyCRYPTO99, Springer; 1999. p. 148\u201364.","DOI":"10.1007\/3-540-48405-1_10"},{"key":"2274_CR4","doi-asserted-by":"crossref","unstructured":"Stadler M. Publicly verifiable secret sharing. In: Advances in Cryptology EUROCRYPT 96, ser. Lecture Notes in Computer Science, vol. 1070; 1996. p. 190\u20139.","DOI":"10.1007\/3-540-68339-9_17"},{"key":"2274_CR5","doi-asserted-by":"crossref","unstructured":"Cramer R, Damgard I, Maurer U. General secure multi-party computation from any linear secret sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000, LNCS, vol. 1807; 2000. p. 316\u201334.","DOI":"10.1007\/3-540-45539-6_22"},{"issue":"11","key":"2274_CR6","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A. How to share a secret. Commun ACM. 1979;22(11):612\u20133.","journal-title":"Commun ACM"},{"key":"2274_CR7","doi-asserted-by":"crossref","unstructured":"Blakley GR. Safeguarding Cryptographic Keys. In: Proceedings of the 1979 AFIPS National Computer Conference, vol. 48; 1979. p. 313\u20137.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"2274_CR8","doi-asserted-by":"crossref","unstructured":"Shor PW. Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, ser. SFCS \u201994. Washington, DC, USA: IEEE Computer Society; 1994. p. 124\u201334.","DOI":"10.1109\/SFCS.1994.365700"},{"key":"2274_CR9","doi-asserted-by":"crossref","unstructured":"Mignotte M. How to share a secret? In: Beth, T. (ed.) Cryptography - EUROCRYPT 1982, LNCS, vol. 149; 1982. p. 371\u20135.","DOI":"10.1007\/3-540-39466-4_27"},{"issue":"2","key":"2274_CR10","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"29","author":"C Asmuth","year":"1983","unstructured":"Asmuth C, Bloom J. A modular approach to key safeguarding. IEEE Trans Inf Theory. 1983;29(2):208\u201310.","journal-title":"IEEE Trans Inf Theory"},{"key":"2274_CR11","doi-asserted-by":"crossref","unstructured":"Chor B, Goldwasser S, Micali S, Awerbuch B. Verifiable secret sharing and achieving simultaneity in the presence of faults. In: Proceeding of 26th Annual Symposium on Foundations of Computer Science; 1985. p. 383\u201395.","DOI":"10.1109\/SFCS.1985.64"},{"key":"2274_CR12","doi-asserted-by":"crossref","unstructured":"Benaloh JC. Secret sharing homomorphisms: keeping shares of a secret secret. In: Proceedings on Advances in Cryptology- CRYPTO86; 1987. p. 251\u201360.","DOI":"10.1007\/3-540-47721-7_19"},{"key":"2274_CR13","doi-asserted-by":"crossref","unstructured":"Feldman P. A practical scheme for non-interactive verifiable secret sharing, SFCS \u201987: Proceedings of the 28th Annual Symposium on Foundations of Computer Science; 1987. p. 427\u201338.","DOI":"10.1109\/SFCS.1987.4"},{"issue":"8","key":"2274_CR14","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1093\/comjnl\/42.8.638","volume":"42","author":"K Martin","year":"1999","unstructured":"Martin K, Safavi-Naini R, Wang H. Bounds and techniques for efficient redistribution of secret shares to new access structures. Comput J. 1999;42(8):638\u201349.","journal-title":"Comput J"},{"issue":"2","key":"2274_CR15","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1109\/TIT.2004.840857","volume":"51","author":"SG Barwick","year":"2005","unstructured":"Barwick SG, Jackson WA, Martin K. Updating the parameters of a threshold scheme by minimal broadcast. IEEE Trans Inf Theory. 2005;51(2):620\u201333.","journal-title":"IEEE Trans Inf Theory"},{"key":"2274_CR16","doi-asserted-by":"crossref","unstructured":"Blundo C, Santis AD, DiCrescenzo G, Gaggia AG, Vaccaro U. Multi-secret sharing schemes. In: Advances in CryptologyCRYPTO94, Springer; 1994. p. 150\u201363.","DOI":"10.1007\/3-540-48658-5_17"},{"issue":"19","key":"2274_CR17","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1049\/el:19941076","volume":"30","author":"J He","year":"1994","unstructured":"He J, Dawson E. Multistage secret sharing based on one-way function. Electron Lett. 1994;30(19):1591\u20132.","journal-title":"Electron Lett"},{"issue":"6","key":"2274_CR18","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1007\/BF02831842","volume":"11","author":"L Pang","year":"2006","unstructured":"Pang L, Li H, Wang Y. An efficient and secure multi-secret sharing scheme with general access structures. Wuhan Univ J Nat Sci. 2006;11(6):1649\u201352.","journal-title":"Wuhan Univ J Nat Sci"},{"issue":"1","key":"2274_CR19","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1145\/1044552.1044557","volume":"39","author":"TY Chang","year":"2005","unstructured":"Chang TY, Hwang MS, Yang WP. A new multi-stage secret sharing scheme using one-way function. SIGOPS Oper Syst Rev. 2005;39(1):48\u201355.","journal-title":"SIGOPS Oper Syst Rev"},{"issue":"9","key":"2274_CR20","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.aml.2010.04.024","volume":"23","author":"A Das","year":"2010","unstructured":"Das A, Adhikari A. An efficient multi-use multi-secret sharing scheme based on hash function. Appl Math Lett. 2010;23(9):993\u20136.","journal-title":"Appl Math Lett"},{"issue":"3","key":"2274_CR21","first-page":"246","volume":"40","author":"TY Chang","year":"2011","unstructured":"Chang TY, Hwang MS, Yang WP. An improved multi-stage secret sharing scheme based on the factorization problem. Inf Technol Control. 2011;40(3):246\u201351.","journal-title":"Inf Technol Control"},{"key":"2274_CR22","unstructured":"Georgescu A. A LWE-based secret sharing scheme, IJCA Special Issue on Network Security and Cryptography, vol. NSC(3); 2011. p. 27\u20139."},{"key":"2274_CR23","doi-asserted-by":"crossref","unstructured":"Bansarkhani RE, Meziani M. An efficient lattice-based secret sharing construction. In: Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambient Intelligent Ecosystems, ser. Lecture Notes in Computer Science. I. Askoxylakis, vol. 7322; 2012. p. 160\u20138.","DOI":"10.1007\/978-3-642-30955-7_14"},{"key":"2274_CR24","doi-asserted-by":"crossref","unstructured":"Ajtai M. Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, ser. STOC \u201996. New York, NY, USA: ACM; 1996. p. 99\u2013108.","DOI":"10.1145\/237814.237838"},{"key":"2274_CR25","doi-asserted-by":"crossref","unstructured":"Khorasgani HA, Asaad S, Eghlidos T, Aref M. A lattice-based threshold secret sharing scheme. In: 11th International ISC Conference on Information Security and Cryptology; 2014. p. 173\u20139.","DOI":"10.1109\/ISCISC.2014.6994043"},{"issue":"1","key":"2274_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai L. On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica. 1986;6(1):1\u201313.","journal-title":"Combinatorica"},{"issue":"3","key":"2274_CR27","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1007\/s11277-016-3539-7","volume":"91","author":"MH Dehkordi","year":"2016","unstructured":"Dehkordi MH, Ghasemi R. A lightweight public verifiable multi secret sharing scheme using short integer solution. Wirel Pers Commun. 2016;91(3):1459\u201369.","journal-title":"Wirel Pers Commun"},{"issue":"1","key":"2274_CR28","first-page":"2","volume":"14","author":"H Pilaram","year":"2017","unstructured":"Pilaram H, Eghlidos T. An efficient lattice-based multi-stage secret sharing scheme. IEEE Trans Dependable Secur Comput. 2017;14(1):2\u20138.","journal-title":"IEEE Trans Dependable Secur Comput"},{"key":"2274_CR29","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.24200\/sci.2017.4126","volume":"24","author":"H Pilaram","year":"2017","unstructured":"Pilaram H, Eghlidos T. A lattice-based changeable threshold multi-secret sharing scheme and its application to threshold cryptography. Scientia Iranica. 2017;24:1448\u201357.","journal-title":"Scientia Iranica"},{"issue":"5","key":"2274_CR30","doi-asserted-by":"publisher","first-page":"4441","DOI":"10.1109\/TDSC.2022.3209011","volume":"20","author":"Z Yang","year":"2023","unstructured":"Yang Z, He D, Qu L, Xu J. On the security of a lattice-based multi-stage secret sharing scheme. IEEE Trans Dependable Secure Comput. 2023;20(5):4441\u20132.","journal-title":"IEEE Trans Dependable Secure Comput."},{"key":"2274_CR31","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.ins.2018.11.004","volume":"501","author":"B Rajabi","year":"2019","unstructured":"Rajabi B, Eslami Z. A verifiable threshold secret sharing scheme based on lattices. Inf Sci. 2019;501:655\u201361.","journal-title":"Inf Sci"},{"key":"2274_CR32","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Lyubashevsky V. Practical non-interactive publicly verifiable secret sharing with thousands of parties. Cryptology ePrint Archive: Report 2021\/1397; 2021.","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"2274_CR33","doi-asserted-by":"publisher","first-page":"22175","DOI":"10.1007\/s11042-022-13347-4","volume":"82","author":"N Kiamari","year":"2023","unstructured":"Kiamari N, Hadian M, Mashhadi S. Non-interactive verifiable LWE-based multi secret sharing scheme. Multimed Tools Appl. 2023;82:22175\u201387.","journal-title":"Multimed Tools Appl."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-02274-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-023-02274-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-02274-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T15:39:22Z","timestamp":1730389162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-023-02274-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":33,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,11]]}},"alternative-id":["2274"],"URL":"https:\/\/doi.org\/10.1007\/s42979-023-02274-2","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"14 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"811"}}