{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:03Z","timestamp":1773377643510,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100007289","name":"Purdue Research Foundation (PRF)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007289","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518276","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2858-2863","source":"Crossref","is-referenced-by-count":1,"title":["Optimally-secure Coin-tossing against a Byzantine Adversary"],"prefix":"10.1109","author":[{"given":"Hamidreza Amini","family":"Khorasgani","sequence":"first","affiliation":[{"name":"Purdue University,Department of Computer Science,West Lafayette,Indiana,USA,47907"}]},{"given":"Hemanta K.","family":"Maji","sequence":"additional","affiliation":[{"name":"Purdue University,Department of Computer Science,West Lafayette,Indiana,USA,47907"}]},{"given":"Mingyuan","family":"Wang","sequence":"additional","affiliation":[{"name":"Purdue University,Department of Computer Science,West Lafayette,Indiana,USA,47907"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Random generation of combinatorial structures from a uniform distribution (extended abstract)","author":"jerrum","year":"0","journal-title":"ICALP"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2885"},{"key":"ref12","first-page":"58:1","article-title":"Biasing Boolean functions and collective coin-flipping protocols over arbitrary product distributions","volume":"132","author":"filmus","year":"2019","journal-title":"ICALP 2019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00082-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258649"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278304"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36033-7_13"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2748\/tmj\/1178243286"},{"key":"ref18","article-title":"Can adversarially robust learning leveragecomputational hardness?","author":"mahloujifar","year":"2019","journal-title":"Algorithmic Learning Theory ALT-99"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.21"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_53"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125896"},{"key":"ref6","article-title":"A tight lower bound on adaptively secure full-information coin flip","author":"haitner","year":"0","journal-title":"FOCS"},{"key":"ref5","article-title":"A lower bound for adaptively-secure collective coin-flipping protocols","author":"kalai","year":"0","journal-title":"Disc"},{"key":"ref8","author":"katona","year":"1968","journal-title":"A theorem for finite sets theory of graphs"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1525\/9780520319875-014"},{"key":"ref2","article-title":"Collective coin flipping","author":"ben-or","year":"1989","journal-title":"Advances in Computing Research"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.15"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(66)80059-5"},{"key":"ref20","article-title":"Coin tossing with lazy defense: Hardness of computation results","author":"khorasgani","year":"2020","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_21"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518276.pdf?arnumber=9518276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:44Z","timestamp":1773347684000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518276\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518276","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}