{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,30]],"date-time":"2026-10-30T18:33:41Z","timestamp":1793385221378,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","funder":[{"name":"National Basic Research Program of China","award":["2011CBA00300, 2011CBA00301"],"award-info":[{"award-number":["2011CBA00300, 2011CBA00301"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61033001, 61361136003"],"award-info":[{"award-number":["61033001, 61361136003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Qi Zhi Institute Innovation Program","award":["SQZ202313"],"award-info":[{"award-number":["SQZ202313"]}]},{"name":"ETH Zurich Leading House Research Partnership","award":["RPG-072023-19"],"award-info":[{"award-number":["RPG-072023-19"]}]},{"name":"Sui Academic Research Award"},{"name":"Stellar Development Foundation"},{"name":"NIFA\/USDA","award":["2021-67021-34252"],"award-info":[{"award-number":["2021-67021-34252"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765114","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:37:25Z","timestamp":1763854645000},"page":"1799-1813","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Velox: Scalable Fair Asynchronous MPC from Lightweight Cryptography"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9669-5788","authenticated-orcid":false,"given":"Akhil","family":"Bandarupalli","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0122-8379","authenticated-orcid":false,"given":"Xiaoyu","family":"Ji","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2246-8416","authenticated-orcid":false,"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[{"name":"Purdue University &amp; Supra Research, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0349-3838","authenticated-orcid":false,"given":"Chen-Da","family":"Liu-Zhang","sequence":"additional","affiliation":[{"name":"Lucerne University of Applied Sciences and Arts &amp; Web3 Foundation, Lucerne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7674-2102","authenticated-orcid":false,"given":"Daniel","family":"P\u00f6llmann","sequence":"additional","affiliation":[{"name":"ETH Zurich &amp; Lucerne University of Applied Sciences and Arts, Lucerne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4169-3257","authenticated-orcid":false,"given":"Yifan","family":"Song","sequence":"additional","affiliation":[{"name":"Tsinghua University &amp; Shanghai Qi Zhi Institute, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58740-5_10"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405722"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8721-4_13"},{"key":"e_1_3_2_2_4_1","volume-title":"ACM CCS 2024","author":"Bandarupalli Akhil","year":"2023","unstructured":"Akhil Bandarupalli, Adithya Bhat, Saurabh Bagchi, Aniket Kate, and Michael K. Reiter. 2024. Random Beacons in Monte Carlo: Efficient Asynchronous Random Beacon without Threshold Cryptography. ACM CCS 2024. https:\/\/eprint.iacr.org\/2023\/1755."},{"key":"e_1_3_2_2_5_1","volume-title":"Velox: Scalable Fair Asynchronous MPC from Lightweight Cryptography. Cryptology ePrint Archive, Paper 2025\/1630. https:\/\/eprint.iacr.org\/2025\/1630","author":"Bandarupalli Akhil","year":"2025","unstructured":"Akhil Bandarupalli, Xiaoyu Ji, Aniket Kate, Chen-Da Liu-Zhang, Daniel P\u00f6llmann, and Yifan Song. 2025b. Velox: Scalable Fair Asynchronous MPC from Lightweight Cryptography. Cryptology ePrint Archive, Paper 2025\/1630. https:\/\/eprint.iacr.org\/2025\/1630"},{"key":"e_1_3_2_2_6_1","volume-title":"Computationally Efficient Asynchronous MPC with Linear Communication and Low Additive Overhead. In CRYPTO 2025","author":"Bandarupalli Akhil","year":"2025","unstructured":"Akhil Bandarupalli, Xiaoyu Ji, Aniket Kate, Chen-Da Liu-Zhang, and Yifan Song. 2025a. Computationally Efficient Asynchronous MPC with Linear Communication and Low Additive Overhead. In CRYPTO 2025. https:\/\/eprint.iacr.org\/2024\/1666"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198088"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198088"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_13"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2005.9"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_2_14_1","unstructured":"Ran Canetti and Tal Rabin. 1998. Fast Asynchronous Byzantine Agreement with Optimal Resilience. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.8.8120"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90453-1_2"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684464.2684470"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09451-9"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49387-8_8"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670327"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484808"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591861"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_27_1","first-page":"244","volume-title":"CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II 41","author":"Goyal Vipul","year":"2021","unstructured":"Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, and Yifan Song. 2021. ATLAS: efficient and scalable MPC in the honest majority setting. In Advances in Cryptology-CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II 41. Springer, 244-274."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68397-8_6"},{"key":"e_1_3_2_2_29_1","volume-title":"Malicious security comes free in honest-majority MPC. Cryptology ePrint Archive","author":"Goyal Vipul","year":"2020","unstructured":"Vipul Goyal and Yifan Song. 2020. Malicious security comes free in honest-majority MPC. Cryptology ePrint Archive (2020)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_19"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_39"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68397-8_13"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354238"},{"key":"e_1_3_2_2_34_1","unstructured":"Atsuki Momose. 2024. Practical Asynchronous MPC from Lightweight Cryptography. Cryptology ePrint Archive Paper 2024\/1717. https:\/\/eprint.iacr.org\/2024\/1717"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785953"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14496-7_7"},{"key":"e_1_3_2_2_37_1","unstructured":"Arpita Patra Ashish Choudhury and C. Pandu Rangan. 2008. Efficient Asynchronous Multiparty Computation with Optimal Resilience. Cryptology ePrint Archive Report 2008\/425. https:\/\/eprint.iacr.org\/2008\/425"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_24"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-024-09505-6"},{"key":"e_1_3_2_2_41_1","volume-title":"Dumbo-MPC: Efficient Fully Asynchronous MPC with Optimal Resilience. USENIX Security 2025","author":"Su Yuan","year":"2024","unstructured":"Yuan Su, Yuan Lu, Jiliang Li, Yuyi Wang, Chengyi Dong, and Qiang Tang. 2024. Dumbo-MPC: Efficient Fully Asynchronous MPC with Optimal Resilience. USENIX Security 2025 (2024)."},{"key":"e_1_3_2_2_42_1","volume-title":"Mohammad Alizadeh, Sreeram Kannan, and David Tse.","author":"Yang Lei","year":"2022","unstructured":"Lei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan, and David Tse. 2022. {DispersedLedger}:{High-Throughput} byzantine consensus on variable bandwidth networks. In 19th USENIX NSDI 22. 493-512."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.45"}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","location":"Taipei Taiwan","acronym":"CCS '25","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:21:53Z","timestamp":1766442113000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":43,"alternative-id":["10.1145\/3719027.3765114","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765114","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}