{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T18:15:15Z","timestamp":1769278515616,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100008628","name":"Ministry of Electronics and Information technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008628","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Electronics, IT & BT Government of Karnataka"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538417","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"92-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees"],"prefix":"10.1145","author":[{"given":"Ananya","family":"Appan","sequence":"first","affiliation":[{"name":"International Institute of Information Technology, Bangalore, Bangalore, India"}]},{"given":"Anirudh","family":"Chandramouli","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology, Bangalore, Bangalore, India"}]},{"given":"Ashish","family":"Choudhury","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology, Bangalore, Bangalore, India"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2019. Lecture 10: Consensus. https:\/\/www.mpi-inf.mpg.de\/fileadmin\/inf\/d1\/teaching\/summer19\/tkds\/Lec10.pdf.  2019. Lecture 10: Consensus. https:\/\/www.mpi-inf.mpg.de\/fileadmin\/inf\/d1\/teaching\/summer19\/tkds\/Lec10.pdf."},{"key":"e_1_3_2_2_2_1","volume-title":"Efficient Perfectly Secure Computation with Optimal Resilience. In TCC (Lecture Notes in Computer Science)","volume":"13043","author":"Abraham I.","unstructured":"I. Abraham , G. Asharov , and A. Yanai . 2021 . Efficient Perfectly Secure Computation with Optimal Resilience. In TCC (Lecture Notes in Computer Science) , Vol. 13043 . Springer, 66--96. I. Abraham, G. Asharov, and A. Yanai. 2021. Efficient Perfectly Secure Computation with Optimal Resilience. In TCC (Lecture Notes in Computer Science), Vol. 13043. Springer, 66--96."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"I. Abraham D. Dolev and J. Y. Halpern. 2008. An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC. ACM 405--414.  I. Abraham D. Dolev and J. Y. Halpern. 2008. An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC. ACM 405--414.","DOI":"10.1145\/1400751.1400804"},{"key":"e_1_3_2_2_4_1","volume-title":"Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In IEEE Symposium on Security and Privacy. IEEE, 106--118","author":"Abraham I.","unstructured":"I. Abraham , D. Malkhi , K. Nayak , L. Ren , and M. Yin . 2020 . Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In IEEE Symposium on Security and Privacy. IEEE, 106--118 . I. Abraham, D. Malkhi, K. Nayak, L. Ren, and M. Yin. 2020. Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In IEEE Symposium on Security and Privacy. IEEE, 106--118."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-015-9214-4"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3388788"},{"key":"e_1_3_2_2_7_1","volume-title":"CRYPTO (Lecture Notes in Computer Science)","author":"Beaver D.","unstructured":"D. Beaver . 1991. Efficient Multiparty Protocols Using Circuit Randomization . In CRYPTO (Lecture Notes in Computer Science) , Vol. 576 . Springer , 420--432. D. Beaver. 1991. Efficient Multiparty Protocols Using Circuit Randomization. In CRYPTO (Lecture Notes in Computer Science), Vol. 576. Springer, 420--432."},{"key":"e_1_3_2_2_8_1","volume-title":"Simple and Efficient Perfectly-Secure Asynchronous MPC. In ASIACRYPT (Lecture Notes in Computer Science)","volume":"4833","author":"Beerliov\u00e1-Trub\u00edniov\u00e1 Z.","unstructured":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1 and M. Hirt . 2007 . Simple and Efficient Perfectly-Secure Asynchronous MPC. In ASIACRYPT (Lecture Notes in Computer Science) , Vol. 4833 . Springer, 376--392. Z. Beerliov\u00e1-Trub\u00edniov\u00e1 and M. Hirt. 2007. Simple and Efficient Perfectly-Secure Asynchronous MPC. In ASIACRYPT (Lecture Notes in Computer Science), Vol. 4833. Springer, 376--392."},{"key":"e_1_3_2_2_9_1","volume-title":"Perfectly-Secure MPC with Linear Communication Complexity. In TCC (Lecture Notes in Computer Science)","volume":"4948","author":"Beerliov\u00e1-Trub\u00edniov\u00e1 Z.","unstructured":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1 and M. Hirt . 2008 . Perfectly-Secure MPC with Linear Communication Complexity. In TCC (Lecture Notes in Computer Science) , Vol. 4948 . Springer, 213--230. Z. Beerliov\u00e1-Trub\u00edniov\u00e1 and M. Hirt. 2008. Perfectly-Secure MPC with Linear Communication Complexity. In TCC (Lecture Notes in Computer Science), Vol. 4948. Springer, 213--230."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or R. Canetti and O. Goldreich. 1993. Asynchronous Secure Computation. In STOC. ACM 52--61.  M. Ben-Or R. Canetti and O. Goldreich. 1993. Asynchronous Secure Computation. In STOC. ACM 52--61.","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or S. Goldwasser and A. Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In STOC. ACM 1--10.  M. Ben-Or S. Goldwasser and A. Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In STOC. ACM 1--10.","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"P. Berman J. A. Garay and K. J. Perry. 1992. Bit Optimal Distributed Consensus. In Computer Science Research. Springer 313--322.  P. Berman J. A. Garay and K. J. Perry. 1992. Bit Optimal Distributed Consensus. In Computer Science Research. Springer 313--322.","DOI":"10.1007\/978-1-4615-3422-8_27"},{"key":"e_1_3_2_2_13_1","volume-title":"Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. In TCC (Lecture Notes in Computer Science)","volume":"11891","author":"Blum E.","unstructured":"E. Blum , J. Katz , and J. Loss . 2019 . Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. In TCC (Lecture Notes in Computer Science) , Vol. 11891 . Springer, 131--150. E. Blum, J. Katz, and J. Loss. 2019. Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. In TCC (Lecture Notes in Computer Science), Vol. 11891. Springer, 131--150."},{"key":"e_1_3_2_2_14_1","volume-title":"Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions. In ASIACRYPT (Lecture Notes in Computer Science)","author":"Blum E.","year":"2021","unstructured":"E. Blum , J. Katz , and J. Loss . 2021 . Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions. In ASIACRYPT (Lecture Notes in Computer Science) , Vol. 13091 . Springer , 547--572. E. Blum, J. Katz, and J. Loss. 2021. Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions. In ASIACRYPT (Lecture Notes in Computer Science), Vol. 13091. Springer, 547--572."},{"key":"e_1_3_2_2_15_1","volume-title":"Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback. In CRYPTO (Lecture Notes in Computer Science)","author":"Blum E.","year":"2020","unstructured":"E. Blum , C. L. Zhang , and J. Loss . 2020 . Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback. In CRYPTO (Lecture Notes in Computer Science) , Vol. 12171 . Springer , 707--731. E. Blum, C. L. Zhang, and J. Loss. 2020. Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback. In CRYPTO (Lecture Notes in Computer Science), Vol. 12171. Springer, 707--731."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"G. Bracha. 1984. An Asynchronous [(n-1)\/3]-Resilient Consensus Protocol. In PODC. ACM 154--162.  G. Bracha. 1984. An Asynchronous [(n-1)\/3]-Resilient Consensus Protocol. In PODC. ACM 154--162.","DOI":"10.1145\/800222.806743"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"A. Chandramouli A. Choudhury and A. Patra. 2021. A Survey on Perfectly-Secure Verifiable Secret-Sharing. ACM Computing Surveys.  A. Chandramouli A. Choudhury and A. Patra. 2021. A Survey on Perfectly-Secure Verifiable Secret-Sharing. ACM Computing Surveys.","DOI":"10.1145\/3512344"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"B. Chor S. Goldwasser S. Micali and B. Awerbuch. 1985. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). In FOCS. IEEE Computer Society 383--395.  B. Chor S. Goldwasser S. Micali and B. Awerbuch. 1985. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). In FOCS. IEEE Computer Society 383--395.","DOI":"10.1109\/SFCS.1985.64"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614685"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"R. Cramer and I. Damg\u00e5rd. 2005. Multiparty Computation an Introduction. Contemporary Cryptography. Birkh\u00e5user Basel.  R. Cramer and I. Damg\u00e5rd. 2005. Multiparty Computation an Introduction. Contemporary Cryptography. Birkh\u00e5user Basel.","DOI":"10.1007\/3-7643-7394-6_2"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"R. Cramer I. Damg\u00e5rd and J. B. Nielsen. 2015. Secure Multiparty Computation and Secret Sharing. Cambridge University Press.  R. Cramer I. Damg\u00e5rd and J. B. Nielsen. 2015. Secure Multiparty Computation and Secret Sharing. Cambridge University Press.","DOI":"10.1017\/CBO9781107337756"},{"key":"e_1_3_2_2_22_1","volume-title":"Scalable and Unconditionally Secure Multiparty Computation. In CRYPTO (Lecture Notes in Computer Science)","volume":"4622","author":"Damg\u00e5rd I.","unstructured":"I. Damg\u00e5rd and J. B. Nielsen . 2007 . Scalable and Unconditionally Secure Multiparty Computation. In CRYPTO (Lecture Notes in Computer Science) , Vol. 4622 . Springer Verlag, 572--590. I. Damg\u00e5rd and J. B. Nielsen. 2007. Scalable and Unconditionally Secure Multiparty Computation. In CRYPTO (Lecture Notes in Computer Science), Vol. 4622. Springer Verlag, 572--590."},{"key":"e_1_3_2_2_23_1","volume-title":"Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback. In TCC (Lecture Notes in Computer Science)","volume":"13042","author":"Deligios G.","unstructured":"G. Deligios , M. Hirt , and C. Liu-Zhang . 2021 . Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback. In TCC (Lecture Notes in Computer Science) , Vol. 13042 . Springer, 623--653. G. Deligios, M. Hirt, and C. Liu-Zhang. 2021. Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback. In TCC (Lecture Notes in Computer Science), Vol. 13042. Springer, 623--653."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138036"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_2_26_1","volume-title":"Round-Optimal and Efficient Verifiable Secret Sharing. In TCC (Lecture Notes in Computer Science)","volume":"3876","author":"Fitzi M.","unstructured":"M. Fitzi , J. A. Garay , S. Gollakota , C. Pandu Rangan , and K. Srinathan . 2006 . Round-Optimal and Efficient Verifiable Secret Sharing. In TCC (Lecture Notes in Computer Science) , Vol. 3876 . Springer, 329--342. M. Fitzi, J. A. Garay, S. Gollakota, C. Pandu Rangan, and K. Srinathan. 2006. Round-Optimal and Efficient Verifiable Secret Sharing. In TCC (Lecture Notes in Computer Science), Vol. 3876. Springer, 329--342."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"R. Gennaro Y. Ishai E. Kushilevitz and T. Rabin. 2001. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In STOC. ACM 580--589.  R. Gennaro Y. Ishai E. Kushilevitz and T. Rabin. 2001. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In STOC. ACM 580--589.","DOI":"10.1145\/380752.380853"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"R. Gennaro M. O. Rabin and T. Rabin. 1998. Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography. In PODC. ACM 101--111.  R. Gennaro M. O. Rabin and T. Rabin. 1998. Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography. In PODC. ACM 101--111.","DOI":"10.1145\/277697.277716"},{"key":"e_1_3_2_2_29_1","volume-title":"Communication-Efficient Unconditional MPC with Guaranteed Output Delivery. In CRYPTO (Lecture Notes in Computer Science)","volume":"11693","author":"Goyal V.","unstructured":"V. Goyal , Y. Liu , and Y. Song . 2019 . Communication-Efficient Unconditional MPC with Guaranteed Output Delivery. In CRYPTO (Lecture Notes in Computer Science) , Vol. 11693 . Springer, 85--114. V. Goyal, Y. Liu, and Y. Song. 2019. Communication-Efficient Unconditional MPC with Guaranteed Output Delivery. In CRYPTO (Lecture Notes in Computer Science), Vol. 11693. Springer, 85--114."},{"key":"e_1_3_2_2_30_1","volume-title":"CRYPTO (Lecture Notes in Computer Science)","volume":"11692","author":"Guo Y.","unstructured":"Y. Guo , R. Pass , and E. Shi . 2019. Synchronous, with a Chance of Partition Tolerance . In CRYPTO (Lecture Notes in Computer Science) , Vol. 11692 . Springer, 499--529. Y. Guo, R. Pass, and E. Shi. 2019. Synchronous, with a Chance of Partition Tolerance. In CRYPTO (Lecture Notes in Computer Science), Vol. 11692. Springer, 499--529."},{"key":"e_1_3_2_2_31_1","first-page":"889","article-title":"Improving the Round Complexity of VSS in Point-to-point","volume":"207","author":"Katz J.","year":"2009","unstructured":"J. Katz , C. Y. Koo , and R. Kumaresan . 2009 . Improving the Round Complexity of VSS in Point-to-point Networks. Inf. Comput. 207 , 8 (2009), 889 -- 899 . J. Katz, C. Y. Koo, and R. Kumaresan. 2009. Improving the Round Complexity of VSS in Point-to-point Networks. Inf. Comput. 207, 8 (2009), 889--899.","journal-title":"Networks. Inf. Comput."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"D. Malkhi K. Nayak and L. Ren. 2019. Flexible Byzantine Fault Tolerance. In CCS. ACM 1041--1053.  D. Malkhi K. Nayak and L. Ren. 2019. Flexible Byzantine Fault Tolerance. In CCS. ACM 1041--1053.","DOI":"10.1145\/3319535.3354225"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358762"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484554"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785953"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-013-9172-7"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2827360"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","location":"Salerno Italy","acronym":"PODC '22","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538417","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538417","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":39,"alternative-id":["10.1145\/3519270.3538417","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538417","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}