{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:26:36Z","timestamp":1740144396229,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":"publisher","award":["62072401","62232002"],"award-info":[{"award-number":["62072401","62232002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Input Output"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2024.3494547","type":"journal-article","created":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T18:36:53Z","timestamp":1731091013000},"page":"114-128","source":"Crossref","is-referenced-by-count":0,"title":["Load-Balanced Server-Aided MPC in Heterogeneous Computing"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7015-7148","authenticated-orcid":false,"given":"Yibiao","family":"Lu","sequence":"first","affiliation":[{"name":"State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8961-0723","authenticated-orcid":false,"given":"Bingsheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1969-2591","authenticated-orcid":false,"given":"Kui","family":"Ren","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"162","article-title":"How to generate and exchange secrets (extended abstract)","volume-title":"Proc. IEEE Symp. Found. Comput. Sci. (FOCS)","author":"Yao"},{"key":"ref2","first-page":"218","article-title":"How to play any mental game or A completeness theorem for protocols with honest majority","volume-title":"Proc. ACM Symp. Theory Comput. (STOC)","author":"Goldreich"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/3133956.3133979"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1007\/978-3-642-32009-5_38"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/3-540-44987-6_18"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/2213977.2214086"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/978-3-030-84245-1_3"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/978-3-030-84245-1_4"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1007\/11818175_30"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1007\/978-3-540-74143-5_32"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1007\/978-3-540-85174-5_14"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/978-3-662-48000-7_35"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/978-3-030-77886-6_23"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/2382196.2382280"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.3233\/jcs-150540"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1145\/2664243.2664255"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TDSC.2020.2966632"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/TDSC.2023.3322397"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1515\/popets-2016-0033"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1145\/336992.337028"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1007\/978-3-540-70583-3_40"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1007\/978-3-662-46803-6_8"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/CCGRID.2017.101"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1145\/3205455.3205464"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1137\/18M1176865"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TCBB.2019.2914051"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/100216.100287"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1007\/978-3-662-53890-6_34"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1007\/978-3-030-84242-0_5"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1145\/3133956.3134053"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1145\/2976749.2978347"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1145\/2382196.2382279"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1109\/SFCS.2001.959888"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1145\/3133956.3133991"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1990","author":"Garey","key":"ref36"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1109\/DAC.1997.597204"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1145\/321623.321627"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/SFCS.2000.892070"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1007\/978-3-642-28914-9_3"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1145\/2976749.2978410"},{"volume-title":"EMP-toolkit: Efficient MultiParty Computation Toolkit","year":"2016","author":"Wang","key":"ref43"},{"volume-title":"\u2019Bristol Fashion\u2019 MPC Circuits","year":"2024","author":"Archer","key":"ref44"},{"volume-title":"DagP: A Directed Acyclic Graph Partitioning Tool","year":"2020","author":"Herrmann","key":"ref45"},{"volume-title":"Semi-Honest-BMR","year":"2016","author":"Ben-Efraim","key":"ref46"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/10747497.pdf?arnumber=10747497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T08:20:43Z","timestamp":1735719643000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10747497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/tifs.2024.3494547","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2025]]}}}