{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:07:07Z","timestamp":1763968027184,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,25]]},"DOI":"10.1145\/1835698.1835746","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"211-218","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["On the theoretical gap between synchronous and asynchronous MPC protocols"],"prefix":"10.1145","author":[{"given":"Zuzana","family":"Beerliov\u00e1-Trub\u00edniov\u00e1","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Martin","family":"Hirt","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[{"name":"University of Aarhus, Aarhus, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_1_2_1","first-page":"420","volume-title":"Advances in Cryptology - Crypto '91","author":"Beaver Donald","year":"1991","unstructured":"Donald Beaver . Efficient multiparty protocols using circuit randomization . In Joan Feigenbaum, editor, Advances in Cryptology - Crypto '91 , pages 420 -- 432 , Berlin, 1991 . Springer-Verlag . Lecture Notes in Computer Science Volume 576. Donald Beaver. Efficient multiparty protocols using circuit randomization. In Joan Feigenbaum, editor, Advances in Cryptology - Crypto '91, pages 420--432, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science Volume 576."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781454.1781486"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198088"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_6_1","first-page":"87","volume-title":"Advances in Cryptology - Crypto '87","author":"Chaum David","year":"1987","unstructured":"David Chaum , Ivan Damg\u00e5rd , and Jeroen van de Graaf . Multiparty computations ensuring privacy of each party's input and correctness of the result . In Carl Pomerance, editor, Advances in Cryptology - Crypto '87 , pages 87 -- 119 , Berlin, 1987 . Springer-Verlag . Lecture Notes in Computer Science Volume 293. David Chaum, Ivan Damg\u00e5rd, and Jeroen van de Graaf. Multiparty computations ensuring privacy of each party's input and correctness of the result. In Carl Pomerance, editor, Advances in Cryptology - Crypto '87, pages 87--119, Berlin, 1987. Springer-Verlag. Lecture Notes in Computer Science Volume 293."},{"key":"e_1_3_2_1_7_1","first-page":"280","volume-title":"Advances in Cryptology - EuroCrypt","author":"Cramer Ronald","year":"2001","unstructured":"Ronald Cramer , Ivan Damgaard , and Jesper Buus Nielsen . Multiparty computation from threshold homomorphic encryption . In Advances in Cryptology - EuroCrypt 2001 , pages 280 -- 300 , Berlin, 2001. Springer-Verlag . Lecture Notes in Computer Science Volume 2045. Ronald Cramer, Ivan Damgaard, and Jesper Buus Nielsen. Multiparty computation from threshold homomorphic encryption. In Advances in Cryptology - EuroCrypt 2001, pages 280--300, Berlin, 2001. Springer-Verlag. Lecture Notes in Computer Science Volume 2045."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343531"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756211"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_15"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00189261"},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-3-642-04355-0_46","volume-title":"Distributed Computing, 23rd International Symposium, DISC","author":"Fitzi Matthias","year":"2009","unstructured":"Matthias Fitzi and Jesper Buus Nielsen . On the number of synchronous rounds sufficient for authenticated Byzantine agreement . In Idit Keidar, editor, Distributed Computing, 23rd International Symposium, DISC 2009 , volume 5805 of Lecture Notes in Computer Science , pages 449 -- 463 . Springer-Verlag , 2009. Matthias Fitzi and Jesper Buus Nielsen. On the number of synchronous rounds sufficient for authenticated Byzantine agreement. In Idit Keidar, editor, Distributed Computing, 23rd International Symposium, DISC 2009, volume 5805 of Lecture Notes in Computer Science, pages 449--463. Springer-Verlag, 2009."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_19"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646767.704304"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756146"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756190"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806744"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"}],"event":{"name":"PODC '10: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Zurich Switzerland","acronym":"PODC '10"},"container-title":["Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835746","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835698.1835746","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:23Z","timestamp":1750248503000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":19,"alternative-id":["10.1145\/1835698.1835746","10.1145\/1835698"],"URL":"https:\/\/doi.org\/10.1145\/1835698.1835746","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}