{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:04:27Z","timestamp":1765933467519,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819987351"},{"type":"electronic","value":"9789819987368"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8736-8_14","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T06:01:54Z","timestamp":1702792914000},"page":"420-450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Just How Fair is an\u00a0Unreactive World?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6737-6991","authenticated-orcid":false,"given":"Srinivasan","family":"Raghuraman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6062-3531","authenticated-orcid":false,"given":"Yibin","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-662-53641-4_13","volume-title":"Theory of Cryptography","author":"B Alon","year":"2016","unstructured":"Alon, B., Omri, E.: Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious. In: Hirt, M., Smith, A. (eds.) TCC 2016, Part I. LNCS, vol. 9985, pp. 307\u2013335. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_13"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-56880-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"B Alon","year":"2020","unstructured":"Alon, B., Omri, E., Paskin-Cherniavsky, A.: MPC with friends and foes. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_24"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-54242-8_13","volume-title":"Theory of Cryptography","author":"G Asharov","year":"2014","unstructured":"Asharov, G.: Towards characterizing complete fairness in secure two-party computation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 291\u2013316. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_13"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-662-46494-6_10","volume-title":"Theory of Cryptography","author":"G Asharov","year":"2015","unstructured":"Asharov, G., Beimel, A., Makriyannis, N., Omri, E.: Complete characterization of fairness in secure two-party computation of Boolean functions. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part I. LNCS, vol. 9014, pp. 199\u2013228. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_10"},{"key":"14_CR5","unstructured":"Awerbuch, B., Blum, M., Chor, B., Goldwasser, S., Micali, S.: How to implement Bracha\u2019s o(log n) byzantine agreement algorithm. Unpublished manuscript 1(2), 10 (1985)"},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/18M1210782","volume":"51","author":"A Beimel","year":"2022","unstructured":"Beimel, A., Haitner, I., Makriyannis, N., Omri, E.: Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling. SIAM J. Comput. 51(4), 1126\u20131171 (2022)","journal-title":"SIAM J. Comput."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-642-14623-7_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"A Beimel","year":"2010","unstructured":"Beimel, A., Omri, E., Orlov, I.: Protocols for multiparty coin toss with dishonest majority. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 538\u2013557. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_29"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, pp. 1\u201310. ACM Press, Chicago, IL, USA, 2\u20134 May 1988. https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, pp. 11\u201319. ACM Press, Chicago, IL, USA, 2\u20134 May 1988. https:\/\/doi.org\/10.1145\/62212.62214","DOI":"10.1145\/62212.62214"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: 18th Annual ACM Symposium on Theory of Computing, pp. 364\u2013369. ACM Press, Berkeley, CA, USA , 28\u201330 May 1986. https:\/\/doi.org\/10.1145\/12130.12168","DOI":"10.1145\/12130.12168"},{"key":"14_CR11","unstructured":"Cleve, R., Impagliazzo, R.: Martingales, collective coin flipping and discrete control processes. Other Words 1(5) (1993)"},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/s00145-016-9245-5","volume":"30","author":"R Cohen","year":"2016","unstructured":"Cohen, R., Lindell, Y.: Fairness versus guaranteed output delivery in secure multiparty computation. J. Cryptol. 30(4), 1157\u20131186 (2016). https:\/\/doi.org\/10.1007\/s00145-016-9245-5","journal-title":"J. Cryptol."},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00145-004-0150-y","volume":"18","author":"M Fitzi","year":"2004","unstructured":"Fitzi, M., Garay, J.A., Maurer, U., Ostrovsky, R.: Minimal complete primitives for secure multi-party computation. J. Cryptol. 18(1), 37\u201361 (2004). https:\/\/doi.org\/10.1007\/s00145-004-0150-y","journal-title":"J. Cryptol."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46035-7_32","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"M Fitzi","year":"2002","unstructured":"Fitzi, M., Gisin, N., Maurer, U., von Rotz, O.: Unconditional byzantine agreement and multi-party computation secure against dishonest minorities from scratch. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 482\u2013501. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_32"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. ACM Press, New York City, NY, USA, 25\u201327 May 1987. https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. J. ACM 58(6), 24:1\u201324:37 (2011)","DOI":"10.1145\/2049697.2049698"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-11799-2_7","volume-title":"Theory of Cryptography","author":"D Gordon","year":"2010","unstructured":"Gordon, D., Ishai, Y., Moran, T., Ostrovsky, R., Sahai, A.: On complete primitives for fairness. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 91\u2013108. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_7"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-00457-5_2","volume-title":"Theory of Cryptography","author":"SD Gordon","year":"2009","unstructured":"Gordon, S.D., Katz, J.: Complete fairness in multi-party computation without an honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 19\u201335. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_2"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Haitner, I., Tsfadia, E.: An almost-optimally fair three-party coin-flipping protocol. In: Shmoys, D.B. (ed.) 46th Annual ACM Symposium on Theory of Computing, pp. 408\u2013416. ACM Press, New York, NY, USA, 31 May\u20133 June 2014. https:\/\/doi.org\/10.1145\/2591796.2591842","DOI":"10.1145\/2591796.2591842"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-030-36030-6_13","volume-title":"Theory of Cryptography","author":"S Halevi","year":"2019","unstructured":"Halevi, S., Ishai, Y., Kushilevitz, E., Makriyannis, N., Rabin, T.: On fully secure MPC with solitary output. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019, Part I. LNCS, vol. 11891, pp. 312\u2013340. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_13"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-13190-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M Hirt","year":"2010","unstructured":"Hirt, M., Zikas, V.: Adaptively secure broadcast. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 466\u2013485. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_24"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th Annual ACM Symposium on Theory of Computing, pp. 20\u201331. ACM Press, Chicago, IL, USA, 2\u20134 May 1988). https:\/\/doi.org\/10.1145\/62212.62215","DOI":"10.1145\/62212.62215"},{"key":"14_CR23","unstructured":"Kumaresan, R., Raghuraman, S., Sealfon, A.: Synchronizable exchange. Cryptology ePrint Archive, Report 2020\/976 (2020). https:\/\/eprint.iacr.org\/2020\/976"},{"issue":"3","key":"14_CR24","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","volume":"25","author":"L Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz, L.: Kneser\u2019s conjecture, chromatic number, and homotopy. J. Comb. Theory Ser. A 25(3), 319\u2013324 (1978)","journal-title":"J. Comb. Theory Ser. A"},{"key":"14_CR25","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, Part II. LNCS, vol. 12171, pp. 593\u2013617. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_21"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Merino, A., M\u00fctze, T., et al.: Kneser graphs are hamiltonian. arXiv preprint arXiv:2212.03918 (2022)","DOI":"10.1145\/3564246.3585137"},{"key":"14_CR27","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"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st Annual ACM Symposium on Theory of Computing, pp. 73\u201385. ACM Press, Seattle, WA, USA, 15\u201317 May 1989. https:\/\/doi.org\/10.1145\/73007.73014","DOI":"10.1145\/73007.73014"},{"key":"14_CR29","unstructured":"Raghuraman, S., Yang, Y.: Just how fair is an unreactive world? Cryptology ePrint Archive, Report 2022\/1655 (2022). https:\/\/eprint.iacr.org\/2022\/1655"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society Press, Toronto, Ontario, Canada, 27\u201329 October 1986. https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8736-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:36Z","timestamp":1765933356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8736-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987351","9789819987368"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8736-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","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":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","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":"106","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":"28% - 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":"3","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":"12","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}