{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:37:08Z","timestamp":1767339428335,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":79,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"IBM-ILLINOIS Center for Cognitive Computing Systems Research"},{"DOI":"10.13039\/100004819","name":"State of Connecticut Department of Emergency Management and Homeland Security","doi-asserted-by":"publisher","award":["DE-OE0000780"],"award-info":[{"award-number":["DE-OE0000780"]}],"id":[{"id":"10.13039\/100004819","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1719196"],"award-info":[{"award-number":["CNS-1719196"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3354238","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"887-903","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["HoneyBadgerMPC and AsynchroMix"],"prefix":"10.1145","author":[{"given":"Donghang","family":"Lu","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"given":"Thomas","family":"Yurek","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Samarth","family":"Kulshreshtha","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Rahul","family":"Govind","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"given":"Andrew","family":"Miller","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_23"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Dahlia Malkhi and Alexander Spiegelman. 2018. Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication. arXiv preprint arXiv:1811.01332.  Ittai Abraham Dahlia Malkhi and Alexander Spiegelman. 2018. Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication. arXiv preprint arXiv:1811.01332.","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_2_3_1","volume-title":"USENIX Security Symposium. 1217--1234","author":"Alexopoulos Nikolaos","year":"2017","unstructured":"Nikolaos Alexopoulos , Aggelos Kiayias , Riivo Talviste , and Thomas Zacharias . 2017 . MCMix: Anonymous Messaging via Secure Multiparty Computation . In USENIX Security Symposium. 1217--1234 . Nikolaos Alexopoulos, Aggelos Kiayias, Riivo Talviste, and Thomas Zacharias. 2017. MCMix: Anonymous Messaging via Secure Multiparty Computation. In USENIX Security Symposium. 1217--1234."},{"key":"e_1_3_2_2_5_1","volume-title":"David Enyeart, Christopher Ferris, Gennady Laventman, Yacov Manevich, et almbox.","author":"Androulaki Elli","year":"2018","unstructured":"Elli Androulaki , Artem Barger , Vita Bortnikov , Christian Cachin , Konstantinos Christidis , Angelo De Caro , David Enyeart, Christopher Ferris, Gennady Laventman, Yacov Manevich, et almbox. 2018 . Hyperledger fabric: a distributed operating system for permissioned blockchains. In ACM EuroSys . Elli Androulaki, Artem Barger, Vita Bortnikov, Christian Cachin, Konstantinos Christidis, Angelo De Caro, David Enyeart, Christopher Ferris, Gennady Laventman, Yacov Manevich, et almbox. 2018. Hyperledger fabric: a distributed operating system for permissioned blockchains. In ACM EuroSys ."},{"key":"e_1_3_2_2_6_1","volume-title":"A full proof of the BGW protocol for perfectly secure multiparty computation. Journal of Cryptology","author":"Asharov Gilad","year":"2017","unstructured":"Gilad Asharov and Yehuda Lindell . 2017. A full proof of the BGW protocol for perfectly secure multiparty computation. Journal of Cryptology ( 2017 ), 58--151. Gilad Asharov and Yehuda Lindell. 2017. A full proof of the BGW protocol for perfectly secure multiparty computation. Journal of Cryptology (2017), 58--151."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Michael Backes Amit Datta and Aniket Kate. 2013. Asynchronous computational VSS with reduced communication complexity. In CT-RSA. 259--276.  Michael Backes Amit Datta and Aniket Kate. 2013. Asynchronous computational VSS with reduced communication complexity. In CT-RSA. 259--276.","DOI":"10.1007\/978-3-642-36095-4_17"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Assi Barak Martin Hirt Lior Koskas and Yehuda Lindell. 2018. An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. In ACM CCS. 695--712.  Assi Barak Martin Hirt Lior Koskas and Yehuda Lindell. 2018. An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. In ACM CCS. 695--712.","DOI":"10.1145\/3243734.3243801"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Donald Beaver. 1991. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology -- Crypto. 420--432.  Donald Beaver. 1991. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology -- Crypto. 420--432.","DOI":"10.1007\/3-540-46766-1_34"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In ACM STOC. 1--10.  Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In ACM STOC. 1--10.","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or Boaz Kelmer and Tal Rabin. 1994. Asynchronous secure computations with optimal resilience. In ACM PODC. 183--192.  Michael Ben-Or Boaz Kelmer and Tal Rabin. 1994. Asynchronous secure computations with optimal resilience. In ACM PODC. 183--192.","DOI":"10.1145\/197917.198088"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_2_14_1","volume-title":"One cell is enough to break Tor's anonymity. https:\/\/blog.torproject.org\/blog\/one-cell-enough. Accessed","author":"Blog The Tor","year":"2018","unstructured":"The Tor Blog . [n.d.]. One cell is enough to break Tor's anonymity. https:\/\/blog.torproject.org\/blog\/one-cell-enough. Accessed Nov 2018 . The Tor Blog. [n.d.]. One cell is enough to break Tor's anonymity. https:\/\/blog.torproject.org\/blog\/one-cell-enough. Accessed Nov 2018."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32946-3_5"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Nikita Borisov George Danezis Prateek Mittal and Parisa Tabriz. 2007. Denial of service or denial of security?. In ACM CCS. 92--102.  Nikita Borisov George Danezis Prateek Mittal and Parisa Tabriz. 2007. Denial of service or denial of security?. In ACM CCS. 92--102.","DOI":"10.1145\/1315245.1315258"},{"key":"e_1_3_2_2_19_1","unstructured":"Alin Bostan Laureano Gonzalez-Vega Herve Perdry and Eric Schost. [n.d.]. Complexity issues on Newton sums of polynomials.  Alin Bostan Laureano Gonzalez-Vega Herve Perdry and Eric Schost. [n.d.]. Complexity issues on Newton sums of polynomials."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_2_21_1","unstructured":"Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. Dissertation.  Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. Dissertation."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Christian Cachin Klaus Kursawe Anna Lysyanskaya and Reto Strobl. 2002. Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems. In ACM CCS. 88--97.  Christian Cachin Klaus Kursawe Anna Lysyanskaya and Reto Strobl. 2002. Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems. In ACM CCS. 88--97.","DOI":"10.1145\/586110.586124"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Christian Cachin Klaus Kursawe Frank Petzold and Victor Shoup. 2001. Secure and efficient asynchronous broadcast protocols. In Advances in Cryptology--Crypto. 524--541.  Christian Cachin Klaus Kursawe Frank Petzold and Victor Shoup. 2001. Secure and efficient asynchronous broadcast protocols. In Advances in Cryptology--Crypto. 524--541.","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2005.9"},{"key":"e_1_3_2_2_25_1","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume":"99","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro , Barbara Liskov , 1999 . Practical Byzantine fault tolerance . In OSDI , Vol. 99. 173 -- 186 . Miguel Castro, Barbara Liskov, et almbox. 1999. Practical Byzantine fault tolerance. In OSDI, Vol. 99. 173--186.","journal-title":"OSDI"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Koji Chida Daniel Genkin Koki Hamada Dai Ikarashi Ryo Kikuchi Yehuda Lindell and Ariel Nof. 2018. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In Advances in Cryptology -- Crypto. 34--64.  Koji Chida Daniel Genkin Koki Hamada Dai Ikarashi Ryo Kikuchi Yehuda Lindell and Ariel Nof. 2018. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In Advances in Cryptology -- Crypto. 34--64.","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Arka Rai Choudhuri Matthew Green Abhishek Jain Gabriel Kaptchuk and Ian Miers. 2017. Fairness in an unfair world: Fair multiparty computation from public bulletin boards. In ACM CCS. 719--728.  Arka Rai Choudhuri Matthew Green Abhishek Jain Gabriel Kaptchuk and Ian Miers. 2017. Fairness in an unfair world: Fair multiparty computation from public bulletin boards. In ACM CCS. 719--728.","DOI":"10.1145\/3133956.3134092"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Ashish Choudhury Martin Hirt and Arpita Patra. 2013. Asynchronous multiparty computation with linear communication complexity. In DISC. 388--402.  Ashish Choudhury Martin Hirt and Arpita Patra. 2013. Asynchronous multiparty computation with linear communication complexity. In DISC. 388--402.","DOI":"10.1007\/978-3-642-41527-2_27"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Ashish Choudhury Emmanuela Orsini Arpita Patra and Nigel P Smart. 2016. Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. In SCN. 147--168.  Ashish Choudhury Emmanuela Orsini Arpita Patra and Nigel P Smart. 2016. Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. In SCN. 147--168.","DOI":"10.1007\/978-3-319-44618-9_8"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Ashish Choudhury and Arpita Patra. 2015. Optimally resilient asynchronous MPC with linear communication complexity. In ICDCN. 5.  Ashish Choudhury and Arpita Patra. 2015. Optimally resilient asynchronous MPC with linear communication complexity. In ICDCN. 5.","DOI":"10.1145\/2684464.2684470"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614685"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53890-6_33"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Henry Corrigan-Gibbs and Bryan Ford. 2010. Dissent: accountable anonymous group messaging. In ACM CCS. 340--350.  Henry Corrigan-Gibbs and Bryan Ford. 2010. Dissent: accountable anonymous group messaging. In ACM CCS. 340--350.","DOI":"10.1145\/1866307.1866346"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Artur Czumaj and Berthold V\u00f6cking. 2014. Thorp shuffling butterflies and non-Markovian couplings. In International Colloquium on Automata Languages and Programming. 344--355.  Artur Czumaj and Berthold V\u00f6cking. 2014. Thorp shuffling butterflies and non-Markovian couplings. In International Colloquium on Automata Languages and Programming. 344--355.","DOI":"10.1007\/978-3-662-43948-7_29"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_15"},{"key":"e_1_3_2_2_36_1","unstructured":"Ivan Damg\u00e5rd Martin Geisler Mikkel Kr\u00f8igaard and Jesper Buus Nielsen. 2008a. Asynchronous Multiparty Computation: Theory and Implementation. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2008\/415.  Ivan Damg\u00e5rd Martin Geisler Mikkel Kr\u00f8igaard and Jesper Buus Nielsen. 2008a. Asynchronous Multiparty Computation: Theory and Implementation. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2008\/415."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Yuval Ishai. 2005. Constant-round multiparty computation using a black-box pseudorandom generator. In Advances in Cryptology--CRYPTO. 378--394.  Ivan Damg\u00e5rd and Yuval Ishai. 2005. Constant-round multiparty computation using a black-box pseudorandom generator. In Advances in Cryptology--CRYPTO. 378--394.","DOI":"10.1007\/11535218_23"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd Yuval Ishai and Mikkel Kr\u00f8igaard. 2010. Perfectly secure multiparty computation and the computational overhead of cryptography. In Advances in Cryptology--EUROCRYPT. 445--465.  Ivan Damg\u00e5rd Yuval Ishai and Mikkel Kr\u00f8igaard. 2010. Perfectly secure multiparty computation and the computational overhead of cryptography. In Advances in Cryptology--EUROCRYPT. 445--465.","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_14"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Jesper Buus Nielsen. 2007. Scalable and unconditionally secure multiparty computation. In Advances in Cryptology--CRYPTO. 572--590.  Ivan Damg\u00e5rd and Jesper Buus Nielsen. 2007. Scalable and unconditionally secure multiparty computation. In Advances in Cryptology--CRYPTO. 572--590.","DOI":"10.1007\/978-3-540-74143-5_32"},{"volume-title":"Low Latency - Choose Two. In IEEE Symposium on Security and Privacy (SP). 108--126","author":"Das D.","key":"e_1_3_2_2_42_1","unstructured":"D. Das , S. Meiser , E. Mohammadi , and A. Kate . 2018. Anonymity Trilemma: Strong Anonymity, Low Bandwidth Overhead , Low Latency - Choose Two. In IEEE Symposium on Security and Privacy (SP). 108--126 . D. Das, S. Meiser, E. Mohammadi, and A. Kate. 2018. Anonymity Trilemma: Strong Anonymity, Low Bandwidth Overhead, Low Latency - Choose Two. In IEEE Symposium on Security and Privacy (SP). 108--126."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA465464"},{"key":"e_1_3_2_2_44_1","volume-title":"BEAT: Asynchronous BFT Made Practical. In ACM CCS. 2028--2041.","author":"Duan Sisi","year":"2018","unstructured":"Sisi Duan , Michael K Reiter , and Haibin Zhang . 2018 . BEAT: Asynchronous BFT Made Practical. In ACM CCS. 2028--2041. Sisi Duan, Michael K Reiter, and Haibin Zhang. 2018. BEAT: Asynchronous BFT Made Practical. In ACM CCS. 2028--2041."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Fabienne Eigner Matteo Maffei Ivan Pryvalov Francesca Pampaloni and Aniket Kate. 2014. Differentially private data aggregation with optimal utility. In ACSAC. 316--325.  Fabienne Eigner Matteo Maffei Ivan Pryvalov Francesca Pampaloni and Aniket Kate. 2014. Differentially private data aggregation with optimal utility. In ACSAC. 316--325.","DOI":"10.1145\/2664243.2664263"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Shuhong Gao. 2003. A new algorithm for decoding Reed-Solomon codes. In Communications Information and Network Security. 55--68.  Shuhong Gao. 2003. A new algorithm for decoding Reed-Solomon codes. In Communications Information and Network Security. 55--68.","DOI":"10.1007\/978-1-4757-3789-9_5"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132696"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Yossi Gilad. 2019. Metadata-Private Communication for the 99%. To appear in Commun. ACM .  Yossi Gilad. 2019. Metadata-Private Communication for the 99%. To appear in Commun. ACM .","DOI":"10.1145\/3338537"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"S Dov Gordon Feng-Hao Liu and Elaine Shi. 2015. Constant-round MPC with fairness and guarantee of output delivery. In Advances in Cryptology--CRYPTO. 63--82.  S Dov Gordon Feng-Hao Liu and Elaine Shi. 2015. Constant-round MPC with fairness and guarantee of output delivery. In Advances in Cryptology--CRYPTO. 63--82.","DOI":"10.1007\/978-3-662-48000-7_4"},{"key":"e_1_3_2_2_51_1","volume-title":"SoK: General Purpose Compilers for Secure Multi-Party Computation. In IEEE Symposium on Security and Privacy (SP) .","author":"Hastings Marcella","year":"2019","unstructured":"Marcella Hastings , Brett Hemenway , Daniel Noble , and Steve Zdancewic . 2019 . SoK: General Purpose Compilers for Secure Multi-Party Computation. In IEEE Symposium on Security and Privacy (SP) . Marcella Hastings, Brett Hemenway, Daniel Noble, and Steve Zdancewic. 2019. SoK: General Purpose Compilers for Secure Multi-Party Computation. In IEEE Symposium on Security and Privacy (SP) ."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.3111245"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Martin Hirt and Jesper Buus Nielsen. 2006. Robust multiparty computation with linear communication complexity. In Advances in Cryptology--CRYPTO. 463--482.  Martin Hirt and Jesper Buus Nielsen. 2006. Robust multiparty computation with linear communication complexity. In Advances in Cryptology--CRYPTO. 463--482.","DOI":"10.1007\/11818175_28"},{"key":"e_1_3_2_2_54_1","volume-title":"Flavio Paiva Junqueira, and Benjamin Reed","author":"Hunt Patrick","year":"2010","unstructured":"Patrick Hunt , Mahadev Konar , Flavio Paiva Junqueira, and Benjamin Reed . 2010 . ZooKeeper: Wait-free Coordination for Internet-scale Systems.. In USENIX annual technical conference, Vol. 8 . Patrick Hunt, Mahadev Konar, Flavio Paiva Junqueira, and Benjamin Reed. 2010. ZooKeeper: Wait-free Coordination for Internet-scale Systems.. In USENIX annual technical conference, Vol. 8."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller Emmanuela Orsini and Peter Scholl. 2016. MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In ACM CCS. 830--842.  Marcel Keller Emmanuela Orsini and Peter Scholl. 2016. MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In ACM CCS. 830--842.","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller Valerio Pastro and Dragos Rotaru. 2018. Overdrive: making SPDZ great again. In Adanvance in Cryptology--EUROCRYPT. 158--189.  Marcel Keller Valerio Pastro and Dragos Rotaru. 2018. Overdrive: making SPDZ great again. In Adanvance in Cryptology--EUROCRYPT. 158--189.","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"crossref","unstructured":"Aggelos Kiayias Hong-Sheng Zhou and Vassilis Zikas. 2016. Fair and robust multi-party computation using a global transaction ledger. In Advances in Cryptology--ASIACRYPT. 705--734.  Aggelos Kiayias Hong-Sheng Zhou and Vassilis Zikas. 2016. Fair and robust multi-party computation using a global transaction ledger. In Advances in Cryptology--ASIACRYPT. 705--734.","DOI":"10.1007\/978-3-662-49896-5_25"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"crossref","unstructured":"Ranjit Kumaresan and Iddo Bentov. 2014. How to use bitcoin to incentivize correct computations. In ACM CCS. 30--41.  Ranjit Kumaresan and Iddo Bentov. 2014. How to use bitcoin to incentivize correct computations. In ACM CCS. 30--41.","DOI":"10.1145\/2660267.2660380"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132755"},{"key":"e_1_3_2_2_60_1","volume-title":"Privacy Enhancing Technologies","author":"Kwon Albert","year":"2016","unstructured":"Albert Kwon , David Lazar , Srinivas Devadas , and Bryan Ford . 2016. Riffle. Privacy Enhancing Technologies ( 2016 ), 115--134. Albert Kwon, David Lazar, Srinivas Devadas, and Bryan Ford. 2016. Riffle. Privacy Enhancing Technologies (2016), 115--134."},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_2_62_1","volume-title":"Karaoke: Distributed Private Messaging Immune to Passive Traffic Analysis. In OSDI. 711--725.","author":"Lazar David","year":"2018","unstructured":"David Lazar , Yossi Gilad , and Nickolai Zeldovich . 2018 . Karaoke: Distributed Private Messaging Immune to Passive Traffic Analysis. In OSDI. 711--725. David Lazar, Yossi Gilad, and Nickolai Zeldovich. 2018. Karaoke: Distributed Private Messaging Immune to Passive Traffic Analysis. In OSDI. 711--725."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/800205.806344"},{"key":"e_1_3_2_2_64_1","volume-title":"USENIX Security Symposium .","author":"Malkhi Dahlia","year":"2004","unstructured":"Dahlia Malkhi , Noam Nisan , Benny Pinkas , Yaron Sella , 2004 . Fairplay-Secure Two-Party Computation System .. In USENIX Security Symposium . Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella, et almbox. 2004. Fairplay-Secure Two-Party Computation System.. In USENIX Security Symposium ."},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00028"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.34"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"crossref","unstructured":"Andrew Miller Yu Xia Kyle Croman Elaine Shi and Dawn Song. 2016. The honey badger of BFT protocols. In ACM CCS. 31--42.  Andrew Miller Yu Xia Kyle Croman Elaine Shi and Dawn Song. 2016. The honey badger of BFT protocols. In ACM CCS. 31--42.","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30057-8_26"},{"key":"e_1_3_2_2_69_1","volume-title":"USENIX Security Symposium. 16--18","author":"Piotrowska Ania M","year":"2017","unstructured":"Ania M Piotrowska , Jamie Hayes , Tariq Elahi , Sebastian Meiser , and George Danezis . 2017 . The loopix anonymity system . In USENIX Security Symposium. 16--18 . Ania M Piotrowska, Jamie Hayes, Tariq Elahi, Sebastian Meiser, and George Danezis. 2017. The loopix anonymity system. In USENIX Security Symposium. 16--18."},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"crossref","unstructured":"Tim Ruffing Pedro Moreno-Sanchez and Aniket Kate. 2017. P2P Mixing and Unlinkable Bitcoin Transactions. In NDSS .  Tim Ruffing Pedro Moreno-Sanchez and Aniket Kate. 2017. P2P Mixing and Unlinkable Bitcoin Transactions. In NDSS .","DOI":"10.14722\/ndss.2017.23415"},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_72_1","volume-title":"mbox","author":"Victor Shoup","year":"2005","unstructured":"Victor Shoup et al mbox . 2005 . NTL , a library for doing number theory. Victor Shoup et almbox. 2005. NTL, a library for doing number theory."},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"crossref","unstructured":"Nigel P Smart and Tim Wood. 2019. Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-party Computation. In CT-RSA. 210--229.  Nigel P Smart and Tim Wood. 2019. Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-party Computation. In CT-RSA. 210--229.","DOI":"10.1007\/978-3-030-12612-4_11"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2010.5421749"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66399-9_25"},{"key":"e_1_3_2_2_76_1","volume-title":"RAPTOR: Routing Attacks on Privacy in Tor. In USENIX Security Symposium. 271--286","author":"Sun Yixin","year":"2015","unstructured":"Yixin Sun , Anne Edmundson , Laurent Vanbever , Oscar Li , Jennifer Rexford , Mung Chiang , and Prateek Mittal . 2015 . RAPTOR: Routing Attacks on Privacy in Tor. In USENIX Security Symposium. 271--286 . Yixin Sun, Anne Edmundson, Laurent Vanbever, Oscar Li, Jennifer Rexford, Mung Chiang, and Prateek Mittal. 2015. RAPTOR: Routing Attacks on Privacy in Tor. In USENIX Security Symposium. 271--286."},{"key":"e_1_3_2_2_77_1","volume-title":"Stadium: A Distributed Metadata-Private Messaging System. In 26th SOSP. 423--440.","author":"Tyagi Nirvan","year":"2017","unstructured":"Nirvan Tyagi , Yossi Gilad , Derek Leung , Matei Zaharia , and Nickolai Zeldovich . 2017 . Stadium: A Distributed Metadata-Private Messaging System. In 26th SOSP. 423--440. Nirvan Tyagi, Yossi Gilad, Derek Leung, Matei Zaharia, and Nickolai Zeldovich. 2017. Stadium: A Distributed Metadata-Private Messaging System. In 26th SOSP. 423--440."},{"key":"e_1_3_2_2_78_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017. Global-scale secure multiparty computation. In ACM CCS. 39--56.  Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017. Global-scale secure multiparty computation. In ACM CCS. 39--56.","DOI":"10.1145\/3133956.3133979"},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"crossref","unstructured":"David Isaac Wolinsky Ewa Syta and Bryan Ford. 2013. Hang with your buddies to resist intersection attacks. In ACM CCS. 1153--1166.  David Isaac Wolinsky Ewa Syta and Bryan Ford. 2013. Hang with your buddies to resist intersection attacks. In ACM CCS. 1153--1166.","DOI":"10.1145\/2508859.2516740"},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"crossref","unstructured":"Yihua Zhang Aaron Steele and Marina Blanton. 2013. PICCO: a general-purpose compiler for private distributed computation. In ACM CCS. 813--826.  Yihua Zhang Aaron Steele and Marina Blanton. 2013. PICCO: a general-purpose compiler for private distributed computation. In ACM CCS. 813--826.","DOI":"10.1145\/2508859.2516752"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"London United Kingdom","acronym":"CCS '19"},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354238","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354238","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:24:03Z","timestamp":1750202643000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354238"}},"subtitle":["Practical Asynchronous MPC and its Application to Anonymous Communication"],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":79,"alternative-id":["10.1145\/3319535.3354238","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3354238","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}