{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T18:22:15Z","timestamp":1782584535024,"version":"3.54.5"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62172258"],"award-info":[{"award-number":["62172258"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62472252"],"award-info":[{"award-number":["62472252"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62325209"],"award-info":[{"award-number":["62325209"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Research Project of the Quan Cheng Laboratory, China","award":["QCL20250204"],"award-info":[{"award-number":["QCL20250204"]}]},{"DOI":"10.13039\/100012905","name":"Department of Science and Technology of Shandong Province","doi-asserted-by":"crossref","award":["SYS202201"],"award-info":[{"award-number":["SYS202201"]}],"id":[{"id":"10.13039\/100012905","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tifs.2026.3674036","type":"journal-article","created":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T19:52:27Z","timestamp":1773431547000},"page":"2947-2961","source":"Crossref","is-referenced-by-count":1,"title":["Dishonest Majority Passive-to-Active Compiler Over Rings for MPC With Constant Online Communication"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-5178-9098","authenticated-orcid":false,"given":"Jiandong","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Software Engineering, Shandong University, Jinan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4909-367X","authenticated-orcid":false,"given":"Han","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Shandong University, Jinan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4201-5880","authenticated-orcid":false,"given":"Chenkai","family":"Zeng","sequence":"additional","affiliation":[{"name":"National Cybersecurity School, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6927-7855","authenticated-orcid":false,"given":"Qi","family":"Feng","sequence":"additional","affiliation":[{"name":"National Cybersecurity School, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2446-7436","authenticated-orcid":false,"given":"Debiao","family":"He","sequence":"additional","affiliation":[{"name":"National Cybersecurity School, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9106-6010","authenticated-orcid":false,"given":"Chuan","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, University of Jinan, Jinan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunxue","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Shandong University, Jinan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5277-8453","authenticated-orcid":false,"given":"Qiuliang","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Shandong University, Jinan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"ref2","first-page":"35","article-title":"ABY3: A mixed protocol framework for machine learning","volume-title":"Proc. ACM SIGSAC Conf. Comput. Commun. Secur.","author":"Mohassel"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_34"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2023.3271888"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-67907-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2024.3409089"},{"key":"ref7","article-title":"Helix: Scalable multi-party machine learning inference against malicious adversaries","author":"Zhang","year":"2025","journal-title":"Cryptol. ePrint Archive"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2020-0036"},{"key":"ref9","first-page":"2651","article-title":"SWIFT: Super-fast and robust privacy-preserving machine learning","volume-title":"Proc. 30th USENIX Secur. Symp. (USENIX Secur.)","author":"Koti"},{"key":"ref10","first-page":"2183","article-title":"Fantastic four: honest-majority four-party secure computation with malicious security","volume-title":"Proc. USENIX Secur. Symp.","author":"Dalskov"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24058"},{"key":"ref12","first-page":"769","article-title":"SPDZ2K: Efficient MPC mod 2K for dishonest majority","volume-title":"Proc. Annu. Int. Cryptol. Conf.","author":"Cramer"},{"key":"ref13","first-page":"471","article-title":"Efficient information-theoretic secure multiparty computation over via Galois rings","volume-title":"Proc. Theory Cryptography Conf.","author":"Abspoel"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_16"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_15"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref18","article-title":"Lookup arguments: Improvements, extensions and applications to zero-knowledge decision trees","author":"Campanelli","year":"2023","journal-title":"Cryptol. ePrint Archive"},{"key":"ref19","article-title":"Efficient fully secure computation via distributed zero-knowledge proofs","author":"Boyle","year":"2020","journal-title":"Cryptol. ePrint Archive"},{"key":"ref20","article-title":"Efficient 3PC for binary circuits with application to maliciously-secure DNN inference","author":"Li","year":"2023","journal-title":"Cryptol. ePrint Archive"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3690260"},{"key":"ref22","article-title":"Attaining GOD beyond honest majority with friends and foes","author":"Hegde","year":"2022","journal-title":"Cryptol. ePrint Archive"},{"key":"ref23","article-title":"An efficient passive-to-active compiler for honest-majority MPC over rings","author":"Abspoel","year":"2019","journal-title":"Cryptol. ePrint Archive"},{"key":"ref24","article-title":"Fast fully secure multi-party computation over any ring with two-thirds honest majority","author":"Dalskov","year":"2022","journal-title":"Cryptol. ePrint Archive"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68397-8_5"},{"key":"ref26","first-page":"254","article-title":"Overdrive2k: Efficient secure mpc over Z2K from somewhat homomorphic encryption","volume-title":"Proc. Topics Cryptol.-CT-RSACryptographers Track RSA Conf.","volume":"12006","author":"Orsini"},{"key":"ref27","first-page":"383","article-title":"More efficient dishonest majority secure computation over Z2K via Galois rings","volume-title":"Proc. Annu. Int. Cryptol. Conf.","author":"Escudero"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"3534","DOI":"10.1109\/TIFS.2025.3550834","article-title":"MD-SONIC: Maliciously-secure outsourcing neural network inference with reduced online communication","volume":"20","author":"Zhang","year":"2025","journal-title":"IEEE Trans. Inf. Forensics Security"},{"key":"ref29","article-title":"Coral: Maliciously secure computation framework for packed and mixed circuits","author":"Huang","year":"2024","journal-title":"Cryptol. ePrint Archive"},{"key":"ref30","article-title":"Actively secure MPC in the dishonest majority setting: Achieving constant complexity in online communication, computation per gate, rounds, and private input size","author":"Lee","year":"2025","journal-title":"Cryptol. ePrint Archive"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-76578-5_20"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64378-2_23"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09322-2"},{"key":"ref35","article-title":"Dishonest majority constant-round MPC with linear communication from DDH","author":"Goyal","year":"2024","journal-title":"Cryptol. ePrint Archive"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1142\/5350"},{"key":"ref37","first-page":"656","article-title":"Asymptotically-good arithmetic secret sharing over z\/plz with strong multiplication and its applications to efficient MPC","volume-title":"Proc. 41st Annu. Int. Cryptol. Conf.","author":"Cramer"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8721-4_4"},{"key":"ref39","first-page":"424","article-title":"More efficient zero-knowledge protocols over Z2K via Galois rings","volume-title":"Proc. Annu. Int. Cryptol. Conf.","author":"Lin"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"ref42","article-title":"Turbospeedz: Double your online SPDZ! improving SPDZ using function dependent preprocessing","author":"Efraim","year":"2019","journal-title":"Cryptol. ePrint Archive"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03326-2_20"},{"key":"ref44","article-title":"Caulk+: Table-independent lookup arguments","author":"Posen","year":"2022","journal-title":"Cryptol. ePrint Archive"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"ref46","article-title":"cq: Cached quotients for fast lookups","author":"Eagen","year":"2022","journal-title":"Cryptol. ePrint Arch."},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833697"},{"key":"ref48","first-page":"6329","article-title":"Secure floating-point training","volume-title":"Proc. 32nd USENIX Secur. Symp.","author":"Rathee"},{"key":"ref49","article-title":"Multivariate lookups based on logarithmic derivatives","author":"Hab\u00f6ck","year":"2022","journal-title":"Cryptol. ePrint Arch."},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_12"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417872"},{"key":"ref52","article-title":"Waks-on\/waks-off: Fast oblivious offline\/online shuffling and sorting with waksman networks","author":"Sasy","year":"2023","journal-title":"Cryptol. ePrint Archive"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58740-5_7"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/11313711\/11434558.pdf?arnumber=11434558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T04:47:42Z","timestamp":1774068462000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11434558\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/tifs.2026.3674036","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}