{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:03:10Z","timestamp":1783008190511,"version":"3.54.5"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587399","type":"print"},{"value":"9783031587405","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58740-5_13","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T02:01:45Z","timestamp":1714269705000},"page":"370-400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Fast Batched Asynchronous Distributed Key Generation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6291-7832","authenticated-orcid":false,"given":"Jens","family":"Groth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6996-5660","authenticated-orcid":false,"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Atapoor, S., Baghery, K., Cozzo, D., Pedersen, R.: VSS from distributed ZK proofs and applications. Cryptology ePrint Archive, Paper 2023\/992 (2023). https:\/\/eprint.iacr.org\/2023\/992","DOI":"10.1007\/978-981-99-8721-4_13"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213\u2013230. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_13"},{"key":"13_CR3","unstructured":"Benhamouda, F., Halevi, S., Krawczyk, H., Ma, Y., Rabin, T.: SPRINT: high-throughput robust distributed SCHNORR signatures. Cryptology ePrint Archive, Paper 2023\/427 (2023). https:\/\/eprint.iacr.org\/2023\/427"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-Group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"issue":"2","key":"13_CR6","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":"13_CR7","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":"13_CR8","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Seltzer, M.I., Leach, P.J. (eds.) Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), pp. 173\u2013186. USENIX Association (1999)"},{"key":"13_CR9","unstructured":"Certicom Research: Sec 2: Recommended elliptic curve domain parameters (2010), version 2.0. http:\/\/www.secg.org\/sec2-v2.pdf"},{"key":"13_CR10","unstructured":"Drucker, N., Gueron, S., Krasnov, V.: Making AES great again: the forthcoming vectorized AES instruction. Cryptology ePrint Archive, Paper 2018\/392 (2018). https:\/\/eprint.iacr.org\/2018\/392"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Duan, S., Wang, X., Zhang, H.: FIN: practical signature-free asynchronous common subset in constant time. Cryptology ePrint Archive, Paper 2023\/154 (2023). https:\/\/eprint.iacr.org\/2023\/154","DOI":"10.1145\/3576915.3616633"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Fallat, S.M.: Bidiagonal factorizations of totally nonnegative matrices. Am. Math. Mon. 108(8), 697\u2013712 (2001). http:\/\/www.jstor.org\/stable\/2695613","DOI":"10.1080\/00029890.2001.11919801"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Faz-Hern\u00e1ndez, A., L\u00f3pez-Hern\u00e1ndez, J.C., de\u00a0Oliveira, A.K.D.S.: SoK: a performance evaluation of cryptographic instruction sets on modern architectures. In: Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop, pp. 9\u201318. ACM (2018)","DOI":"10.1145\/3197507.3197511"},{"key":"13_CR14","doi-asserted-by":"crossref","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)","DOI":"10.1109\/SFCS.1987.4"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-94-015-8674-0_7","volume-title":"Total Positivity and Its Applications","author":"M Gasca","year":"1996","unstructured":"Gasca, M., Pe\u00f1a, J.M.: On factorizations of totally positive matrices. In: Gasca, M., Micchelli, C.A. (eds.) Total Positivity and Its Applications, pp. 109\u2013130. Springer, Netherlands (1996). https:\/\/doi.org\/10.1007\/978-94-015-8674-0_7"},{"issue":"1","key":"13_CR16","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. J. Cryptol. 20(1), 51\u201383 (2007)","journal-title":"J. Cryptol."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0001-8708(85)90121-5","volume":"58","author":"I Gessel","year":"1985","unstructured":"Gessel, I., Viennot, G.: Binomial determinants, paths, and hook length formulae. Adv. Math. 58, 300\u2013321 (1985)","journal-title":"Adv. Math."},{"key":"13_CR18","unstructured":"Groth, J.: Non-interactive distributed key generation and key resharing. Cryptology ePrint Archive, Report 2021\/339 (2021). https:\/\/ia.cr\/2021\/339"},{"key":"13_CR19","unstructured":"Groth, J., Shoup, V.: Design and analysis of a distributed ECDSA signing service. Cryptology ePrint Archive, Report 2022\/506 (2022). https:\/\/ia.cr\/2022\/506"},{"key":"13_CR20","unstructured":"Groth, J., Shoup, V.: Fast batched asynchronous distributed key generation. Cryptology ePrint Archive, Paper 2023\/1175 (2023). https:\/\/eprint.iacr.org\/2023\/1175"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/11818175_28","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Hirt","year":"2006","unstructured":"Hirt, M., Nielsen, J.B.: Robust multiparty computation with linear communication complexity. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 463\u2013482. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_28"},{"key":"13_CR22","unstructured":"Hua, M., Damelin, S.B., Sun, J., Yu, M.: The truncated & supplemented Pascal matrix and applications (2016). http:\/\/arxiv.org\/abs\/1506.07437"},{"issue":"11","key":"13_CR23","doi-asserted-by":"publisher","first-page":"6284","DOI":"10.1109\/TIT.2016.2608892","volume":"62","author":"S Lin","year":"2016","unstructured":"Lin, S., Al-Naffouri, T.Y., Han, Y.S., Chung, W.: Novel polynomial basis with fast Fourier transform and its application to Reed-Solomon erasure codes. IEEE Trans. Inf. Theory 62(11), 6284\u20136299 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"13_CR24","doi-asserted-by":"publisher","first-page":"2036","DOI":"10.1109\/LCOMM.2012.112012.121322","volume":"16","author":"S Lin","year":"2012","unstructured":"Lin, S., Chung, W.: An efficient (n, k) information dispersal algorithm for high code rate system over Fermat fields. IEEE Commun. Lett. 16(12), 2036\u20132039 (2012)","journal-title":"IEEE Commun. Lett."},{"key":"13_CR25","unstructured":"Malkhi, D., Nayak, K.: Extended abstract: HotStuff-2: Optimal two-phase responsive BFT. Cryptology ePrint Archive, Paper 2023\/397 (2023). https:\/\/eprint.iacr.org\/2023\/397"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"TP Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party (extended abstract). In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522\u2013526. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_47"},{"issue":"6","key":"13_CR27","doi-asserted-by":"publisher","first-page":"1314","DOI":"10.1109\/18.45291","volume":"35","author":"RM Roth","year":"1989","unstructured":"Roth, R.M., Lempel, A.: On MDS codes via cauchy matrices. IEEE Trans. Inf. Theory 35(6), 1314\u20131319 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR28","unstructured":"Shoup, V.: The many faces of Schnorr. Cryptology ePrint Archive, Paper 2023\/1019 (2023). https:\/\/eprint.iacr.org\/2023\/1019"},{"key":"13_CR29","unstructured":"Shoup, V., Smart, N.P.: Lightweight asynchronous verifiable secret sharing with optimal resilience. Cryptology ePrint Archive, Paper 2023\/536 (2023). https:\/\/eprint.iacr.org\/2023\/536"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58740-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:04:57Z","timestamp":1777334697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58740-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587399","9783031587405"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58740-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","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":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}