{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T09:28:08Z","timestamp":1786440488189,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354174","type":"print"},{"value":"9783032354181","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-032-35418-1_8","type":"book-chapter","created":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:33:30Z","timestamp":1786437210000},"page":"231-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Practical Committee Sizes in\u00a0YOSO MPC"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"K\u0119dzior","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcin","family":"Mielniczuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniele","family":"Venturi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,12]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: 2014 IEEE Symposium on Security and Privacy, SP 2014, Berkeley, CA, USA, May 18-21, 2014, pp. 443\u2013458. IEEE Computer Society (2014)","DOI":"10.1109\/SP.2014.35"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Badertscher, C., Garay, J., Maurer, U., Tschudi, D., Zikas, V.: But why does it work? a rational protocol design treatment of bitcoin. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 34\u201365. Springer (2018)","DOI":"10.1007\/978-3-319-78375-8_2"},{"key":"8_CR3","unstructured":"Baum, C., David, B., Dowsley, R., Kishore, R., Buus Nielsen, J., Oechsner, S.: Craft: composable randomness and almost fairness from time. IACR Cryptol. ePrint Arch, 784 (2020)"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: TARDIS: a foundation of time-lock puzzles in UC. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 429\u2013459. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-515","DOI":"10.1007\/978-3-030-77883-515"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-030-64375-1_10","volume-title":"Theory of Cryptography","author":"F Benhamouda","year":"2020","unstructured":"Benhamouda, F., Gentry, C., Gorbunov, S., Halevi, S., Krawczyk, H., Lin, C., Rabin, T., Reyzin, L.: Can a public blockchain keep a secret? In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 260\u2013290. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_10"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Halevi, S., Krawczyk, H., Miao, A., Rabin, T.: Threshold cryptography as a service (in the multiserver and YOSO models). In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022, pp. 323\u2013336. ACM (2022)","DOI":"10.1145\/3548606.3559397"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 421\u2013439. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-124","DOI":"10.1007\/978-3-662-44381-124"},{"key":"8_CR8","unstructured":"Bhadauria, R., Hiang, J.H., Ravi, D., Sternad, J., Yakoubov, S.: Minimizing the use of the honest majority in YOSO MPC with guaranteed output delivery. IACR Cryptol. ePrint Arch., p. 2059 (2024)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Bormet, J., Dziembowski, S., Faust, S., Lizurej, T., Mielniczuk, M.: Strong secret sharing with snitching. In: Annual International Cryptology Conference, pp. 295\u2013327. Springer (2025)","DOI":"10.1007\/978-3-032-01884-7_10"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Campanelli, M., David, B., Khoshakhlagh, H., Konring, A., Nielsen, J.B.: Encryption to the future - A paradigm for sending secret messages to future (anonymous) committees. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part III. LNCS, vol. 13793, pp. 151\u2013180. Springer (2022)","DOI":"10.1007\/978-3-031-22969-5_6"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61\u201385. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-74","DOI":"10.1007\/978-3-540-70936-74"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kolby, S., Ravi, D., Soria-Vazquez, E., Yakoubov, S.: Taming adaptivity in YOSO protocols: the modular way. In: Rothblum, G.N., Wee, H. (eds.) TCC 2023, Part II, vol. 14370, pp. 33\u201362. Springer, 2023","DOI":"10.1007\/978-3-031-48618-0_2"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Cascudo, I., David, B.: Publicly verifiable secret sharing over class groups and applications to DKG and YOSO. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part V. LNCS, vol. 14655, pp. 216\u2013248. Springer (2024","DOI":"10.1007\/978-3-031-58740-5_8"},{"key":"8_CR14","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 2022. LNCS, vol. 13791, pp. 651\u2013680. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_22","DOI":"10.1007\/978-3-031-22963-3_22"},{"key":"8_CR15","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. Theoret. Comput. Sci. 777, 155\u2013183 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR16","unstructured":"Damg\u00e5rd, I.B., Kamp, S.H., Loss, J., Nielsen, J.B.: Asynchronous YOSO a la paillier. IACR Cryptol. ePrint Arch., p. 128 (2025)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of measure for the analysis of randomized algorithms, Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511581274"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Faust, S., Lizurej, T., Mielniczuk, M.: Secret sharing with snitching. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 840\u2013853 (2024)","DOI":"10.1145\/3658644.3690296"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Escudero, D., Masserova, E., Polychroniadou, A.: Towards scalable YOSO MPC via packed secret-sharing. IACR Cryptol. ePrint Arch., p. 635 (2025)","DOI":"10.1145\/3732772.3733556"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Faust, S., Hazay, C., Kretzler, D., Schlosser, B.: Generic compiler for publicly verifiable covert multi-party computation. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 782\u2013811. Springer (2021)","DOI":"10.1007\/978-3-030-77886-6_27"},{"key":"8_CR21","unstructured":"Felten, E.: Arbitrum\u2019s fraud proofs haven\u2019t been used since it launched, September 4 2023. Accessed 2025-09-20"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Gentry, C.: YOSO: you only speak once\/secure MPC with stateless ephemeral roles. Cryptology ePrint Archive, (2021). Paper 2021\/210","DOI":"10.1007\/978-3-030-84245-1_3"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Gentry, C., Halevi, S., Magri, B., Nielsen, J.B., Yakoubov, S.: Random-index PIR and applications. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 32\u201361. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-22","DOI":"10.1007\/978-3-030-90456-22"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Halevi, S., Kushilevitz, E.: Random-Index Oblivious RAM. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022. LNCS, vol 13749, pp. 33\u201359. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22368-6_2","DOI":"10.1007\/978-3-031-22368-6_2"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Joag-Dev, K., Proschan, F.: Negative association of random variables, with applications. The Annals of Statistics, pp. 286\u2013295 (1983)","DOI":"10.1214\/aos\/1176346079"},{"key":"8_CR26","doi-asserted-by":"publisher","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally Composable Synchronous Computation. In: Sahai, A. (eds.) TCC 2013. LNCS, vol. 7785, pp. 477\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27","DOI":"10.1007\/978-3-642-36594-2_27"},{"issue":"3","key":"8_CR27","first-page":"30","volume":"1","author":"S Kolby","year":"2024","unstructured":"Kolby, S., Ravi, D., Yakoubov, S.: Constant-round YOSO MPC without setup. IACR Commun. Cryptol. 1(3), 30 (2024)","journal-title":"IACR Commun. Cryptol."},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Kumaresan, R., Bentov, I.: How to use bitcoin to incentivize correct computations. In: Ahn, G.-J., Yung, M., Li, N. (eds.) Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, USA, November 3-7, 2014, pp. 30\u201341. ACM (2014)","DOI":"10.1145\/2660267.2660380"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Liu-Zhang, C.-D., Masserova, E., Ribeiro, J., Soni, P., \u00a0Krishnan Thyagarajan, S.A.: Improved YOSO randomness generation with worst-case corruptions. In: Clark, J., Shi, E. (eds.) Financial Cryptography and Data Security - 28th International Conference, FC 2024, Willemstad, Cura\u00e7ao, March 4-8, 2024, Revised Selected Papers, Part II, volume 14745. LNCS, pp. 73\u201389. Springer (2024)","DOI":"10.1007\/978-3-031-78679-2_4"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Liu-Zhang, CD., Masserova, E., Ribeiro, J., Soni, P., Thyagarajan, S.A.: Efficient distributed randomness generation from minimal assumptions where parties speak sequentially once. In: Fehr, S., Fouque, PA. (eds.) EUROCRYPT 2025. LNCS, vol. 15605, pp. 176\u2013206. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91092-0_7","DOI":"10.1007\/978-3-031-91092-0_7"},{"key":"8_CR31","unstructured":"Pawe\u0142 K\u0229dzior, D.V., Mielniczuk, M.: Towards practical committee sizes in yoso mpc"},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"Rachuri, R., Scholl, P.: Le Mans: Dynamic and Fluid MPC for Dishonest Majority. In: Dodis, Y., Shrimpton, T. (eds) CRYPTO 2022. LNCS, vol. 13507, pp. 719\u2013749. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_25","DOI":"10.1007\/978-3-031-15802-5_25"},{"key":"8_CR33","unstructured":"Scholl, P., Simkin, M., Siniscalchi, L.: Multiparty computation with covert security and public verifiability. Cryptology ePrint Archive (2021)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35418-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:33:43Z","timestamp":1786437223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35418-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354174","9783032354181"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35418-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 August 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}