{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T04:10:04Z","timestamp":1747368604422,"version":"3.40.5"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62125204","92270201"],"award-info":[{"award-number":["62125204","92270201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tdsc.2024.3509820","type":"journal-article","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T18:44:24Z","timestamp":1733165064000},"page":"2398-2412","source":"Crossref","is-referenced-by-count":0,"title":["Improving the Efficiency of Private Function Evaluation via Optimized Universal Circuits"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-3350-0701","authenticated-orcid":false,"given":"Shuoyao","family":"Zhao","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9278-4521","authenticated-orcid":false,"given":"Yu","family":"Yu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3843-1394","authenticated-orcid":false,"given":"Hanlin","family":"Liu","sequence":"additional","affiliation":[{"name":"Shanghai Qi Zhi Institute, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4787-0316","authenticated-orcid":false,"given":"Jiang","family":"Zhang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Cryptology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenling","family":"Liu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-0933-9504","authenticated-orcid":false,"given":"Zhenkai","family":"Hu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800113.803649"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802478"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0009647"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0214058"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02252866"},{"key":"ref6","article-title":"Towards practical PFE: An efficient 2-party private function evaluation protocol based on half gates","volume-title":"Cryptol. ePrint Arch.","author":"Bicer","year":"2017"},{"key":"ref7","first-page":"15","article-title":"Secure outsourced computation in a multi-tenant cloud","volume-title":"Proc. IBM Workshop Cryptogr. Secur. Clouds","author":"Kamara"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85230-8_7"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref10","first-page":"162","article-title":"How to generate and exchange secrets (extended abstract)","volume-title":"Proc. 27th Annu. Symp. Found. Comput. Sci.","author":"Yao"},{"key":"ref11","first-page":"218","article-title":"How to play any mental game or A completeness theorem for protocols with honest majority","volume-title":"Proc. 19th Annu. ACM Symp. Theory Comput.","author":"Goldreich"},{"key":"ref12","article-title":"Valiant\u2019s universal circuit: Improvements, implementation, and applications","volume-title":"Cryptol. ePrint Arch.","author":"Lipmaa","year":"2016"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_22"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064025"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45022-X_43"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_14"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04444-1_26"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315307"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.158"},{"article-title":"Trust negotiation with hidden credentials, hidden policies, and policy cycles","volume-title":"Proc. Netw. Distrib. Syst. Secur. Symp.","author":"Frikken","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.30"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.31"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_31"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxt019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660366"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_9"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"ref29","article-title":"Fully secure attribute based encryption from multilinear maps","volume-title":"Cryptol. ePrint Arch.","author":"Garg","year":"2014"},{"key":"ref30","article-title":"Fully secure and succinct attribute based encryption for circuits from multi-linear maps","volume-title":"Cryptol. ePrint Arch.","author":"Attrapadung","year":"2014"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_27"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488677"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.20"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.13"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15618-7_12"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_15"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_26"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813666"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_15"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49890-3_27"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70697-9_16"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-020-09346-z"},{"volume-title":"The Complexity of Boolean Functions","year":"1987","author":"Wegener","key":"ref43"},{"key":"ref44","first-page":"287","article-title":"Fairplay - Secure two-party computation system","volume-title":"Proc. Conf. USENIX Secur. Symp.","author":"Malkhi"},{"article-title":"New techniques for private function evaluation","year":"2015","author":"Sadeghian","key":"ref45"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8721-4_1"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34578-5_15"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_13"},{"key":"ref50","first-page":"116","article-title":"Gr\u00e1fok \u00e9s m\u00e1trixok","volume":"38","author":"D\u00e9nes","year":"1931","journal-title":"Matematikai \u00e9s Fizikai Lapok"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1090\/chel\/367"},{"year":"2020","key":"ref52","article-title":"The C source code of our 2-way UC implementation"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"article-title":"Circuits of basic functions suitable for MPC and FHE","year":"2015","author":"Tillich","key":"ref54"},{"volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","year":"2013","author":"Johansson","key":"ref55"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8858\/10992672\/10772276.pdf?arnumber=10772276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T19:38:15Z","timestamp":1747337895000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10772276\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":55,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2024.3509820","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"type":"print","value":"1545-5971"},{"type":"electronic","value":"1941-0018"},{"type":"electronic","value":"2160-9209"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}