{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:09:08Z","timestamp":1763968148291,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,4]],"date-time":"2015-01-04T00:00:00Z","timestamp":1420329600000},"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":[[2015,1,4]]},"DOI":"10.1145\/2684464.2684470","type":"proceedings-article","created":{"date-parts":[[2015,3,9]],"date-time":"2015-03-09T19:27:55Z","timestamp":1425929275000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Optimally Resilient Asynchronous MPC with Linear Communication Complexity"],"prefix":"10.1145","author":[{"given":"Ashish","family":"Choudhury","sequence":"first","affiliation":[{"name":"International Institute of Information Technology Bangalore, India"}]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Automation, Indian Institute of Science Bangalore, India"}]}],"member":"320","published-online":{"date-parts":[[2015,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611490"},{"key":"e_1_3_2_1_3_1","first-page":"420","volume-title":"CRYPTO, LNCS 576","author":"Beaver D.","year":"1991","unstructured":"D. Beaver . Efficient Multiparty Protocols Using Circuit Randomization . In CRYPTO, LNCS 576 , pages 420 -- 432 . Springer Verlag , 1991 . D. Beaver. Efficient Multiparty Protocols Using Circuit Randomization. In CRYPTO, LNCS 576, pages 420--432. Springer Verlag, 1991."},{"key":"e_1_3_2_1_4_1","first-page":"376","volume":"4833","author":"Beerliov\u00e1-Trub\u00edniov\u00e1 Z.","year":"2007","unstructured":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1 and M. Hirt . Simple and Efficient Perfectly-Secure Asynchronous MPC. In ASIACRYPT, LNCS 4833 , pages 376 -- 392 . Springer Verlag, 2007 . Z. Beerliov\u00e1-Trub\u00edniov\u00e1 and M. Hirt. Simple and Efficient Perfectly-Secure Asynchronous MPC. In ASIACRYPT, LNCS 4833, pages 376--392. Springer Verlag, 2007.","journal-title":"Simple and Efficient Perfectly-Secure Asynchronous MPC. In ASIACRYPT, LNCS"},{"key":"e_1_3_2_1_5_1","first-page":"213","volume":"4948","author":"Beerliov\u00e1-Trub\u00edniov\u00e1 Z.","year":"2008","unstructured":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1 and M. Hirt . Perfectly-Secure MPC with Linear Communication Complexity. In TCC, LNCS 4948 , pages 213 -- 230 . Springer Verlag, 2008 . Z. Beerliov\u00e1-Trub\u00edniov\u00e1 and M. Hirt. Perfectly-Secure MPC with Linear Communication Complexity. In TCC, LNCS 4948, pages 213--230. Springer Verlag, 2008.","journal-title":"Perfectly-Secure MPC with Linear Communication Complexity. In TCC, LNCS"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835746"},{"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.1145\/197917.198088"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_13"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806743"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03515-4_2"},{"key":"e_1_3_2_1_15_1","first-page":"388","volume":"8205","author":"Choudhury A.","year":"2013","unstructured":"A. Choudhury , M. Hirt , and A. Patra . Asynchronous Multiparty Computation with Linear Communication Complexity. In DISC, LNCS 8205 , pages 388 -- 402 . Springer Verlag, 2013 . A. Choudhury, M. Hirt, and A. Patra. Asynchronous Multiparty Computation with Linear Communication Complexity. In DISC, LNCS 8205, pages 388--402. Springer Verlag, 2013.","journal-title":"Asynchronous Multiparty Computation with Linear Communication Complexity. In DISC, LNCS"},{"key":"e_1_3_2_1_16_1","first-page":"197","volume":"8642","author":"Choudhury A.","year":"2014","unstructured":"A. Choudhury , A. Patra , and N. P. Smart . Reducing the Overhead of MPC over a Large Population. In SCN, LNCS 8642 , pages 197 -- 217 . Springer Verlag, 2014 . A. Choudhury, A. Patra, and N. P. Smart. Reducing the Overhead of MPC over a Large Population. In SCN, LNCS 8642, pages 197--217. Springer Verlag, 2014.","journal-title":"In SCN, LNCS"},{"key":"e_1_3_2_1_17_1","first-page":"280","volume-title":"LNCS 2045","author":"Cramer R.","year":"2001","unstructured":"R. Cramer , I. Damg\u00e5rd , and J. B. Nielsen . Multiparty Computation from Threshold Homomorphic Encryption. In EUROCRYPT , LNCS 2045 , pages 280 -- 299 , 2001 . R. Cramer, I. Damg\u00e5rd, and J. B. Nielsen. Multiparty Computation from Threshold Homomorphic Encryption. In EUROCRYPT, LNCS 2045, pages 280--299, 2001."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_14"},{"key":"e_1_3_2_1_20_1","first-page":"572","volume":"4622","author":"Damg\u00e5rd I.","year":"2007","unstructured":"I. Damg\u00e5rd and J. B. Nielsen . Scalable and Unconditionally Secure Multiparty Computation. In CRYPTO, LNCS 4622 , pages 572 -- 590 . Springer Verlag, 2007 . I. Damg\u00e5rd and J. B. Nielsen. Scalable and Unconditionally Secure Multiparty Computation. In CRYPTO, LNCS 4622, pages 572--590. Springer Verlag, 2007.","journal-title":"Scalable and Unconditionally Secure Multiparty Computation. In CRYPTO, LNCS"},{"key":"e_1_3_2_1_21_1","first-page":"643","volume":"7417","author":"Damg\u00e5rd I.","year":"2012","unstructured":"I. Damg\u00e5rd , V. Pastro , N. P. Smart , and S. Zakarias . Multiparty Computation from Somewhat Homomorphic Encryption. In CRYPTO, LNCS 7417 , pages 643 -- 662 . Springer Verlag, 2012 . I. Damg\u00e5rd, V. Pastro, N. P. Smart, and S. Zakarias. Multiparty Computation from Somewhat Homomorphic Encryption. In CRYPTO, LNCS 7417, pages 643--662. Springer Verlag, 2012.","journal-title":"Multiparty Computation from Somewhat Homomorphic Encryption. In CRYPTO, LNCS"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332473"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45249-9_16"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146407"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_26"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_28"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_19"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_39"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25873-2_4"},{"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\/1609956.1609965"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"}],"event":{"name":"ICDCN '15: International Conference on Distributed Computing and Networking","acronym":"ICDCN '15","location":"Goa India"},"container-title":["Proceedings of the 16th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2684464.2684470","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2684464.2684470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:49Z","timestamp":1750273429000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2684464.2684470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,4]]},"references-count":33,"alternative-id":["10.1145\/2684464.2684470","10.1145\/2684464"],"URL":"https:\/\/doi.org\/10.1145\/2684464.2684470","relation":{},"subject":[],"published":{"date-parts":[[2015,1,4]]},"assertion":[{"value":"2015-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}