{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T12:27:21Z","timestamp":1745324841579,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T00:00:00Z","timestamp":1656806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T00:00:00Z","timestamp":1656806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10623-022-01082-8","type":"journal-article","created":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T15:02:38Z","timestamp":1656860558000},"page":"1761-1782","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A non-interactive (t,\u00a0n)-publicly verifiable multi-secret sharing scheme"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9191-1376","authenticated-orcid":false,"given":"Samaneh","family":"Mashahdi","sequence":"first","affiliation":[]},{"given":"Bagher","family":"Bagherpour","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Zaghian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,3]]},"reference":[{"key":"1082_CR1","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1049\/iet-ifs.2018.5167","volume":"13","author":"B Bagherpour","year":"2019","unstructured":"Bagherpour B., Zaghian A., Sajadieh M.: Sigma protocols for faster proof of simultaneous homomorphism relations. IET Inf. Secur. 13, 508\u2013814 (2019).","journal-title":"IET Inf. Secur."},{"key":"1082_CR2","first-page":"313","volume":"48","author":"GR Blakley","year":"1979","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. AFIPS Nat1 Comput. Conf. 48, 313\u2013317 (1979).","journal-title":"AFIPS Nat1 Comput. Conf."},{"key":"1082_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BFb0027925","volume-title":"Secret Sharing with Reusable Polynomials, Information Security and Privacy","author":"L Chen","year":"1997","unstructured":"Chen L., Gollmann D., Mitchell C., Wild P.: Secret Sharing with Reusable Polynomials, Information Security and Privacy, pp. 183\u2013193. Springer, Berlin (1997)."},{"key":"1082_CR4","first-page":"383","volume-title":"Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults","author":"B Chor","year":"1985","unstructured":"Chor B., Goldwasser S., Micali S., Awerbuch B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults, pp. 383\u2013395. FOCS\u2019 85 IEEE Computer Society, Washington (1985)."},{"key":"1082_CR5","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. 23, 993\u2013996 (2010).","journal-title":"Appl. Math. Lett."},{"key":"1082_CR6","doi-asserted-by":"publisher","first-page":"2262","DOI":"10.1016\/j.ins.2007.11.031","volume":"178","author":"MH Dehkordi","year":"2008","unstructured":"Dehkordi M.H., Mashhadi S.: New efficient and practical verifiable multi-secret sharing schemes. Inf. Sci. 178, 2262\u20132274 (2008).","journal-title":"Inf. Sci."},{"key":"1082_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.csi.2007.08.004","volume":"30","author":"MH Dehkordi","year":"2008","unstructured":"Dehkordi M.H., Mashhadi S.: An efficient threshold verifiable multi-secret sharing. Comput. Stand. Interfaces 30, 187\u2013190 (2008).","journal-title":"Comput. Stand. Interfaces"},{"key":"1082_CR8","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s11277-018-6032-7","volume":"104","author":"MH Dehkordi","year":"2019","unstructured":"Dehkordi M.H., Mashhadi S., Oraei H.: A proactive multi stage secret sharing scheme for any given access structure. Wirel. Pers. Commun. 104, 491\u2013503 (2019).","journal-title":"Wirel. Pers. Commun."},{"key":"1082_CR9","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.comcom.2007.11.014","volume":"31","author":"MH Dehkordi","year":"2008","unstructured":"Dehkordi M.H., Mashhadi S.: Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves. Comput. Commun. 31, 1777\u20131784 (2008).","journal-title":"Comput. Commun."},{"key":"1082_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1049\/iet-ifs.2018.5306","volume":"13","author":"MH Dehkordi","year":"2019","unstructured":"Dehkordi M.H., Oraei H.: How to construct a verifiable multi-secret sharing scheme based on graded encoding schemes. IET Inf. Secur. 13, 343\u2013351 (2019).","journal-title":"IET Inf. Secur."},{"key":"1082_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.optcom.2016.10.065","volume":"387","author":"X Deng","year":"2017","unstructured":"Deng X., Wen W., Shi Z.: Threshold multi-secret sharing scheme based on phase-shifting interferometry. Opt. Commun. 387, 409\u2013414 (2017).","journal-title":"Opt. Commun."},{"key":"1082_CR12","doi-asserted-by":"publisher","first-page":"2889","DOI":"10.1016\/j.ins.2010.04.015","volume":"180","author":"Z Eslami","year":"2010","unstructured":"Eslami Z., Ahmadabadi J.Z.: A verifiable multi-secret sharing scheme based on cellular automata. Inf. Sci. 180, 2889\u20132894 (2010).","journal-title":"Inf. Sci."},{"key":"1082_CR13","first-page":"427","volume-title":"A Practical Scheme for Non-interactive Verifiable Secret Sharing","author":"P Feldman","year":"1987","unstructured":"Feldman P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing, pp. 427\u2013437. FOCS\u2019 87 IEEE computer society, Washington (1987)."},{"key":"1082_CR14","doi-asserted-by":"crossref","unstructured":"Fiat A., Shamir A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems, Advances in Cryptology-CRYPTO\u201986. Lecture Notes in Compute Science, vol. 263, pp. 186\u2013194 (1986).","DOI":"10.1007\/3-540-47721-7_12"},{"key":"1082_CR15","doi-asserted-by":"publisher","first-page":"902462","DOI":"10.1155\/2013\/902462","volume":"9","author":"Y Gan","year":"2013","unstructured":"Gan Y., Wang L., Pan P., Yang Y.: publicly verifiable secret sharing scheme with provable security against chosen secret attacks. Int. J. Distrib. Sens. Netw. 9, 902462 (2013).","journal-title":"Int. J. Distrib. Sens. Netw."},{"key":"1082_CR16","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1007\/s11277-016-3862-z","volume":"95","author":"L Harn","year":"2017","unstructured":"Harn L., Hsu C.F.: $$(t, n)$$ Multi-secret sharing scheme based on bivariate polynomial. Wirel. Pers. Commun. 95, 1495\u20131504 (2017).","journal-title":"Wirel. Pers. Commun."},{"key":"1082_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1049\/ip-cdt:19951874","volume":"142","author":"L Harn","year":"1995","unstructured":"Harn L.: Efficient sharing (broadcasting) of multiple secrets. IEE Proc. Comput. Digit. Tech. 142, 237\u2013240 (1995).","journal-title":"IEE Proc. Comput. Digit. Tech."},{"key":"1082_CR18","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1016\/j.ins.2010.04.016","volume":"180","author":"L Harn","year":"2010","unstructured":"Harn L., Lin C.: Strong $$(n, t, n)$$ verifiable secret sharing scheme. Inf. Sci. 180, 3059\u20133064 (2010).","journal-title":"Inf. Sci."},{"key":"1082_CR19","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. 30, 1591\u20131592 (1994).","journal-title":"Electron. Lett."},{"key":"1082_CR20","doi-asserted-by":"crossref","unstructured":"Heidarvand S., Villar J.L.: Public verifiability of pairings in secret sharing schemes, SAC, pp. 294\u2013308 (2008).","DOI":"10.1007\/978-3-642-04159-4_19"},{"key":"1082_CR21","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.tcs.2012.05.006","volume":"445","author":"C Hu","year":"2012","unstructured":"Hu C., Liao X., Cheng X.: Verifiable multi-secret sharing scheme based on LFSR sequence. Theor. Comput. Sci. 445, 52\u201362 (2012).","journal-title":"Theor. Comput. Sci."},{"key":"1082_CR22","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1016\/S0140-3664(98)00191-1","volume":"21","author":"RJ Hwang","year":"1998","unstructured":"Hwang R.J., Chang C.C.: An on-line secret sharing scheme for multi-secrets. Comput. Commun. 21, 1170\u20131176 (1998).","journal-title":"Comput. Commun."},{"key":"1082_CR23","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ins.2018.09.024","volume":"473","author":"X Jia","year":"2019","unstructured":"Jia X., Wang D., Nie D., Luo X., Sun J.Z.: A new threshold changeable secret sharing scheme based on the Chinese Remainder Theorem. Inf. Sci. 473, 13\u201330 (2019).","journal-title":"Inf. Sci."},{"key":"1082_CR24","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s10623-014-9952-6","volume":"73","author":"MP Jhanwar","year":"2014","unstructured":"Jhanwar M.P., Venkateswarlu A., Safavi-Naini R.: Paillier-based publicly verifiable (non-interactive) secret sharing. Des. Codes Cryptogr. 73, 529\u2013546 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"1082_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jpdc.2019.04.003","volume":"130","author":"J Li","year":"2019","unstructured":"Li J., Wang X., Huang Z., Wang L., Xiang Y.: Multi-level multi-secret sharing scheme for decentralized e-voting in cloud computing. J. Parallel Distrib. Comput. 130, 91\u201397 (2019).","journal-title":"J. Parallel Distrib. Comput."},{"key":"1082_CR26","doi-asserted-by":"publisher","first-page":"70666","DOI":"10.1109\/ACCESS.2018.2880975","volume":"6","author":"C Lin","year":"2018","unstructured":"Lin C., Hu H., Chang C.C., Tang S.: A publicly verifiable multi-secret sharing scheme with outsourcing secret reconstruction. IEEE Access 6, 70666\u201370673 (2018).","journal-title":"IEEE Access"},{"key":"1082_CR27","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ins.2018.04.043","volume":"453","author":"Y Liu","year":"2018","unstructured":"Liu Y., Yang C., Wang Y., Zhu L., Ji W.: Cheating identifiable secret sharing scheme using symmetric bivariate polynomial. Inf. Sci. 453, 21\u201329 (2018).","journal-title":"Inf. Sci."},{"key":"1082_CR28","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ins.2016.10.040","volume":"378","author":"S Mashhadi","year":"2017","unstructured":"Mashhadi S.: Secure publicly verifiable and proactive secret sharing schemes with general access structure. Inf. Sci. 378, 99\u2013108 (2017).","journal-title":"Inf. Sci."},{"key":"1082_CR29","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ins.2014.08.046","volume":"294","author":"S Mashhadi","year":"2015","unstructured":"Mashhadi S., Dehkordi M.H.: Two verifiable multi secret sharing schemes based on non-homogeneous linear recursion and LFSR public key cryptosystem. Inf. Sci. 294, 31\u201340 (2015).","journal-title":"Inf. Sci."},{"key":"1082_CR30","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1049\/iet-ifs.2017.0111","volume":"11","author":"S Mashhadi","year":"2017","unstructured":"Mashhadi S., Dehkordi M.H., Kiamari N.: Provably secure verifiable multi-stage secret sharing scheme based on monotone span program. IET Inf. Secur. 11, 326\u2013331 (2017).","journal-title":"IET Inf. Secur."},{"key":"1082_CR31","doi-asserted-by":"crossref","unstructured":"Pedersen T.P.: Non-interactive and Information-Theoretic Secure Verifiable Secret Sharing. Advances in Cryptology-CRYPTO\u201991, pp. 129\u2013140 (1992).","DOI":"10.1007\/3-540-46766-1_9"},{"key":"1082_CR32","doi-asserted-by":"publisher","first-page":"6227","DOI":"10.1002\/sec.1768","volume":"9","author":"Q Peng","year":"2016","unstructured":"Peng Q., Tian Y.: Publicly verifiable secret sharing scheme and its application with almost optimal information rate. Secur. Commun. Netw. 9, 6227\u20136238 (2016).","journal-title":"Secur. Commun. Netw."},{"key":"1082_CR33","first-page":"1192","volume":"18","author":"Q Peng","year":"2016","unstructured":"Peng Q., Tian Y.: A publicly verifiable secret sharing scheme based on multilinear Diffie-Hellman assumption. Int. J. Netw. Secur. 18, 1192\u20131200 (2016).","journal-title":"Int. J. Netw. Secur."},{"key":"1082_CR34","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. 501, 655\u2013661 (2019).","journal-title":"Inf. Sci."},{"key":"1082_CR35","doi-asserted-by":"crossref","unstructured":"Schoenmakers B.: A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting, Advances in Cryptology-CRYPTO 99. Lecture Notes in Computer Science, pp. 148\u2013164 (1999).","DOI":"10.1007\/3-540-48405-1_10"},{"key":"1082_CR36","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 22, 612\u2013613 (1979).","journal-title":"Commun. ACM"},{"key":"1082_CR37","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ins.2014.03.025","volume":"278","author":"J Shao","year":"2014","unstructured":"Shao J.: Efficient verifiable multi-secret sharing scheme based on hash function. Inf. Sci. 278, 104\u2013109 (2014).","journal-title":"Inf. Sci."},{"key":"1082_CR38","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1049\/iet-ifs.2018.5174","volume":"13","author":"M Sheikhi-Garjan","year":"2019","unstructured":"Sheikhi-Garjan M., Bahramian M., Doche Ch.: Threshold verifiable multi-secret sharing based on elliptic curves and Chinese remainder theorem. IET Inf. Secur. 13, 278\u2013284 (2019).","journal-title":"IET Inf. Secur."},{"key":"1082_CR39","unstructured":"Shen J., Liu D., Sun X., Wei F., Xiang Y.: Efficient Cloud-Aided Verifiable Secret Sharing Scheme with Batch Verification for Smart Cities. Future Generation Computer Systems, In press (2018)."},{"key":"1082_CR40","doi-asserted-by":"crossref","unstructured":"Stadler M.: Publicly Verifiable Secret Sharing, Advances in Cryptology-EUROCRYPT 96. Lecture Notes in Computer Science, vol. 1070, pp. 190\u2013199. Springer, Berlin (1996).","DOI":"10.1007\/3-540-68339-9_17"},{"key":"1082_CR41","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1049\/iet-ifs.2013.0558","volume":"9","author":"MH Tadayon","year":"2015","unstructured":"Tadayon M.H., Khanmohammadi H., Haghighi M.S.: Dynamic and verifiable multi-secret sharing scheme based on Hermite interpolation and bilinear maps. IET Inf. Secur. 9, 234\u2013239 (2015).","journal-title":"IET Inf. Secur."},{"key":"1082_CR42","first-page":"142","volume":"14","author":"Y Tian","year":"2012","unstructured":"Tian Y., Peng C., Ma J.: Publicly verifiable secret sharing schemes using bilinear pairings. Int. J. Netw. Secur. 14, 142\u2013148 (2012).","journal-title":"Int. J. Netw. Secur."},{"key":"1082_CR43","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/s11424-011-8408-6","volume":"24","author":"TY Wu","year":"2011","unstructured":"Wu T.Y., Tseng Y.M.: A pairing-based publicly verifiable secret sharing scheme. J. Syst. Sci. Complex 24, 186\u2013194 (2011).","journal-title":"J. Syst. Sci. Complex"},{"key":"1082_CR44","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1049\/iet-ifs.2012.0105","volume":"7","author":"TY Wu","year":"2013","unstructured":"Wu T.Y., Tseng Y.M.: Publicly verifiable multi-secret sharing scheme from bilinear parings. IET Inf. Secur. 7, 239\u2013246 (2013).","journal-title":"IET Inf. Secur."},{"key":"1082_CR45","first-page":"483","volume":"151","author":"CC Yang","year":"2004","unstructured":"Yang C.C., Chang T.Y., Hwang M.S.: A $$(t, n)$$ multi-secret sharing scheme. Appl. Math. Comput. 151, 483\u2013490 (2004).","journal-title":"Appl. Math. Comput."},{"key":"1082_CR46","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.ins.2019.04.061","volume":"496","author":"J Yuan","year":"2019","unstructured":"Yuan J., Li L.: A fully dynamic secret sharing scheme. Inf. Sci. 496, 42\u201352 (2019).","journal-title":"Inf. Sci."},{"key":"1082_CR47","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.future.2014.11.013","volume":"52","author":"J Zhang","year":"2015","unstructured":"Zhang J., Zhang F.: Information-theoretical secure verifiable secret sharing with vector space access structures over bilinear groups and its applications. Future Gener. Comput. Syst. 52, 109\u2013115 (2015).","journal-title":"Future Gener. Comput. Syst."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01082-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01082-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01082-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T17:36:57Z","timestamp":1676050617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01082-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,3]]},"references-count":47,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1082"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01082-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,7,3]]},"assertion":[{"value":"28 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}