{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:13:21Z","timestamp":1778087601550,"version":"3.51.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253293","type":"print"},{"value":"9783032253309","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-25330-9_9","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:38:35Z","timestamp":1778085515000},"page":"245-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair Multiparty Coin Tossing from\u00a0Minimal Assumptions"],"prefix":"10.1007","author":[{"given":"Marshall","family":"Ball","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miranda","family":"Christ","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yevgeniy","family":"Dodis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachit","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"9_CR1","unstructured":"Abram, D., Roy, L., Simkin, M.: Time-based cryptography from weaker assumptions: randomness beacons, delay functions and more. Cryptology ePrint Archive (2024)"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Agrawalr, S., Malavolta, G., Zhang, T.: Time-lock puzzles from lattices. In: Annual International Cryptology Conference, pp. 425\u2013456. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_13","DOI":"10.1007\/978-3-031-68382-4_13"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Bellare, M., Goldwasser, S.: Verifiable partial key escrow. In: Graveman, R., Janson, P.A., Neuman, C., Gong, L. (eds.) ACM CCS 97: 4th Conference on Computer and Communications Security, pp. 78\u201391. ACM Press, Zurich, Switzerland (1997). https:\/\/doi.org\/10.1145\/266420.266439","DOI":"10.1145\/266420.266439"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Kalai, Y.T., Paneth, O.: Multi-collision resistance: a paradigm for keyless hash functions. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th Annual ACM Symposium on Theory of Computing, pp. 671\u2013684. ACM Press, Los Angeles, CA, USA (2018).https:\/\/doi.org\/10.1145\/3188745.3188870","DOI":"10.1145\/3188745.3188870"},{"key":"9_CR5","unstructured":"Blum, M.: Coin flipping by telephone. In: Proceedings of IEEE Spring COMPCOM, pp. 133\u2013137 (1982)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"D Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 236\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_15"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Bonneau, J., B\u00fcnz, B., Christ, M., Efron, Y.: Good things come to those who wait - dishonest-majority coin-flipping requires delay functions. In: Fehr, S., Fouque, P. (eds.) Advances in Cryptology - EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, May 4\u20138, 2025, Proceedings, Part VII. Lecture Notes in Computer Science, vol. 15607, pp. 225\u2013253. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-91098-2_9","DOI":"10.1007\/978-3-031-91098-2_9"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Choi, K., Arun, A., Tyagi, N., Bonneau, J.: Bicorn: an optimistically efficient distributed randomness beacon. In: Financial Crypto (2023)","DOI":"10.1007\/978-3-031-47754-6_14"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Choi, K., Manoj, A., Bonneau, J.: SoK: distributed randomness beacons. In: 2023 IEEE Symposium on Security and Privacy (SP), pp. 75\u201392. IEEE (2023)","DOI":"10.1109\/SP46215.2023.10179419"},{"key":"9_CR11","unstructured":"Christ, M., Choi, K., Bonneau, J.: Cornucopia: distributed randomness at scale. In: Advances in Financial Technologies (2024)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: TOC (1986)","DOI":"10.1145\/12130.12168"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) Advances in Cryptology \u2013 CRYPTO 1992. Lecture Notes in Computer Science, vol.\u00a0740, pp. 139\u2013147. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_10","DOI":"10.1007\/3-540-48071-4_10"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-030-90456-2_15","volume-title":"Theory of Cryptography","author":"C Freitag","year":"2021","unstructured":"Freitag, C., Komargodski, I., Pass, R., Sirkin, N.: Non-malleable time-lock puzzles and applications. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 447\u2013479. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_15"},{"key":"9_CR16","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume 2, Basic Applications, vol.\u00a02. Cambridge University Press (2001)"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Johnson, D.S. (ed.) Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14\u201317, 1989, Seattle, Washington, USA, pp. 25\u201332. ACM (1989). https:\/\/doi.org\/10.1145\/73007.73010","DOI":"10.1145\/73007.73010"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Goldschlag, D.M., Stubblebine, S.G.: Publicly verifiable lotteries: applications of delaying functions. In: Financial Crypto (1998)","DOI":"10.1007\/BFb0055485"},{"key":"9_CR19","unstructured":"Lamport, L.: Constructing digital signatures from a one way function (1979)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Lee, H., et al.: HeadStart: efficiently verifiable and low-latency participatory randomness generation at scale. In: NDSS (2022)","DOI":"10.14722\/ndss.2022.24234"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Wesolowski, B.: Trustworthy public randomness with sloth, unicorn, and trx. Int. J. Appl. Cryptogr. 3(4), 330\u2013343 (2017)","DOI":"10.1504\/IJACT.2017.089354"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-030-26948-7_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"G Malavolta","year":"2019","unstructured":"Malavolta, G., Thyagarajan, S.A.K.: Homomorphic time-lock puzzles and applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 620\u2013649. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_22"},{"key":"9_CR23","unstructured":"Rivest, R., Shamir, A., Wagner, D.: Time-lock puzzles and timed-release crypto (1996)"},{"key":"9_CR24","unstructured":"Schindler, P., Judmayer, A., Hittmeir, M., Stifter, N., Weippl, E.: RandRunner: distributed randomness from trapdoor VDFs with strong uniqueness. In: NDSS (2023)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25330-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:38:41Z","timestamp":1778085521000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25330-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253293","9783032253309"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25330-9_9","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":"7 May 2026","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}