{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:05:51Z","timestamp":1769270751771,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T00:00:00Z","timestamp":1546560000000},"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":[[2019,1,4]]},"DOI":"10.1145\/3288599.3288600","type":"proceedings-article","created":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T18:42:31Z","timestamp":1547059351000},"page":"292-301","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Round efficient computationally secure multi-party computation revisited"],"prefix":"10.1145","author":[{"given":"Laasya","family":"Bangalore","sequence":"first","affiliation":[{"name":"University of Rochester"}]},{"given":"Ashish","family":"Choudhury","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology Bangalore"}]},{"given":"Gayathri","family":"Garimella","sequence":"additional","affiliation":[{"name":"Oregon State University"}]}],"member":"320","published-online":{"date-parts":[[2019,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LIPIcs","first-page":"1","volume-title":"DISC","author":"Abraham I.","year":"2017","unstructured":"I. Abraham , S. Devadas , K. Nayak , and L. Ren . Brief Announcement: Practical Synchronous Byzantine Consensus . In DISC , volume 91 of LIPIcs , pages 41: 1 -- 41 :4. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , 2017 . I. Abraham, S. Devadas, K. Nayak, and L. Ren. Brief Announcement: Practical Synchronous Byzantine Consensus. In DISC, volume 91 of LIPIcs, pages 41:1--41:4. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/983102"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_32"},{"key":"e_1_3_2_1_5_1","series-title":"Lecture Notes in Computer Science","first-page":"420","volume-title":"CRYPTO","author":"Beaver D.","year":"1991","unstructured":"D. Beaver . Efficient Multiparty Protocols Using Circuit Randomization . In CRYPTO , volume 576 of Lecture Notes in Computer Science , pages 420 -- 432 . Springer Verlag , 1991 . D. Beaver. Efficient Multiparty Protocols Using Circuit Randomization. In CRYPTO, volume 576 of Lecture Notes in Computer Science, pages 420--432. Springer Verlag, 1991."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.64"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42045-0_12"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614685"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756154"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/647086.715687"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2846411"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_23"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802215"},{"key":"e_1_3_2_1_19_1","series-title":"Lecture Notes in Computer Science","first-page":"200","volume-title":"ICITS","author":"Garay J. A.","year":"2013","unstructured":"J. A. Garay , C. Givens , R. Ostrovsky , and P. Raykov . Broadcast (and Round) Efficient Verifiable Secret Sharing . In ICITS , volume 8317 of Lecture Notes in Computer Science , pages 200 -- 219 . Springer , 2013 . J. A. Garay, C. Givens, R. Ostrovsky, and P. Raykov. Broadcast (and Round) Efficient Verifiable Secret Sharing. In ICITS, volume 8317 of Lecture Notes in Computer Science, pages 200--219. Springer, 2013."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277716"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1202577"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/647096.716879"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_28"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_27"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_18"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_41"},{"key":"e_1_3_2_1_31_1","volume-title":"Distributed Algorithms. Morgan Kaufmann","author":"Lynch N. A.","year":"1996","unstructured":"N. A. Lynch . Distributed Algorithms. Morgan Kaufmann , 1996 . N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996."},{"key":"e_1_3_2_1_32_1","series-title":"Lecture Notes in Computer Science","first-page":"129","volume-title":"CRYPTO","author":"Pedersen T. P.","year":"1991","unstructured":"T. P. Pedersen . Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing . In CRYPTO , volume 576 of Lecture Notes in Computer Science , pages 129 -- 140 . Springer , 1991 . T. P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO, volume 576 of Lecture Notes in Computer Science, pages 129--140. Springer, 1991."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_35_1","first-page":"160","volume-title":"FOCS","author":"Yao A. C.","year":"1982","unstructured":"A. C. Yao . Protocols for Secure Computations (Extended Abstract) . In FOCS , pages 160 -- 164 . IEEE Computer Society , 1982 . A. C. Yao. Protocols for Secure Computations (Extended Abstract). In FOCS, pages 160--164. IEEE Computer Society, 1982."}],"event":{"name":"ICDCN '19: International Conference on Distributed Computing and Networking","location":"Bangalore India","acronym":"ICDCN '19","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","Indian Institute of Science Indian Institute of Science","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 20th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3288599.3288600","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3288599.3288600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:46Z","timestamp":1750208266000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3288599.3288600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,4]]},"references-count":33,"alternative-id":["10.1145\/3288599.3288600","10.1145\/3288599"],"URL":"https:\/\/doi.org\/10.1145\/3288599.3288600","relation":{},"subject":[],"published":{"date-parts":[[2019,1,4]]},"assertion":[{"value":"2019-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}