{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T07:02:01Z","timestamp":1782975721091,"version":"3.54.5"},"reference-count":43,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/sp63933.2026.00077","type":"proceedings-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T19:34:20Z","timestamp":1782934460000},"page":"3262-3280","source":"Crossref","is-referenced-by-count":0,"title":["Breaking the Barrier for Asynchronous MPC with a Friend"],"prefix":"10.1109","author":[{"given":"Banashri","family":"Karmakar","sequence":"first","affiliation":[{"name":"IISc Bangalore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[{"name":"Supra Research \/ Purdue University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shravani","family":"Patil","sequence":"additional","affiliation":[{"name":"IISc Bangalore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[{"name":"IISc Bangalore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sikhar","family":"Patranabis","sequence":"additional","affiliation":[{"name":"IBM Research India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Protik","family":"Paul","sequence":"additional","affiliation":[{"name":"TU Darmstadt"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Divya","family":"Ravi","sequence":"additional","affiliation":[{"name":"University of Amsterdam"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58740-5_10"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.65109\/ZDIQ5068"},{"key":"ref3","article-title":"Concretely efficient asynchronous mpc from lightweight cryptography","author":"Bandarupalli","year":"2024","journal-title":"Cryptology ePrint Archive"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835746"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21568-2_26"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198088"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_13"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_1"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3321705.3329809"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3338466.3358922"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90453-1_2"},{"key":"ref13","first-page":"1","article-title":"Optimally resilient asynchronous mpc with linear communication complexity","volume-title":"Proceedings of the 16th International Conference on Distributed Computing and Networking","author":"Choudhury"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09451-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12168"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49387-8_8"},{"key":"ref17","first-page":"769","article-title":"Spdz2k: Efficient mpc mod 2k for dishonest majority","volume-title":"Annual International Cryptology Conference","author":"Cramer"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44987-6_18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8721-4_6"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68397-8_6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_19"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_39"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22365-5_17"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68397-8_13"},{"key":"ref29","article-title":"Breaking the barrier for asynchronous MPC with a friend","author":"Karmakar","year":"2025","journal-title":"Cryptology ePrint Archive, Paper 2025\/1736"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SP54263.2024.00128"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"ref33","article-title":"Practical asynchronous mpc from lightweight cryptography","author":"Momose","year":"2024","journal-title":"Cryptology ePrint Archive"},{"key":"ref34","first-page":"74","article-title":"Efficient statistical asynchronous verifiable secret sharing with optimal resilience","volume-title":"International Conference on Information Theoretic Security","author":"Patra"},{"key":"ref35","article-title":"Efficient asynchronous multiparty computation with optimal resilience","author":"Patra","year":"2008","journal-title":"Cryptology ePrint Archive"},{"key":"ref36","first-page":"2165","article-title":"ABY2. 0: Improved Mixed-Protocol secure Two-Party computation","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Patra"},{"key":"ref37","first-page":"6417","article-title":"Prime match: A Privacy-Preserving inventory matching system","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","author":"Polychroniadou"},{"key":"ref38","volume-title":"NTL: A Library for doing Number Theory","author":"Shoup","year":"2021"},{"key":"ref39","article-title":"Dumbo-mpc: Efficient fully asynchronous mpc with optimal resilience","author":"Su","year":"2024","journal-title":"Cryptology ePrint Archive"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806744"},{"key":"ref41","volume-title":"EMP-toolkit: Efficient MultiParty computation toolkit","author":"Wang","year":"2016"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417276"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"}],"event":{"name":"2026 IEEE Symposium on Security and Privacy (SP)","location":"San Francisco, CA, USA","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["2026 IEEE Symposium on Security and Privacy (SP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11573355\/11573356\/11573405.pdf?arnumber=11573405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:35:44Z","timestamp":1782970544000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11573405\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/sp63933.2026.00077","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}