{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T18:26:12Z","timestamp":1776277572175,"version":"3.50.1"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["2022YFB2701600"],"award-info":[{"award-number":["2022YFB2701600"]}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["M21033"],"award-info":[{"award-number":["M21033"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["M22038"],"award-info":[{"award-number":["M22038"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tbdata.2024.3442540","type":"journal-article","created":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T18:03:13Z","timestamp":1724954593000},"page":"1259-1272","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Forward and Backward Private Conjunctive Searchable Encryption With Comprehensive Verification"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-7351-4554","authenticated-orcid":false,"given":"Yue","family":"Ge","sequence":"first","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8992-651X","authenticated-orcid":false,"given":"Ying","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0489-9412","authenticated-orcid":false,"given":"Lin","family":"Qi","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4276-0070","authenticated-orcid":false,"given":"Jiankai","family":"Qiu","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23298"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_30"},{"key":"ref4","first-page":"707","article-title":"All your queries are belong to us: The power of file-injection attacks on searchable encryption","volume-title":"Proc. 25th USENIX Secur. Symp.","author":"Zhang"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133980"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1108\/eb046814"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6364125"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23264"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2018-0002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_22"},{"key":"ref12","first-page":"1143","article-title":"$\\Sigma o \\phi o\\varsigma$\u03a3o\u03c6o\u03c2: Forward secure searchable encryption","volume-title":"Proc. 23rd ACM SIGSAC Conf. Comput. Commun. Secur.","author":"Bost"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133970"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2018.2822294"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243833"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243782"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2021.3093304"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-88428-4_1"},{"key":"ref19","first-page":"2425","article-title":"Dynamic searchable encryption with optimal search in the presence of deletions","volume-title":"Proc. 31st USENIX Secur. Symp.","author":"Chamani"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24852-1_3"},{"key":"ref21","article-title":"Searchable encryption for conjunctive queries with extended forward and backward privacy","volume-title":"Proc. IACR Cryptol. ePrint Arch.","volume":"2021","author":"Zuo","year":"2021"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/11774716_15"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89641-8_13"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxac084"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-021-0601-8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29962-0_15"},{"key":"ref28","first-page":"275","article-title":"Accumulators from bilinear pairings and applications to id-based ring signatures and group membership revocation","volume-title":"Proc. Cryptographers Track RSA Conf.","author":"Nguyen"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243753"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.122"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0517-6"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.23116"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32946-3_21"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CNS.2015.7346876"},{"key":"ref37","article-title":"Verifiable dynamic symmetric searchable encryption: Optimality and forward security","volume":"2016","author":"Bost","year":"2016","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218596"},{"key":"ref39","article-title":"Verifiable and forward private conjunctive keyword search from DIA tree","volume":"2022","author":"Laltu","year":"2022","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98989-1_5"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0489-y"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2019.2922177"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315318"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45744-4_8"},{"key":"ref45","article-title":"Supporting non-membership proofs with bilinear-map accumulators","volume":"2008","author":"Damgard","year":"2008","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3205668"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3274390"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2601070"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2018.2789893"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2020.2975184"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3262060"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6687317\/11003987\/10659203.pdf?arnumber=10659203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T19:37:35Z","timestamp":1747337855000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10659203\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":51,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2024.3442540","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}