{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T08:08:42Z","timestamp":1767859722137,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690223","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"810-824","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["<i>Coral:<\/i>\n            Maliciously Secure Computation Framework for Packed and Mixed Circuits"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1338-611X","authenticated-orcid":false,"given":"Zhicong","family":"Huang","sequence":"first","affiliation":[{"name":"Ant Group, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2512-5274","authenticated-orcid":false,"given":"Wen-jie","family":"Lu","sequence":"additional","affiliation":[{"name":"Ant Group &amp; Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9242-2476","authenticated-orcid":false,"given":"Yuchen","family":"Wang","sequence":"additional","affiliation":[{"name":"Ant Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0477-0359","authenticated-orcid":false,"given":"Cheng","family":"Hong","sequence":"additional","affiliation":[{"name":"Ant Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9537-7051","authenticated-orcid":false,"given":"Tao","family":"Wei","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4281-1018","authenticated-orcid":false,"given":"WenGuang","family":"Chen","sequence":"additional","affiliation":[{"name":"Ant Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Smart, and Tim Wood","author":"Aly Abdelrahaman","year":"2019","unstructured":"Abdelrahaman Aly, Emmanuela Orsini, Dragos Rotaru, Nigel P. Smart, and Tim Wood. 2019. Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE. In WAHC@CCS. ACM, 33--44."},{"key":"e_1_3_2_1_2_1","volume-title":"CCS.","author":"Asharov Gilad","unstructured":"Gilad Asharov, Yehuda Lindell, Thomas Schneider, and Michael Zohner. 2013. More Efficient Oblivious Transfer and Extensions for Faster Secure Computation. In CCS. New York, NY, USA, 535--548."},{"key":"e_1_3_2_1_3_1","first-page":"169","article-title":"Semi-homomorphic Encryption and Multiparty Computation","volume":"6632","author":"Bendlin Rikke","year":"2011","unstructured":"Rikke Bendlin, Ivan Damg\u00e5rd, Claudio Orlandi, and Sarah Zakarias. 2011. Semi-homomorphic Encryption and Multiparty Computation. In EUROCRYPT, Vol. 6632. 169--188.","journal-title":"EUROCRYPT"},{"key":"e_1_3_2_1_4_1","first-page":"375","article-title":"Secure Computation with Constant Communication Overhead Using Multiplication Embeddings","volume":"11356","author":"Block Alexander R.","year":"2018","unstructured":"Alexander R. Block, Hemanta K. Maji, and Hai H. Nguyen. 2018. Secure Computation with Constant Communication Overhead Using Multiplication Embeddings. In INDOCRYPT, Vol. 11356. 375--398.","journal-title":"INDOCRYPT"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-021-00539-6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl Peter Rindal and Peter Scholl. 2019. Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In CCS. ACM 291--308.","DOI":"10.1145\/3319535.3354255"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-021-09403-1"},{"key":"e_1_3_2_1_8_1","volume-title":"CRYPTO (3) (Lecture Notes in Computer Science","author":"Cascudo Ignacio","unstructured":"Ignacio Cascudo, Ronald Cramer, Chaoping Xing, and Chen Yuan. 2018. Amortized Complexity of Information-Theoretically Secure MPC Revisited. In CRYPTO (3) (Lecture Notes in Computer Science, Vol. 10993). Springer, 395--426."},{"key":"e_1_3_2_1_9_1","volume-title":"TCC (2) (Lecture Notes in Computer Science","author":"Cascudo Ignacio","unstructured":"Ignacio Cascudo and Jaron Skovsted Gundersen. 2020. A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity. In TCC (2) (Lecture Notes in Computer Science, Vol. 12551). Springer, 652--682."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_13"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_15"},{"key":"e_1_3_2_1_13_1","volume-title":"CRYPTO (2) (Lecture Notes in Computer Science","author":"Cramer Ronald","unstructured":"Ronald Cramer, Ivan Damg\u00e5rd, Daniel Escudero, Peter Scholl, and Chaoping Xing. 2018. SPDmathbbZ_2^k: Efficient MPC mod 2^k for Dishonest Majority. In CRYPTO (2) (Lecture Notes in Computer Science, Vol. 10992). Springer, 769--798."},{"key":"e_1_3_2_1_14_1","volume-title":"CRYPTO (3) (Lecture Notes in Computer Science","author":"Cramer Ronald","unstructured":"Ronald Cramer, Matthieu Rambaud, and Chaoping Xing. 2021. Asymptotically-Good Arithmetic Secret Sharing over mathbbZ\/p^ellmathbbZ with Strong Multiplication and Its Applications to Efficient MPC. In CRYPTO (3) (Lecture Notes in Computer Science, Vol. 12827). Springer, 656--686."},{"key":"e_1_3_2_1_15_1","first-page":"1","article-title":"Practical Covertly Secure MPC for Dishonest Majority - Or","volume":"8134","author":"Damg\u00e5rd Ivan","year":"2013","unstructured":"Ivan Damg\u00e5rd, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, and Nigel P. Smart. 2013. Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits. In ESORICS, Vol. 8134. 1--18.","journal-title":"Breaking the SPDZ Limits. In ESORICS"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_1_17_1","first-page":"621","article-title":"Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing","volume":"7785","author":"Damg\u00e5rd Ivan","year":"2013","unstructured":"Ivan Damg\u00e5rd and Sarah Zakarias. 2013. Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing. In TCC, Vol. 7785. 621--641.","journal-title":"TCC"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00078"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Daniel Escudero Satrajit Ghosh Marcel Keller Rahul Rachuri and Peter Scholl. 2020. Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. In CRYPTO. 823--852.","DOI":"10.1007\/978-3-030-56880-1_29"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Daniel Escudero Chaoping Xing and Chen Yuan. 2022. More Efficient Dishonest Majority Secure Computation over mathbbZ^2^k via Galois Rings. In CRYPTO. 383--412.","DOI":"10.1007\/978-3-031-15802-5_14"},{"key":"e_1_3_2_1_21_1","volume-title":"ASIACRYPT (1) (Lecture Notes in Computer Science","author":"Frederiksen Tore Kasper","unstructured":"Tore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2015. A Unified Approach to MPC with Preprocessing Using OT. In ASIACRYPT (1) (Lecture Notes in Computer Science, Vol. 9452). Springer, 711--735."},{"key":"e_1_3_2_1_22_1","volume-title":"Public Key Cryptography (1)","author":"Frederiksen Tore Kasper","unstructured":"Tore Kasper Frederiksen, Benny Pinkas, and Avishay Yanai. 2018. Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments. In Public Key Cryptography (1), Vol. 10769. 587--619."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1992-1134730-7"},{"key":"e_1_3_2_1_24_1","volume-title":"Extending Oblivious Transfers Efficiently. In CRYPTO (Lecture Notes in Computer Science","volume":"161","author":"Ishai Yuval","year":"2003","unstructured":"Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. 2003 a. Extending Oblivious Transfers Efficiently. In CRYPTO (Lecture Notes in Computer Science, Vol. 2729). Springer, 145--161."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Joe Kilian Kobbi Nissim and Erez Petrank. 2003 b. Extending Oblivious Transfers Efficiently. In CRYPTO. 145--161.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417872"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_1_28_1","first-page":"158","article-title":"Overdrive","volume":"2018","author":"Keller Marcel","year":"2018","unstructured":"Marcel Keller, Valerio Pastro, and Dragos Rotaru. 2018. Overdrive: Making SPDZ Great Again. In EUROCRYPT 2018. 158--189.","journal-title":"Making SPDZ Great Again. In EUROCRYPT"},{"key":"e_1_3_2_1_29_1","volume-title":"Smart","author":"Larraia Enrique","year":"2014","unstructured":"Enrique Larraia, Emmanuela Orsini, and Nigel P. Smart. 2014. Dishonest Majority Multi-Party Computation for Binary Circuits. In CRYPTO (2), Vol. 8617. 495--512."},{"key":"e_1_3_2_1_30_1","unstructured":"KU Leuven. 2021. SCALE and MAMBA. https:\/\/github.com\/KULeuven-COSIC\/SCALE-MAMBA\/."},{"key":"e_1_3_2_1_31_1","volume-title":"Claudio Orlandi, and Sai Sheshank Burra.","author":"Nielsen Jesper Buus","year":"2012","unstructured":"Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, and Sai Sheshank Burra. 2012. A New Approach to Practical Active-Secure Two-Party Computation. In CRYPTO (Lecture Notes in Computer Science, Vol. 7417). Springer, 681--700."},{"key":"e_1_3_2_1_32_1","volume-title":"Smart, and Frederik Vercauteren","author":"Orsini Emmanuela","year":"2020","unstructured":"Emmanuela Orsini, Nigel P. Smart, and Frederik Vercauteren. 2020. Overdrive2k: Efficient Secure MPC over mathbbZ_2^k from Somewhat Homomorphic Encryption. In CT-RSA, Vol. 12006. Springer, 254--283."},{"key":"e_1_3_2_1_33_1","volume-title":"CRYPTO (Lecture Notes in Computer Science","volume":"486","author":"Pueyo Ignacio Cascudo","year":"2009","unstructured":"Ignacio Cascudo Pueyo, Hao Chen, Ronald Cramer, and Chaoping Xing. 2009. Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field. In CRYPTO (Lecture Notes in Computer Science, Vol. 5677). Springer, 466--486."},{"key":"e_1_3_2_1_34_1","unstructured":"Microsoft Research. 2024. EzPC: Easy Secure Multiparty Computation. https:\/\/github.com\/mpc-msri\/EzPC."},{"key":"e_1_3_2_1_35_1","unstructured":"Peter Rindal. 2024. libOTe: an efficient portable and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2023-0084"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-021-09416-w"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35423-7_12"},{"key":"e_1_3_2_1_39_1","volume-title":"NTL: A Library for doing Number Theory. https:\/\/libntl.org\/.","author":"Shoup Victor","year":"2023","unstructured":"Victor Shoup. 2023. NTL: A Library for doing Number Theory. https:\/\/libntl.org\/."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1244937"},{"key":"e_1_3_2_1_41_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2022. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017. Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation. In CCS. ACM 21--37.","DOI":"10.1145\/3133956.3134053"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017. Global-Scale Secure Multiparty Computation. In CCS. ACM 39--56.","DOI":"10.1145\/3133956.3133979"},{"key":"e_1_3_2_1_44_1","volume-title":"Ferret: Fast Extension for Correlated OT with Small Communication. In CCS. 1607--1626.","author":"Yang Kang","year":"2020","unstructured":"Kang Yang, Chenkai Weng, Xiao Lan, Jiang Zhang, and Xiao Wang. 2020. Ferret: Fast Extension for Correlated OT with Small Communication. In CCS. 1607--1626."}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690223","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:09:51Z","timestamp":1755842991000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":44,"alternative-id":["10.1145\/3658644.3690223","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690223","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}