{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T17:40:02Z","timestamp":1745516402863,"version":"3.40.4"},"reference-count":56,"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":["62372449","62402272"],"award-info":[{"award-number":["62372449","62402272"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China","award":["2024YFA1013000"],"award-info":[{"award-number":["2024YFA1013000"]}]},{"name":"Major Programs of the National Social Science Foundation of China","award":["22&ZD147"],"award-info":[{"award-number":["22&ZD147"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3559456","type":"journal-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T17:53:13Z","timestamp":1744221193000},"page":"4183-4195","source":"Crossref","is-referenced-by-count":0,"title":["Charge Your Clients: Payable Secure Computation and Its Applications"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5403-2866","authenticated-orcid":false,"given":"Cong","family":"Zhang","sequence":"first","affiliation":[{"name":"Institute for Advanced Study, BNRist, Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4717-1604","authenticated-orcid":false,"given":"Liqiang","family":"Peng","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1466-7418","authenticated-orcid":false,"given":"Weiran","family":"Liu","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3982-4264","authenticated-orcid":false,"given":"Shuaishuai","family":"Li","sequence":"additional","affiliation":[{"name":"Zhongguancun Laboratory, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1545-1926","authenticated-orcid":false,"given":"Meng","family":"Hao","sequence":"additional","affiliation":[{"name":"School of Computing and Information Systems, Singapore Management University, Bras Basah, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3951-7889","authenticated-orcid":false,"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Cyberspace Security Defense, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.5334\/dsj-2019-022"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300078"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407800"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213582"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367548"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465335"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3076246.3076250"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064017"},{"volume-title":"Aws Data Exchange","year":"2023","key":"ref9"},{"key":"ref10","first-page":"162","article-title":"How to generate and exchange secrets (extended abstract)","volume-title":"Proc. FOCS","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. STOC","author":"Goldreich"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517855"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484760"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732948"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484778"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560658"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-57725-3_13"},{"key":"ref21","first-page":"2947","article-title":"Shuffle-based private set union: Faster and more secure","volume-title":"Proc. USENIX Secur.","author":"Jia"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243836"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2345396.2345421"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2770870"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44987-6_8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1540276.1540279"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993605"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448502"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236266"},{"key":"ref32","first-page":"3","article-title":"Private information retrieval by keywords","volume":"1","author":"Chor","year":"1997","journal-title":"IACR"},{"key":"ref33","first-page":"1811","article-title":"Communication\u2013computation trade-offs in PIR","volume-title":"Proc. USENIX","author":"Ali"},{"key":"ref34","first-page":"1723","article-title":"Constant-weight PIR: Single-round keyword PIR via constant-weight equality operators","volume-title":"Proc. USENIX Secur.","author":"Mahdavi"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574251"},{"key":"ref36","first-page":"3853","article-title":"Don\u2019t be dense: Efficient keyword PIR for sparse databases","volume-title":"Proc. USENIX Secur.","author":"Patel"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2012.048080"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559378"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511721656"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"ref49","first-page":"5","article-title":"Private set intersection: Are garbled circuits better than custom protocols?","volume-title":"Proc. NDSS","author":"Huang"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"ref51","first-page":"283","article-title":"Efficient unbalanced private set intersection cardinality and user-friendly privacy-preserving contact tracing","volume-title":"Proc. USENIX Secur.","author":"Wu"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-58387-6_11"},{"key":"ref53","first-page":"214","article-title":"Four||: Four-dimensional decompositions on a ||-curve over the Mersenne prime","volume-title":"Proc. ASIACRYPT","author":"Costello"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"ref56","first-page":"144","article-title":"Somewhat practical fully homomorphic encryption","volume":"2012","author":"Fan","year":"2012","journal-title":"IACR ePrint Arch."}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/10960351.pdf?arnumber=10960351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T17:04:26Z","timestamp":1745514266000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10960351\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3559456","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2025]]}}}