{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:14:55Z","timestamp":1775229295735,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662643303","type":"print"},{"value":"9783662643310","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-662-64331-0_25","type":"book-chapter","created":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T23:16:12Z","timestamp":1634944572000},"page":"479-498","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["High-Threshold AVSS with Optimal Communication Complexity"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"AlHaddad","sequence":"first","affiliation":[]},{"given":"Mayank","family":"Varia","sequence":"additional","affiliation":[]},{"given":"Haibin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,23]]},"reference":[{"key":"25_CR1","first-page":"458","volume":"2020","author":"I Abraham","year":"2020","unstructured":"Abraham, I., Nayak, K., Ren, L., Shrestha, N.: On the optimality of optimistic responsiveness. IACR Cryptol. ePrint Arch. 2020, 458 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"25_CR2","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":"25_CR3","unstructured":"Basu, S., Malkhi, D., Reiter, M., Tomescu, A.: Asynchronous verifiable secret-sharing protocols on a good day. CoRR. abs\/1807.03720 (2018)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Basu, S., Tomescu, A., Abraham, I., Malkhi, D., Reiter, M.K., Sirer, E.G.: Efficient verifiable secret sharing with share recovery in BFT protocols. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, pp. 2387\u20132402. Association for Computing Machinery, New York (2019)","DOI":"10.1145\/3319535.3354207"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 52\u201361. Association for Computing Machinery, New York (1993)","DOI":"10.1145\/167088.167109"},{"key":"25_CR6","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed-solomon interactive oracle proofs of proximity. In: ICALP, vol. 107 of LIPIcs, pp. 14:1\u201314:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"25_CR7","unstructured":"Ben-Sasson, E., Goldberg, L., Kopparty, S., Saraf, S.: DEEP-FRI: sampling outside the box improves soundness. In: ITCS, vol. 151 of LIPIcs, pp. 5:1\u20135:32. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"25_CR8","first-page":"1536","volume":"2020","author":"D Boneh","year":"2020","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo infinite: recursive zk-SNARKs from any additive polynomial commitment scheme. IACR Cryptol. ePrint Arch. 2020, 1536 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Bootle","year":"2016","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-319-76581-5_19","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"J Bootle","year":"2018","unstructured":"Bootle, J., Groth, J.: Efficient batch zero-knowledge arguments for low degree polynomials. In: Abdalla, M., Dahab, R. (eds.) PKC 2018, Part II. LNCS, vol. 10770, pp. 561\u2013588. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76581-5_19"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987)","journal-title":"Inf. Comput."},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 315\u2013334 (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Cachin, C.: An asynchronous protocol for distributed computation of RSA inverses and its applications. In: Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, Massachusetts, USA, July 13\u201316, 2003, pp. 153\u2013162 (2003)","DOI":"10.1145\/872035.872058"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: ACM Conference on Computer and Communications Security, pp. 88\u201397. ACM (2002)","DOI":"10.1145\/586110.586124"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography (extended abstract). In: PODC, pp. 123\u2013132. ACM (2000)","DOI":"10.1145\/343477.343531"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/11561927_42","volume-title":"Distributed Computing","author":"C Cachin","year":"2005","unstructured":"Cachin, C., Tessaro, S.: Asynchronous verifiable information dispersal. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 503\u2013504. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561927_42"},{"key":"25_CR18","unstructured":"Canetti, R.: Studies in secure multiparty computation and applications. Ph.D. thesis. Citeseer (1996)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: STOC, pp. 42\u201351. ACM (1993)","DOI":"10.1145\/167088.167105"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"25_CR21","first-page":"57","volume":"24","author":"A Chiesa","year":"2017","unstructured":"Chiesa, A., Forbes, M.A., Spooner, N.: A zero knowledge sumcheck and its applications. Electron. Colloquium Comput. Complex. 24, 57 (2017)","journal-title":"Electron. Colloquium Comput. Complex."},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, USA, 21\u201323 October 1985, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"issue":"1","key":"25_CR23","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02620230","volume":"6","author":"O Goldreich","year":"1993","unstructured":"Goldreich, O.: A uniform-complexity treatment of encryption and zero-knowledge. J. Cryptol. 6(1), 21\u201353 (1993). https:\/\/doi.org\/10.1007\/BF02620230","journal-title":"J. Cryptol."},{"key":"25_CR24","first-page":"958","volume":"2020","author":"M Hirt","year":"2020","unstructured":"Hirt, M., Kastrati, A., Liu-Zhang, C.-D.: Multi-threshold asynchronous reliable broadcast and consensus. IACR Cryptol. ePrint Arch. 2020, 958 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"25_CR25","unstructured":"Kate, A., Miller, A.K., Yurek, T.: Brief note: asynchronous verifiable secret sharing with optimal resilience and linear amortized overhead. CoRR, abs\/1902.06095 (2019)"},{"key":"25_CR26","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":"25_CR27","first-page":"1400","volume":"2019","author":"A Kattis","year":"2019","unstructured":"Kattis, A., Panarin, K., Vlasov, A.: Redshift: transparent SNARKs from list polynomial commitment IOPs. IACR Cryptol. ePrint Arch. 2019, 1400 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Kokoris-Kogias, E., Spiegelman, A., Malkhi, D.: Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (2020)","DOI":"10.1145\/3372297.3423364"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-48329-2_12","volume-title":"Advances in Cryptology\u2014CRYPTO 1993","author":"H Krawczyk","year":"1994","unstructured":"Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 136\u2013146. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_12"},{"key":"25_CR30","first-page":"1274","volume":"2020","author":"J Lee","year":"2020","unstructured":"Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. IACR Cryptol. ePrint Arch. 2020, 1274 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"25_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-11799-2_30","volume-title":"Theory of Cryptography","author":"B Libert","year":"2010","unstructured":"Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 499\u2013517. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_30"},{"key":"25_CR32","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\u2014CRYPTO 1987","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":"25_CR33","unstructured":"Pass, R., Shi, E.: Hybrid consensus: efficient consensus in the permissionless model. In: DISC, vol. 91 of LIPIcs, pp. 39:1\u201339:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"2","key":"25_CR34","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"issue":"2","key":"25_CR35","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"MO Rabin","year":"1989","unstructured":"Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36(2), 335\u2013348 (1989)","journal-title":"J. ACM"},{"issue":"11","key":"25_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(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"25_CR37","first-page":"1020","volume":"2019","author":"A Vlasov","year":"2019","unstructured":"Vlasov, A., Panarin, K.: Transparent polynomial commitment scheme with polylogarithmic communication complexity. IACR Cryptol. ePrint Arch. 2019, 1020 (2019)","journal-title":"IACR Cryptol. ePrint Arch."}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-64331-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T12:57:20Z","timestamp":1673614640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-64331-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783662643303","9783662643310"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-64331-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc21.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}