{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T11:07:39Z","timestamp":1775732859583,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032226976","type":"print"},{"value":"9783032226983","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22698-3_4","type":"book-chapter","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:24:12Z","timestamp":1775730252000},"page":"107-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Practical Framework for\u00a0Lattice-Based Non-interactive Publicly Verifiable Secret Sharing"],"prefix":"10.1007","author":[{"given":"Behzad","family":"Abdolmaleki","sequence":"first","affiliation":[]},{"given":"John","family":"Clark","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Foroutani","sequence":"additional","affiliation":[]},{"given":"Shahram","family":"Khazaei","sequence":"additional","affiliation":[]},{"given":"Sajjad","family":"Nasirzadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Determinism versus non-determinism for linear time RAMs (extended abstract). In: 31st ACM STOC, pp. 632\u2013641. ACM Press (1999). https:\/\/doi.org\/10.1145\/301250.301424","DOI":"10.1145\/301250.301424"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W.F., Malavolta, G., Thyagarajan, S.A.K.: Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable - (extended abstract). In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 102\u2013132. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_4","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Bacho, R., Loss, J.: Adaptively secure (aggregatable) PVSS and application to distributed randomness beacons. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023, pp. 1791\u20131804. ACM Press (2023). https:\/\/doi.org\/10.1145\/3576915.3623106","DOI":"10.1145\/3576915.3623106"},{"key":"4_CR4","unstructured":"Baghery, K.: $$\\pi $$: a unified framework for verifiable secret sharing. Cryptology ePrint Archive (2023)"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Boudot, F., Traor\u00e9, J.: Efficient publicly verifiable secret sharing schemes with fast or delayed recovery. In: Information and Communication Security: Second International Conference, ICICS 1999, Sydney, Australia, November 9\u201311, 1999. Proceedings 2, pp. 87\u2013102. Springer (1999). https:\/\/doi.org\/10.1007\/978-3-540-47942-0_8","DOI":"10.1007\/978-3-540-47942-0_8"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 575\u2013584. ACM Press (2013). https:\/\/doi.org\/10.1145\/2488608.2488680","DOI":"10.1145\/2488608.2488680"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B.: ALBATROSS: publicly attestable batched randomness based on secret sharing. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 311\u2013341. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_11","DOI":"10.1007\/978-3-030-64840-4_11"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B.: Publicly verifiable secret sharing over class groups and applications to DKG and YOSO. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part V. LNCS, vol. 14655, pp. 216\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_8","DOI":"10.1007\/978-3-031-58740-5_8"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B., Garms, L., Konring, A.: YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part I. LNCS, vol. 13791, pp. 651\u2013680. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_22","DOI":"10.1007\/978-3-031-22963-3_22"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Fujisaki, E., Okamoto, T.: A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 32\u201346. Springer, Berlin, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054115","DOI":"10.1007\/BFb0054115"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Gentry, C., Halevi, S., Lyubashevsky, V.: Practical non-interactive publicly verifiable secret sharing with thousands of parties. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 458\u2013487. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_16","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC 2008, Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 197\u2013206. Association for Computing Machinery, New York, NY, USA (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Heidarvand, S., Villar, J.L.: Public verifiability from pairings in secret sharing schemes. In: International Workshop on Selected Areas in Cryptography, pp. 294\u2013308. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-642-04159-4_19","DOI":"10.1007\/978-3-642-04159-4_19"},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2015)","journal-title":"Des. Codes Crypt."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-031-57722-2_2","volume-title":"Public-Key Cryptography - PKC 2024","author":"B Libert","year":"2024","unstructured":"Libert, B.: Vector commitments with proofs of smallness: short range proofs and more. In: Tang, Q., Teague, V. (eds.) Public-Key Cryptography - PKC 2024, pp. 36\u201367. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57722-2_2"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Lattice-based identification schemes secure under active attacks. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 162\u2013179. Springer, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78440-1_10","DOI":"10.1007\/978-3-540-78440-1_10"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Post-quantum Cryptography, pp. 147\u2013191. Springer (2009). https:\/\/doi.org\/10.1007\/11818175_8","DOI":"10.1007\/11818175_8"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Minh, P.N., Nguyen, K., Susilo, W., Nguyen-An, K.: Publicly verifiable secret sharing: generic constructions and lattice-based instantiations in the standard model. arXiv preprint arXiv:2504.14381 (2025)","DOI":"10.2139\/ssrn.5260769"},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert, C., et al.: A decade of lattice cryptography. Found. Trends Theor. Comput. Sci. 10(4), 283\u2013424 (2016)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6) (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"key":"4_CR23","unstructured":"Ruiz, A., Villar, J.L.: Publicly verifiable secret sharing from paillier\u2019s cryptosystem. In: WEWoRC 2005-Western European Workshop on Research in Cryptology, pp. 98\u2013108. Gesellschaft f\u00fcr Informatik eV (2005)"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148\u2013164. Springer, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_10","DOI":"10.1007\/3-540-48405-1_10"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190\u2013199. Springer, Berlin, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_17","DOI":"10.1007\/3-540-68339-9_17"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22698-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:24:14Z","timestamp":1775730254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22698-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032226976","9783032226983"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22698-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"10 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saint-Malo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}