{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:27:47Z","timestamp":1757618867223,"version":"3.44.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031972591"},{"type":"electronic","value":"9783031972607"}],"license":[{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"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-031-97260-7_15","type":"book-chapter","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T05:20:56Z","timestamp":1752470456000},"page":"319-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bivariate Proximity Test-Based Asynchronous Verifiable Secret Sharing"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Augot","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Blazy","sequence":"additional","affiliation":[]},{"given":"Hugo","family":"Delavenne","sequence":"additional","affiliation":[]},{"given":"Lola-Baie","family":"Mallordy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/s10623-022-01134-z","volume":"91","author":"D Augot","year":"2023","unstructured":"Augot, D., Bordage, S., Nardi, J.: Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes. Des. Codes Crypt. 91(3), 1111\u20131151 (2023)","journal-title":"Des. Codes Crypt."},{"key":"15_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-031-38557-5_2","volume-title":"CRYPTO 2023, Part I","author":"I Abraham","year":"2023","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 2023, Part I. LNCS, vol. 14081, pp. 39\u201370. Springer, Cham (2023)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-662-64331-0_25","volume-title":"Financial Cryptography and Data Security","author":"N AlHaddad","year":"2021","unstructured":"AlHaddad, N., Varia, M., Zhang, H.: High-threshold AVSS with optimal communication complexity. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, vol. 12675, pp. 479\u2013498. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64331-0_25"},{"key":"15_CR4","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.) 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 107, pp. 14:1\u201314:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: 25th ACM STOC, pp. 52\u201361. ACM Press (1993)","DOI":"10.1145\/167088.167109"},{"issue":"5","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3614423","volume":"70","author":"E Ben-Sasson","year":"2023","unstructured":"Ben-Sasson, E., Carmon, D., Ishai, Y., Kopparty, S., Saraf, S.: Proximity gaps for reed-solomon codes. J. ACM 70(5), 1\u201357 (2023)","journal-title":"J. ACM"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-36095-4_17","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"M Backes","year":"2013","unstructured":"Backes, M., Datta, A., Kate, A.: Asynchronous computational VSS with reduced communication complexity. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 259\u2013276. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36095-4_17"},{"key":"15_CR9","unstructured":"Ben-Sasson, E., Goldberg, L., Kopparty, S., Saraf, S.: DEEP-FRI: sampling outside the box improves soundness. In: Vidick, T. (ed.) 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, 12\u201314 January 2020, Seattle, Washington, USA, LIPIcs, vol. 151, pp. 5:1\u20135:32. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"15_CR10","unstructured":"Ben-Sasson, E., Kopparty, S., Saraf, S.: Worst-case to average case reductions for the distance to a codeElectron. Colloquium Comput. Complex. TR18-090 (2018)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979 National Computer Conference, vol. 48, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"15_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-981-96-0941-3_4","volume-title":"ASIACRYPT 2024, Part VII","author":"I Cascudo","year":"2024","unstructured":"Cascudo, I., Cozzo, D., Giunta, E.: Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity. In: Chung, K.-M., Sasaki, Yu. (eds.) ASIACRYPT 2024, Part VII. LNCS, vol. 15490, pp. 100\u2013128. Springer, Singapore (2024)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Choc, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: 26th FOCS, pp. 383\u2013395. IEEE Computer Society Press (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"15_CR14","unstructured":"Cheng, H., Li, J., Liu, Y., Lu, Y., Meng, W., Zhang, Z.: Resilience-optimal lightweight high-threshold asynchronous verifiable secret sharing. Cryptology ePrint Archive, Paper 2024\/1761 (2024)"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s00145-023-09451-9","volume":"36","author":"A Choudhury","year":"2023","unstructured":"Choudhury, A., Patra, A.: On the communication efficiency of statistically secure asynchronous MPC with optimal resilience. J. Cryptol. 36(2), 13 (2023)","journal-title":"J. Cryptol."},{"key":"15_CR16","unstructured":"Das, S., Xiang, Z., Tomescu, A., Spiegelman, A., Pinkas, B., Ren, L.: Verifiable secret sharing simplified. Cryptology ePrint Archive, Paper 2023\/1196 (2023)"},{"issue":"10","key":"15_CR17","doi-asserted-by":"publisher","first-page":"3249","DOI":"10.2298\/FIL2210249E","volume":"36","author":"K Eslamia","year":"2022","unstructured":"Eslamia, K., Bahramiana, M.: An isogeny-based quantum-resistant secret sharing scheme. Filomat 36(10), 3249\u20133258 (2022)","journal-title":"Filomat"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"15_CR19","unstructured":"G\u00fcnther, C.U., Das, S., Kokoris-Kogias, L.: Practical asynchronous proactive secret sharing and key refresh. Cryptology ePrint Archive, Paper 2022\/1586 (2022)"},{"key":"15_CR20","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"15_CR21","unstructured":"Hamburg, M.: ED448-goldilocks, a new elliptic curve. Cryptology ePrint Archive (2015)"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"15_CR23","unstructured":"Li, J., Lu, Z., Shen, R., Feng, Y., Lu, S.: Asynchronous verifiable secret sharing with elastic thresholds and distributed key generation. Cryptology ePrint Archive, Paper 2024\/1463 (2024)"},{"key":"15_CR24","unstructured":"Levrat, C., Rambaud, M., Urban, A.: Breaking the $$t< n\/3$$ consensus bound: asynchronous dynamic proactive secret sharing under honest majority. Cryptology ePrint Archive, Paper 2022\/619 (2022)"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"RC Merkle","year":"1988","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369\u2013378. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_32"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-14496-7_7","volume-title":"Information Theoretic Security","author":"A Patra","year":"2010","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Efficient statistical asynchronous verifiable secret sharing with optimal resilience. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol. 5973, pp. 74\u201392. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14496-7_7"},{"issue":"4","key":"15_CR27","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"issue":"11","key":"15_CR28","first-page":"612","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979)","journal-title":"Commun. Assoc. Comput. Mach."},{"issue":"3","key":"15_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00145-024-09505-6","volume":"37","author":"V Shoup","year":"2024","unstructured":"Shoup, V., Smart, N.P.: Lightweight asynchronous verifiable secret sharing with optimal resilience. J. Cryptol. 37(3), 27 (2024)","journal-title":"J. Cryptol."},{"key":"15_CR30","unstructured":"Welch, L.R., Berlekamp, E.R.: Error correction for algebraic block codes. US Patent 4,633,470 (1986)"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Yurek, T., Luo, L., Fairoze, J., Kate, A., Miller, A.: hbACSS: how to robustly share many secrets. Cryptology ePrint Archive, Paper 2021\/159 (2021)","DOI":"10.14722\/ndss.2022.23120"},{"key":"15_CR32","unstructured":"Zhang, Z., et al.: Fast RS-IOP multivariate polynomial commitments and verifiable secret sharing. In: Balzarotti, D., Xu, W. (eds.) USENIX Security 2024. USENIX Association (2024)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97260-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T07:24:14Z","timestamp":1757229854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97260-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"ISBN":["9783031972591","9783031972607"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97260-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/africacrypt2025.sciencesconf.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}