{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T21:23:59Z","timestamp":1751923439850,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":36,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609406"},{"type":"electronic","value":"9789819609413"}],"license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0941-3_4","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T13:35:20Z","timestamp":1733664920000},"page":"100-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Verifiable Secret Sharing from\u00a0Symmetric Key Cryptography with\u00a0Improved Optimistic Complexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5520-5386","authenticated-orcid":false,"given":"Ignacio","family":"Cascudo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5289-3769","authenticated-orcid":false,"given":"Daniele","family":"Cozzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5294-6648","authenticated-orcid":false,"given":"Emanuele","family":"Giunta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Abraham, I., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G.: Bingo: Adaptivity and asynchrony in verifiable secret sharing and distributed key generation. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0I. LNCS, vol. 14081, pp. 39\u201370. Springer, Heidelberg (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_2","DOI":"10.1007\/978-3-031-38557-5_2"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The round complexity of perfect MPC with active security and optimal resiliency. In: 61st FOCS. pp. 1277\u20131284. IEEE Computer Society Press (Nov 2020).https:\/\/doi.org\/10.1109\/FOCS46700.2020.00121","DOI":"10.1109\/FOCS46700.2020.00121"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Atapoor, S., Baghery, K., Cozzo, D., Pedersen, R.: VSS from distributed ZK proofs and applications. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0I. LNCS, vol. 14438, pp. 405\u2013440. Springer, Heidelberg (Dec 2023).https:\/\/doi.org\/10.1007\/978-981-99-8721-4_13","DOI":"10.1007\/978-981-99-8721-4_13"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, R.: Compressed $$\\Sigma $$-protocol theory and practical application to plug & play secure algorithmics. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0III. LNCS, vol. 12172, pp. 513\u2013543. Springer, Heidelberg (Aug 2020).https:\/\/doi.org\/10.1007\/978-3-030-56877-1_18","DOI":"10.1007\/978-3-030-56877-1_18"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Attema, T., Fehr, S., Kloo\u00df, M.: Fiat-shamir transformation of multi-round interactive proofs. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0I. LNCS, vol. 13747, pp. 113\u2013142. Springer, Heidelberg (Nov 2022).https:\/\/doi.org\/10.1007\/978-3-031-22318-1_5","DOI":"10.1007\/978-3-031-22318-1_5"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Backes, M., Kate, A., Patra, A.: Computational verifiable secret sharing revisited. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT\u00a02011. LNCS, vol.\u00a07073, pp. 590\u2013609. Springer, Heidelberg (Dec 2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_32","DOI":"10.1007\/978-3-642-25385-0_32"},{"key":"4_CR7","unstructured":"Baghery, K.: $$\\Pi $$: A unified framework for verifiable secret sharing. IACR Cryptol. ePrint Arch. p.\u00a01669 (2023), https:\/\/eprint.iacr.org\/2023\/1669"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA. pp. 1\u201310. ACM (1988).https:\/\/doi.org\/10.1145\/62212.62213, https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed-solomon interactive oracle proofs of proximity. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) ICALP 2018. LIPIcs, vol.\u00a0107, pp. 14:1\u201314:17. Schloss Dagstuhl (Jul 2018).https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.14","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: Transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT\u00a02019, Part\u00a0I. LNCS, vol. 11476, pp. 103\u2013128. Springer, Heidelberg (May 2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A.D. (eds.) TCC\u00a02016-B, Part\u00a0II. LNCS, vol.\u00a09986, pp. 31\u201360. Springer, Heidelberg (Oct\u00a0\/\u00a0Nov 2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Bois, A., Cascudo, I., Fiore, D., Kim, D.: Flexible and efficient verifiable computation on encrypted data. In: Garay, J. (ed.) PKC\u00a02021, Part\u00a0II. LNCS, vol. 12711, pp. 528\u2013558. Springer, Heidelberg (May 2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_19","DOI":"10.1007\/978-3-030-75248-4_19"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Zero-knowledge proofs on secret-shared data via fully linear PCPs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694, pp. 67\u201397. Springer, Heidelberg (Aug 2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0I. LNCS, vol. 12105, pp. 677\u2013706. Springer, Heidelberg (May 2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"4_CR15","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Lombardi, A., Rothblum, G.N., Rothblum, R.D.: Fiat-Shamir from simpler assumptions. Cryptology ePrint Archive, Report 2018\/1004 (2018), https:\/\/eprint.iacr.org\/2018\/1004"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B.: SCRAPE: Scalable randomness attested by public entities. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 17. LNCS, vol. 10355, pp. 537\u2013556. Springer, Heidelberg (Jul 2017).https:\/\/doi.org\/10.1007\/978-3-319-61204-1_27","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"4_CR17","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\u00a02020, Part\u00a0III. LNCS, vol. 12493, pp. 311\u2013341. Springer, Heidelberg (Dec 2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_11","DOI":"10.1007\/978-3-030-64840-4_11"},{"key":"4_CR18","unstructured":"Cascudo, I., David, B.: Publicly verifiable secret sharing over class groups and applications to DKG and YOSO. To appear at Eurocrypt 24. IACR Cryptol. ePrint Arch. p.\u00a01651 (2023), https:\/\/eprint.iacr.org\/2023\/1651"},{"key":"4_CR19","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\u00a02022, Part\u00a0I. LNCS, vol. 13791, pp. 651\u2013680. Springer, Heidelberg (Dec 2022).https:\/\/doi.org\/10.1007\/978-3-031-22963-3_22","DOI":"10.1007\/978-3-031-22963-3_22"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Cascudo, I., Giunta, E.: On interactive oracle proofs for boolean R1CS statements. In: Eyal, I., Garay, J.A. (eds.) FC 2022. LNCS, vol. 13411, pp. 230\u2013247. Springer, Heidelberg (May 2022).https:\/\/doi.org\/10.1007\/978-3-031-18283-9_11","DOI":"10.1007\/978-3-031-18283-9_11"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Chandramouli, A., Choudhury, A., Patra, A.: A survey on perfectly secure verifiable secret-sharing. ACM Comput. Surv. 54(11s), 232:1\u2013232:36 (2022).https:\/\/doi.org\/10.1145\/3512344, https:\/\/doi.org\/10.1145\/3512344","DOI":"10.1145\/3512344"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Choudhury, A., Patra, A.: On the communication efficiency of statistically secure asynchronous MPC with optimal resilience. J. Cryptol. 36(2), \u00a013 (2023). https:\/\/doi.org\/10.1007\/S00145-023-09451-9, https:\/\/doi.org\/10.1007\/s00145-023-09451-9","DOI":"10.1007\/S00145-023-09451-9"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press (2015), http:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/cryptography-cryptology-and-coding\/secure-multiparty-computation-and-secret-sharing?format=HB&isbn=9781107043053","DOI":"10.1017\/CBO9781107337756"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27-29 October 1987. pp. 427\u2013437. IEEE Computer Society (1987).https:\/\/doi.org\/10.1109\/SFCS.1987.4, https:\/\/doi.org\/10.1109\/SFCS.1987.4","DOI":"10.1109\/SFCS.1987.4"},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R Gennaro","year":"2007","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. Journal of Cryptology 20(1), 51\u201383 (Jan 2007). https:\/\/doi.org\/10.1007\/s00145-006-0347-3","journal-title":"Journal of Cryptology"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Coan, B.A., Afek, Y. (eds.) Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201998, Puerto Vallarta, Mexico, June 28 - July 2, 1998. pp. 101\u2013111. ACM (1998).https:\/\/doi.org\/10.1145\/277697.277716, https:\/\/doi.org\/10.1145\/277697.277716","DOI":"10.1145\/277697.277716"},{"key":"4_CR27","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\u00a02022, Part\u00a0I. LNCS, vol. 13275, pp. 458\u2013487. Springer, Heidelberg (May\u00a0\/\u00a0Jun 2022).https:\/\/doi.org\/10.1007\/978-3-031-06944-4_16","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Giunta, E.: On the impossibility of algebraic NIZK in pairing-free groups. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 702\u2013730. Springer, Heidelberg (Aug 2023)https:\/\/doi.org\/10.1007\/978-3-031-38551-3_22","DOI":"10.1007\/978-3-031-38551-3_22"},{"key":"4_CR29","unstructured":"Kate, A., Mangipudi, E.V., Mukherjee, P., Saleem, H., Thyagarajan, S.A.K.: Non-interactive VSS using class groups and application to DKG. IACR Cryptol. ePrint Arch. p.\u00a0451 (2023), https:\/\/eprint.iacr.org\/2023\/451"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO\u00a02001. LNCS, vol.\u00a02139, pp. 41\u201362. Springer, Heidelberg (Aug 2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_3","DOI":"10.1007\/3-540-44647-8_3"},{"issue":"2","key":"4_CR31","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM (JACM) 27(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM (JACM)"},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO\u201991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (Aug 1992).https:\/\/doi.org\/10.1007\/3-540-46766-1_9","DOI":"10.1007\/3-540-46766-1_9"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st ACM STOC. pp. 73\u201385. ACM Press (May 1989).https:\/\/doi.org\/10.1145\/73007.73014","DOI":"10.1145\/73007.73014"},{"key":"4_CR34","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\u201999. LNCS, vol.\u00a01666, pp. 148\u2013164. Springer, Heidelberg (Aug 1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_10","DOI":"10.1007\/3-540-48405-1_10"},{"key":"4_CR35","doi-asserted-by":"publisher","unstructured":"Shamir, A.: How to share a secret. Communications of the Association for Computing Machinery 22(11), 612\u2013613 (Nov 1979). https:\/\/doi.org\/10.1145\/359168.359176","DOI":"10.1145\/359168.359176"},{"key":"4_CR36","unstructured":"Shoup, V., Smart, N.P.: Lightweight asynchronous verifiable secret sharing with optimal resilience. IACR Cryptol. ePrint Arch. p.\u00a0536 (2023), https:\/\/eprint.iacr.org\/2023\/536"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0941-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T14:02:08Z","timestamp":1733666528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0941-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609406","9789819609413"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0941-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"9 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}