{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:12:49Z","timestamp":1743127969634,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030904524"},{"type":"electronic","value":"9783030904531"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-90453-1_25","type":"book-chapter","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T14:14:32Z","timestamp":1636035272000},"page":"718-750","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial-Time Targeted Attacks on Coin Tossing for Any Number of Corruptions"],"prefix":"10.1007","author":[{"given":"Omid","family":"Etesami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeed","family":"Mahloujifar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Mahmoody","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"issue":"1\u20132","key":"25_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02762864","volume":"37","author":"D Amir","year":"1980","unstructured":"Amir, D., Milman, V.: Unconditional and symmetric sets in n-dimensional normed spaces. Israel J. Math. 37(1\u20132), 3\u201320 (1980)","journal-title":"Israel J. Math."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Beimel, A., Haitner, I., Makriyannis, N., Omri, E.: Tighter bounds on multi-party coin flipping via augmented weak martingales and differentially private sampling. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 838\u2013849. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00084"},{"key":"25_CR3","first-page":"91","volume":"5","author":"M Ben-Or","year":"1989","unstructured":"Ben-Or, M., Linial, N.: Collective coin flipping. Adv. Comput. Res. 5, 91\u2013115 (1989)","journal-title":"Adv. Comput. Res."},{"key":"25_CR4","first-page":"91","volume":"5","author":"M Ben-Or","year":"1990","unstructured":"Ben-Or, M., Linial, N.: Collective coin flipping. Adv. Comput. Res. 5, 91\u2013115 (1990)","journal-title":"Adv. Comput. Res."},{"key":"25_CR5","unstructured":"Bentov, I., Gabizon, A., Zuckerman, D.: Bitcoin beacon. arXiv preprint arXiv:1605.04559 (2016)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M Blum","year":"1984","unstructured":"Blum, M.: How to exchange (secret) keys. ACM Trans. Comput. Syst. 1, 175\u2013193 (1984)","journal-title":"ACM Trans. Comput. Syst."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 364\u2013369. ACM (1986)","DOI":"10.1145\/12130.12168"},{"key":"25_CR8","unstructured":"Cleve, R., Impagliazzo, R.: Martingales, collective coin flipping and discrete control processes. Manuscript (1993)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-19571-6_27","volume-title":"Theory of Cryptography","author":"D Dachman-Soled","year":"2011","unstructured":"Dachman-Soled, D., Lindell, Y., Mahmoody, M., Malkin, T.: On the black-box complexity of optimally-fair coin tossing. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 450\u2013467. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_27"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-54242-8_10","volume-title":"Theory of Cryptography","author":"D Dachman-Soled","year":"2014","unstructured":"Dachman-Soled, D., Mahmoody, M., Malkin, T.: Can optimally-fair coin tossing be based on one-way functions? In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 217\u2013239. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_10"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-48224-5_25","volume-title":"Automata, Languages and Programming","author":"Y Dodis","year":"2001","unstructured":"Dodis, Y.: New imperfect random source with applications to coin-flipping. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 297\u2013309. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_25"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Etesami, O., Mahloujifar, S., Mahmoody, M.: Computational concentration of measure: optimal bounds, reductions, and more. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 345\u2013363. SIAM (2020)","DOI":"10.1137\/1.9781611975994.21"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-662-47666-6_53","volume-title":"Automata, Languages, and Programming","author":"S Goldwasser","year":"2015","unstructured":"Goldwasser, S., Kalai, Y.T., Park, S.: Adaptively secure coin-flipping, revisited. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 663\u2013674. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_53"},{"key":"25_CR14","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"M Habib","year":"2013","unstructured":"Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B.: Probabilistic Methods for Algorithmic Discrete Mathematics, vol. 16. Springer, Heidelberg (2013)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Haitner, I., Karidi-Heller, Y.: A tight lower bound on adaptively secure full-information coin flip. In: IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020)","DOI":"10.1109\/FOCS46700.2020.00120"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-030-03807-6_20","volume-title":"Theory of Cryptography","author":"I Haitner","year":"2018","unstructured":"Haitner, I., Makriyannis, N., Omri, E.: On the complexity of fair coin flipping. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 539\u2013562. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_20"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Haitner, I., Nissim, K., Omri, E., Shaltiel, R., Silbak, J.: Computational two-party correlation: a dichotomy for key-agreement protocols. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 136\u2013147. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00022"},{"issue":"2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/15M1009147","volume":"46","author":"I Haitner","year":"2017","unstructured":"Haitner, I., Tsfadia, E.: An almost-optimally fair three-party coin-flipping protocol. SIAM J. Comput. 46(2), 479\u2013542 (2017)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"25_CR19","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"LH Harper","year":"1966","unstructured":"Harper, L.H.: Optimal numberings and isoperimetric problems on graphs. J. Comb. Theory 1(3), 385\u2013393 (1966)","journal-title":"J. Comb. Theory"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Kahn, J.: The influence of variables on Boolean functions. In: Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (1988)","DOI":"10.1109\/SFCS.1988.21923"},{"key":"25_CR21","unstructured":"Kalai, Y.T., Komargodski, I., Raz, R.: A lower bound for adaptively-secure collective coin-flipping protocols. In: 32nd International Symposium on Distributed Computing (2018)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-030-36033-7_13","volume-title":"Theory of Cryptography","author":"HA Khorasgani","year":"2019","unstructured":"Khorasgani, H.A., Maji, H.K., Mukherjee, T.: Estimating gaps in martingales and applications to coin-tossing: constructions and hardness. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 333\u2013355. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_13"},{"key":"25_CR23","unstructured":"Khorasgani, H.A., Maji, H.K., Wang, M.: Optimally-secure coin-tossing against a byzantine adversary. Cryptology ePrint Archive, Report 2020\/519 (2020). https:\/\/eprint.iacr.org\/2020\/519"},{"issue":"3","key":"25_CR24","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02125896","volume":"9","author":"D Lichtenstein","year":"1989","unstructured":"Lichtenstein, D., Linial, N., Saks, M.: Some extremal problems arising from discrete control processes. Combinatorica 9(3), 269\u2013287 (1989)","journal-title":"Combinatorica"},{"key":"25_CR25","unstructured":"Mahloujifar, S., Diochnos, D.I., Mahmoody, M.: Learning under $$p$$-tampering attacks. In: ALT, pp. 572\u2013596 (2018)"},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-70503-3_8","volume-title":"Theory of Cryptography","author":"S Mahloujifar","year":"2017","unstructured":"Mahloujifar, S., Mahmoody, M.: Blockwise $$p$$-tampering attacks on cryptographic primitives, extractors, and learners. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 245\u2013279. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_8"},{"key":"25_CR27","unstructured":"Mahloujifar, S., Mahmoody, M.: Can adversarially robust learning leverage computational hardness? In: Garivier, A., Kale, S. (eds.) Proceedings of the 30th International Conference on Algorithmic Learning Theory. Proceedings of Machine Learning Research, vol. 98, pp. 581\u2013609. PMLR, Chicago, Illinois (2019). http:\/\/proceedings.mlr.press\/v98\/mahloujifar19a.html"},{"key":"25_CR28","unstructured":"Mahloujifar, S., Mahmoody, M., Mohammed, A.: Universal multi-party poisoning attacks. In: Proceedings of the 36th International Conference on Machine Learning, vol. 97, pp. 4274\u20134283 (2019)"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-030-56880-1_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"HK Maji","year":"2020","unstructured":"Maji, H.K., Wang, M.: Black-box use of one-way functions is useless for optimal fair coin-tossing. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 593\u2013617. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_21"},{"issue":"2","key":"25_CR30","first-page":"101","volume":"10","author":"GA Margulis","year":"1974","unstructured":"Margulis, G.A.: Probabilistic characteristics of graphs with large connectivity. Problemy peredachi informatsii 10(2), 101\u2013108 (1974)","journal-title":"Problemy peredachi informatsii"},{"issue":"1","key":"25_CR31","first-page":"148","volume":"141","author":"C McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. Surv. Comb. 141(1), 148\u2013188 (1989)","journal-title":"Surv. Comb."},{"key":"25_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-38822-7","volume-title":"Asymptotic Theory of Finite Dimensional Normed Spaces","author":"VD Milman","year":"1986","unstructured":"Milman, V.D., Schechtman, G.: Asymptotic Theory of Finite Dimensional Normed Spaces, vol. 1200. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/978-3-540-38822-7"},{"key":"25_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00457-5_1","volume-title":"Theory of Cryptography","author":"T Moran","year":"2009","unstructured":"Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 1\u201318. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_1"},{"issue":"6","key":"25_CR34","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1137\/S0097539700376007","volume":"31","author":"A Russell","year":"2002","unstructured":"Russell, A., Saks, M., Zuckerman, D.: Lower bounds for leader election and collective coin-flipping in the perfect information model. SIAM J. Comput. 31(6), 1645\u20131662 (2002)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"25_CR35","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02699376","volume":"81","author":"M Talagrand","year":"1995","unstructured":"Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Publications Math\u00e9matiques de l\u2019Institut des Hautes Etudes Scientifiques 81(1), 73\u2013205 (1995)","journal-title":"Publications Math\u00e9matiques de l\u2019Institut des Hautes Etudes Scientifiques"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90453-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T01:22:47Z","timestamp":1730683367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90453-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904524","9783030904531"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90453-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Raleigh, NC","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}