{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:32:52Z","timestamp":1782970372726,"version":"3.54.5"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"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":["61972094"],"award-info":[{"award-number":["61972094"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62032005"],"award-info":[{"award-number":["62032005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science Foundation of Fujian Provincial Science and Technology Agency","award":["2020J02016"],"award-info":[{"award-number":["2020J02016"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2023,9,1]]},"DOI":"10.1109\/tdsc.2022.3206758","type":"journal-article","created":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T19:32:56Z","timestamp":1663270376000},"page":"4101-4117","source":"Crossref","is-referenced-by-count":3,"title":["Differentially Oblivious Two-Party Pattern Matching With Sublinear Round Complexity"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0896-9476","authenticated-orcid":false,"given":"Pengfei","family":"Wu","sequence":"first","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7165-398X","authenticated-orcid":false,"given":"Jianting","family":"Ning","sequence":"additional","affiliation":[{"name":"Fujian Provincial Key Laboratory of Network Security and Cryptology, College of Computer and Cyber Security, Fujian Normal University, Fuzhou, Fujian, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0070-1707","authenticated-orcid":false,"given":"Xinyi","family":"Huang","sequence":"additional","affiliation":[{"name":"Thrust of Artificial Intelligence, Information Hub, Hong Kong University of Science and Technology (Guangzhou), Guangzhou, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6656-6240","authenticated-orcid":false,"given":"Joseph K.","family":"Liu","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Monash University, Layton, VIC, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866361"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2021.3123511"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45744-4_7"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516744"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2897845.2897906"},{"key":"ref59","first-page":"11631","article-title":"Numerical composition of differential privacy","author":"gopi","year":"2021","journal-title":"Proc 34th Annu Conf Neural Inf Process Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2903651"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref53","article-title":"Basic tail and concentration bounds","year":"2015"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24173"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2581316"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813664"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03326-2_5"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_23"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2017.2763593"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_12"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-018-0410-8"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-130481"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0177-2"},{"key":"ref45","first-page":"325","article-title":"How much is enough? Choosing ? for differential privacy","author":"lee","year":"0","journal-title":"Proc 14th Int Conf Inf Secur"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_23"},{"key":"ref47","author":"siim","year":"2014"},{"key":"ref42","article-title":"Human genome project, chromosome 15","year":"2020"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref44","article-title":"Amazon EC2 On-Demand Pricing","year":"2020"},{"key":"ref43","first-page":"13635","article-title":"An algorithmic framework for differentially private data analysis on trusted processors","author":"allen","year":"2019","journal-title":"Proc 33 rd Annu Conf Neural Inf Process Syst"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_15"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243810"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96878-0_25"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2825141"},{"key":"ref4","year":"2020"},{"key":"ref3","year":"2020"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218595"},{"key":"ref5","year":"2020"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-59140-557-3.ch189"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2905555"},{"key":"ref34","first-page":"1441","article-title":"A lightweight privacy-preserving CNN feature extraction framework for mobile sensing","volume":"18","author":"huang","year":"2021","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3196535"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0026"},{"key":"ref30","first-page":"1","article-title":"Exploring differential obliviousness","author":"beimel","year":"2019","journal-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2932444"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.85"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3321705.3329822"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"ref38","first-page":"420","article-title":"Efficient multiparty protocols using circuit randomization","author":"beaver","year":"1991","journal-title":"Proc 11th Annu Int Cryptol Conf"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155279"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0219072"},{"key":"ref20","first-page":"420","article-title":"Fully homomorphic encryption with relatively small key and ciphertext sizes","author":"smart","year":"2010","journal-title":"Proc 13th Int Conf Pract Theory Public Key Cryptogr"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"ref21","article-title":"Access pattern disclosure on searchable encryption: Ramification, attack and mitigation","author":"islam","year":"2012","journal-title":"Proc 19th Annu Netw Distrib System Secur Symp"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.150"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243851"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2021.3106317"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/10236919\/09893327.pdf?arnumber=9893327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T18:46:32Z","timestamp":1695667592000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9893327\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,1]]},"references-count":59,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2022.3206758","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"value":"1545-5971","type":"print"},{"value":"1941-0018","type":"electronic"},{"value":"2160-9209","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,1]]}}}