{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T17:08:44Z","timestamp":1769274524252,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031477539","type":"print"},{"value":"9783031477546","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47754-6_5","type":"book-chapter","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T09:02:35Z","timestamp":1701334955000},"page":"77-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Synchronous Perfectly Secure Message Transmission with\u00a0Optimal Asynchronous Fallback Guarantees"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Deligios","sequence":"first","affiliation":[]},{"given":"Chen-Da","family":"Liu-Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Appan, A., Chandramouli, A., Choudhury, A.: Perfectly- secure synchronous MPC with asynchronous fallback guarantees. In: ACM Symposium on Principles of Distributed Computing (2022)","DOI":"10.1145\/3519270.3538417"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-36030-6_6","volume-title":"Theory of Cryptography","author":"E Blum","year":"2019","unstructured":"Blum, E., Katz, J., Loss, J.: Synchronous consensus with optimal asynchronous fallback guarantees. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 131\u2013150. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_6"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-030-92075-3_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"E Blum","year":"2021","unstructured":"Blum, E., Katz, J., Loss, J.: Tardigrade: an atomic broadcast protocol for arbitrary network conditions. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13091, pp. 547\u2013572. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_19"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-030-56880-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"E Blum","year":"2020","unstructured":"Blum, E., Liu-Zhang, C.-D., Loss, J.: Always have a backup plan: fully secure synchronous\u00a0MPC\u00a0with\u00a0asynchronous\u00a0fallback. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 707\u2013731. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_25"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/j.jpdc.2011.03.004","volume":"71","author":"A Choudhury","year":"2011","unstructured":"Choudhury, A., et al.: Secure message transmission in asynchronous networks. J. Parallel Distrib. Comput. 71, 1067\u20131074 (2011)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-030-90459-3_21","volume-title":"Theory of Cryptography","author":"G Deligios","year":"2021","unstructured":"Deligios, G., Hirt, M., Liu-Zhang, C.-D.: Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 623\u2013653. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_21"},{"key":"5_CR7","unstructured":"Deligios, G., Liu-Zhang, C.-D.: Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees. Cryptology ePrint Archive, Paper 2022\/1397. https:\/\/eprint.iacr.org\/2022\/1397.2022"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-46035-7_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"Y Desmedt","year":"2002","unstructured":"Desmedt, Y., Wang, Y.: Perfectly secure message transmission revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 502\u2013517. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_33"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Dolev, D., et al.: Perfectly secure message transmission. J. ACM 40(1), 17\u201347 (1993)","DOI":"10.1145\/138027.138036"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-20901-7_8","volume-title":"Coding and Cryptology","author":"J Garay","year":"2011","unstructured":"Garay, J., Givens, C., Ostrovsky, R.: Secure message transmission by public discussion: a brief survey. In: Chee, Y.M., et al. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 126\u2013141. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_8"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Ghinea, D., Liu-Zhang, C.-D., Wattenhofer, R.: Optimal synchronous approximate agreement with asynchronous fallback. In: ACM Symposium on Principles of Distributed Computing. Springer (2022)","DOI":"10.1145\/3519270.3538442"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Kishore, R., Inumella, A., Srinathan, K.: Perfectly secure message transmission over partially synchronous networks. In: ICDCN 2019, Bangalore, India, pp. 302\u2013306. Association for Computing Machinery (2019). isbn: 9781450360944. https:\/\/doi.org\/10.1145\/3288599.3288612","DOI":"10.1145\/3288599.3288612"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Suzuki, K.: Almost secure (1-round, n-channel) message transmission scheme. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92(1), 105\u2013112 (2009)","DOI":"10.1587\/transfun.E92.A.105"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-540-78967-3_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"K Kurosawa","year":"2008","unstructured":"Kurosawa, K., Suzuki, K.: Truly efficient 2-round perfectly secure message transmission scheme. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 324\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_19"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen kurventheorie. Fund. Math. 10, 96\u20131159 (1927)","journal-title":"Fund. Math."},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Momose, A., Ren, L.: Multi-threshold Byzantine fault tolerance. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS 2021, Virtual Event, Republic of Korea, pp. 1686\u20131699. Association for Computing Machinery (2021). isbn: 9781450384544. https:\/\/doi.org\/10.1145\/3460120.3484554","DOI":"10.1145\/3460120.3484554"},{"key":"5_CR17","unstructured":"Resch, N., Yuan, C.: Two-round perfectly secure message transmission with optimal transmission rate. Cryptology ePrint Archive, Report 2021\/158 (2021)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Md Sayeed, H., Abu-Amara, H.: Efficient perfectly secure message transmission in synchronous networks. Inf. Comput. 126(1), 53\u201361 (1996)","DOI":"10.1006\/inco.1996.0033"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-662-53641-4_12","volume-title":"Theory of Cryptography","author":"G Spini","year":"2016","unstructured":"Spini, G., Z\u00e9mor, G.: Perfectly secure message transmission in two rounds. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 286\u2013304. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_12"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-540-28628-8_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K Srinathan","year":"2004","unstructured":"Srinathan, K., Narayanan, A., Rangan, C.P.: Optimal perfectly secure message transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 545\u2013561. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_33"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47754-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T09:03:26Z","timestamp":1701335006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47754-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"ISBN":["9783031477539","9783031477546"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47754-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,1]]},"assertion":[{"value":"1 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bol, Bra\u010d","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","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":"1 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc23.ifca.ai\/","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":"182","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":"39","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":"2","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":"21% - 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.5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full papers have been accepted from 18 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}