{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:26:19Z","timestamp":1765106779970,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550951","type":"print"},{"value":"9789819550968","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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-981-95-5096-8_9","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:24:33Z","timestamp":1765106673000},"page":"273-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Setup-Free Committee Sampling with\u00a0Subquadratic Communication"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1293-552X","authenticated-orcid":false,"given":"Ran","family":"Cohen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7404-8504","authenticated-orcid":false,"given":"Poulami","family":"Das","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1456-0899","authenticated-orcid":false,"given":"Tal","family":"Moran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Alberini, G., Moran, T., Rosen, A.: Public verification of private effort. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 169\u2013198. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_7","DOI":"10.1007\/978-3-662-46497-7_7"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Andrychowicz, M., Dziembowski, S.: PoW-based distributed cryptography with no trusted setup. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 379\u2013399. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_19","DOI":"10.1007\/978-3-662-48000-7_19"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Azouvi, S., Cachin, C., Le, D.V., Vukolic, M., Zanolini, L.: Modeling resources in permissionless longest-chain total-order broadcast. In: Hillel, E., Palmieri, R., Rivi\u00e8re, E. (eds.) 26th International Conference on Principles of Distributed Systems, OPODIS 2022, December 13-15, 2022, Brussels, Belgium. LIPIcs, vol.\u00a0253, pp. 19:1\u201319:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.OPODIS.2022.19","DOI":"10.4230\/LIPICS.OPODIS.2022.19"},{"key":"9_CR4","unstructured":"Ball, M., Rosen, A., Sabin, M., Vasudevan, P.N.: Proofs of useful work. IACR Cryptol. ePrint Arch, p.\u00a0203 (2017). http:\/\/eprint.iacr.org\/2017\/203"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Green, M., Tromer, E., Virza, M.: Secure sampling of public parameters for succinct zero knowledge proofs. In: 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, USA, 17-21 May 2015, pp. 287\u2013304. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/SP.2015.25","DOI":"10.1109\/SP.2015.25"},{"key":"9_CR6","unstructured":"Benet, J.: IPFS - content addressed, versioned, P2P file system. CoRR abs\/1407.3561 (2014). http:\/\/arxiv.org\/abs\/1407.3561"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, 19-23 August 2018, Proceedings, Part I. LNCS, vol. 10991, pp. 757\u2013788. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, 19-23 August 2018, Proceedings, Part I. LNCS, vol. 10991, pp. 757\u2013788. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"9_CR9","unstructured":"Bowe, S., Gabizon, A., Miers, I.: Scalable multi-party computation for ZK-snark parameters in the random beacon model. IACR Cryptol. ePrint Arch, p.\u00a01050 (2017). http:\/\/eprint.iacr.org\/2017\/1050"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020)","DOI":"10.1145\/3402457"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2019.02.001","volume":"777","author":"J Chen","year":"2019","unstructured":"Chen, J., Micali, S.: AlgoRand: a secure and efficient distributed ledger. Theor. Comput. Sci. 777, 155\u2013183 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2019.02.001","volume":"777","author":"J Chen","year":"2019","unstructured":"Chen, J., Micali, S.: AlgoRand: a secure and efficient distributed ledger. Theor. Comput. Sci. 777, 155\u2013183 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Cohen, R., Doerner, J., Kondi, Y., abhi shelat: Guaranteed output in $${O}(\\sqrt{n})$$ rounds for round-robin sampling protocols. In: Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part I. LNCS, vol. 13275, pp. 241\u2013271. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_9","DOI":"10.1007\/978-3-031-06944-4_9"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Cohen, R., Garay, J.A., Zikas, V.: Completeness theorems for adaptively secure broadcast. In: Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, 20-24 August 2023, Proceedings, Part I. LNCS, vol. 14081, pp. 3\u201338. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_1","DOI":"10.1007\/978-3-031-38557-5_1"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Cohen, R., Loss, J., Moran, T.: Efficient agreement over byzantine gossip. In: Financial Cryptography and Data Security (FC) 2024, Part I. LNCS, vol. 14744, pp. 74\u201391. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-78676-1_5","DOI":"10.1007\/978-3-031-78676-1_5"},{"key":"9_CR16","unstructured":"Das, P., Eckey, L., Faust, S., Loss, J., Maitra, M.: Round efficient byzantine agreement from VDFS. IACR Cryptol. ePrint Arch, p.\u00a0823 (2022)"},{"key":"9_CR17","unstructured":"Foundation, T.M.: The matrix protocol (2014). https:\/\/matrix.org\/"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Garay, J., Kiayias, A., Ostrovsky, R.M., Panagiotakos, G., Zikas, V.: Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 129\u2013158. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_5","DOI":"10.1007\/978-3-030-45724-2_5"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 1: Basic Techniques. Cambridge University Press (2001). https:\/\/doi.org\/10.1017\/CBO9780511546891","DOI":"10.1017\/CBO9780511546891"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, 22-26 January 2006, pp. 990\u2013999. ACM Press (2006)","DOI":"10.1145\/1109557.1109667"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Kohlweiss, M., Maller, M., Siim, J., Volkhov, M.: Snarky ceremonies. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 98\u2013127. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_4","DOI":"10.1007\/978-3-030-92078-4_4"},{"key":"9_CR22","unstructured":"Lenstra, A.K., Wesolowski, B.: A random zoo: sloth, unicorn, and TRX. IACR Cryptol. ePrint Arch, p.\u00a0366 (2015). http:\/\/eprint.iacr.org\/2015\/366"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Lewis-Pye, A., Roughgarden, T.: Permissionless consensus. CoRR abs\/2304.14701 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2304.14701","DOI":"10.48550\/ARXIV.2304.14701"},{"key":"9_CR24","unstructured":"Micali, S.: ALGORAND: the efficient and democratic ledger. CoRR abs\/1607.01341 (2016). http:\/\/arxiv.org\/abs\/1607.01341"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, 17-18 October, 1999, New York, NY, USA. pp. 120\u2013130. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814584","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"9_CR26","unstructured":"Micali, S., Vaikuntanathan, V.: Optimal and player-replaceable consensus with an honest majority. Tech. Rep. MIT-CSAIL-TR-2017-004, MIT (2017). https:\/\/dspace.mit.edu\/bitstream\/handle\/1721.1\/107927\/MIT-CSAIL-TR-2017-004.pdf"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Moran, T., Orlov, I.: Simple proofs of space-time and rational proofs of storage. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I. Lecture Notes in Computer Science, vol. 11692, pp. 381\u2013409. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_14","DOI":"10.1007\/978-3-030-26948-7_14"},{"issue":"2","key":"9_CR28","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"MO Rabin","year":"1983","unstructured":"Rabin, M.O.: Transaction protection by beacons. J. Comput. Syst. Sci. 27(2), 256\u2013267 (1983). https:\/\/doi.org\/10.1016\/0022-0000(83)90042-9","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Terner, B.: Permissionless consensus in the resource model. In: Eyal, I., Garay, J.A. (eds.) Financial Cryptography and Data Security - 26th International Conference, FC 2022, Grenada, 2-6 May 2022, Revised Selected Papers. LNCS, vol. 13411, pp. 577\u2013593. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_29","DOI":"10.1007\/978-3-031-18283-9_29"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5096-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:24:36Z","timestamp":1765106676000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5096-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550951","9789819550968"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5096-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","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":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}