{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:26:12Z","timestamp":1780053972189,"version":"3.54.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tc.2025.3585349","type":"journal-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T13:43:50Z","timestamp":1751463830000},"page":"3114-3128","source":"Crossref","is-referenced-by-count":3,"title":["RO(SE)2: Search-Efficient Robust Searchable Encryption With Forward and Backward Security"],"prefix":"10.1109","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0094-6245","authenticated-orcid":false,"given":"Xu","family":"Yang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4381-5026","authenticated-orcid":false,"given":"Qiuhao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0394-4432","authenticated-orcid":false,"given":"Saiyu","family":"Qi","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4668-5367","authenticated-orcid":false,"given":"Ke","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7682-5653","authenticated-orcid":false,"given":"Yong","family":"Qi","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243833"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29962-0_14"},{"key":"ref3","first-page":"1","article-title":"The power of bamboo: On the post-compromise ty for searchable symmetric encryption","volume-title":"Proc. NDSS","author":"Chen","year":"2023"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP53844.2022.00043"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3155977"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3463971"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"ref8","article-title":"Secure indexes","author":"Goh","year":"2003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2023.3281857"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2023.110108"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom60117.2023.00177"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"key":"ref14","first-page":"1143","article-title":"$\\sum$\u2211o$\\varphi$\u03c6o$\\varsigma$\u03c2: Forward secure searchable encryption","volume-title":"Proc. CCS","author":"Bost","year":"2016"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133980"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.3033412"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3282133"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2024.3445343"},{"key":"ref19","first-page":"707","article-title":"All your queries are belong to us: The power of file-injection attacks on searchable encryption","volume-title":"Proc. USENIX Secur.","author":"Zhang","year":"2016"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-88428-4_1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2025.3566086"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660314"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_30"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23298"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2018.2822294"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133970"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_20"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_6"},{"key":"ref29","first-page":"2527","article-title":"I\/o-efficient dynamic searchable encryption meets forward & backward privacy","volume-title":"Proc. USENIX Secur.","author":"Mondal","year":"2024"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2991079.2991088"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23264"},{"key":"ref32","first-page":"2425","article-title":"Dynamic searchable encryption with optimal search in the presence of deletions","volume-title":"Proc. USENIX Secur.","author":"Chamani","year":"2022"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2020.24423"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2024.3485172"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2025.3526062"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-40061-5_12"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29962-0_15"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/RoEduNet51892.2020.9324881"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3391914"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882911"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/12\/11121311\/11062890.pdf?arnumber=11062890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T20:46:19Z","timestamp":1754945179000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11062890\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":41,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tc.2025.3585349","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}