{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T11:01:16Z","timestamp":1756897276806,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2016YFB0800602"],"award-info":[{"award-number":["2016YFB0800602"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502048"],"award-info":[{"award-number":["61502048"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shandong Provincial Key Research and Development Program of China","award":["2018CXGC0701","2018GGX106005"],"award-info":[{"award-number":["2018CXGC0701","2018GGX106005"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2883775","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T20:03:02Z","timestamp":1543435382000},"page":"75639-75649","source":"Crossref","is-referenced-by-count":12,"title":["AntNest: Fully Non-Interactive Secure Multi-Party Computation"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7792-2669","authenticated-orcid":false,"given":"Lijing","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8418-1897","authenticated-orcid":false,"given":"Licheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4864-1811","authenticated-orcid":false,"given":"Yiru","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyi","family":"Ai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_17"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_15"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_14"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_18"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2847632"},{"key":"ref15","first-page":"503","article-title":"The round complexity of secure protocols (extended abstract)","author":"beaver","year":"1990","journal-title":"Proc 22nd Annu ACM Symp Theory Comput"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46497-7_24"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70500-2_22"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56614-6_6"},{"journal-title":"Gnu Multiple Precision Arithmetic Library","year":"2016","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53008-5_16"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56614-6_7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_16"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_15"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_35"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53008-5_14"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_16"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277716"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_19"},{"journal-title":"Pairing-Based Cryptography Library","year":"2017","key":"ref26"},{"key":"ref25","first-page":"319","article-title":"Pairing-friendly elliptic curves of prime order","author":"barreto","year":"2005","journal-title":"Proc 12th Int Workshop SAC"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08550709.pdf?arnumber=8550709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:15:49Z","timestamp":1642004149000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8550709\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2883775","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}