{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:33:08Z","timestamp":1784997188128,"version":"3.55.0"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"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. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tkde.2025.3537613","type":"journal-article","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T18:37:54Z","timestamp":1738348674000},"page":"2802-2815","source":"Crossref","is-referenced-by-count":11,"title":["Pattern Hiding and Authorized Searchable Encryption for Data Sharing in Cloud Storage"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9728-4051","authenticated-orcid":false,"given":"Kai","family":"Zhang","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Shanghai University of Electric Power, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8745-7031","authenticated-orcid":false,"given":"Boli","family":"Hu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Shanghai University of Electric Power, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7165-398X","authenticated-orcid":false,"given":"Jianting","family":"Ning","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2281-4112","authenticated-orcid":false,"given":"Junqing","family":"Gong","sequence":"additional","affiliation":[{"name":"Software Engineering Institute, East China Normal University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4920-5405","authenticated-orcid":false,"given":"Haifeng","family":"Qian","sequence":"additional","affiliation":[{"name":"Software Engineering Institute, East China Normal University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Cost of a data breach report","year":"2023"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"ref3","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":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"ref6","article-title":"Access pattern disclosure on searchable encryption: Ramification, attack and mitigation","volume-title":"Proc. Netw. Distrib. Syst. Secur. Symp.","author":"Islam"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243753"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3356728"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2020.2973139"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.3042058"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxy134"},{"key":"ref12","first-page":"2545","article-title":"Fease: Fast and expressive asymmetric searchable encryption","volume-title":"Proc. 33rd USENIX Secur. Symp.","author":"Meng","year":"2024"},{"issue":"3","key":"ref13","first-page":"502","article-title":"A data sorting and searching scheme based on distributed asymmetric searchable encryption","volume":"20","author":"Zou","year":"2018","journal-title":"Int. J. Netw. Secur."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2014.2379646"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3398036"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30620-4_17"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09479-x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2457903"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2021.3076580"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3421508"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2021.103009"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.tcs.2018.06.048","article-title":"Efficient public key encryption with equality test in the standard model","volume":"755","author":"Zhang","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978401"},{"key":"ref25","first-page":"143","article-title":"A highly accurate $\\lbrace${Query-Recovery $\\rbrace$} attack against searchable encryption using $\\lbrace${ Non-Indexed$\\rbrace$} documents","volume-title":"Proc. 30th USENIX Secur. Symp.","author":"Damie","year":"2021"},{"key":"ref26","first-page":"127","article-title":"Hiding the access pattern is not enough: Exploiting search pattern leakage in searchable encryption","volume-title":"Proc. 30th USENIX Secur. Symp.","author":"Oya"},{"key":"ref27","first-page":"119","article-title":"Probabilistic public key encryption with equality test","volume-title":"Proc. Topics Cryptol.-CT-RSA 2010: Cryptographers\u2019 Track RSA Conf.","author":"Yang"},{"key":"ref28","first-page":"389","article-title":"Towards public key encryption scheme supporting equality test with fine-grained authorization","volume-title":"Proc. Australas. Conf. Inf. Secur. Privacy","author":"Tang"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2378592"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.tcs.2022.06.034","article-title":"Lattice-based public-key encryption with equality test supporting flexible authorization in standard model","volume":"929","author":"Sarathi","year":"2022","journal-title":"Theor. Comput. Sci."},{"key":"ref31","first-page":"1","article-title":"Efficient private matching and set intersection","volume-title":"Proc. Int. Conf. Theory Appl. Cryptographic Techn.","author":"Michael"},{"key":"ref32","first-page":"1223","article-title":"Labeled PSI from fully homomorphic encryption with malicious security","volume-title":"Proc. ACM SIGSAC Conf. Comput. Commun. Secur.","author":"Chen"},{"key":"ref33","first-page":"1243","article-title":"Fast private set intersection from homomorphic encryption","volume-title":"Proc. ACM SIGSAC Conf. Comput. Commun. Secur.","author":"Chen"},{"key":"ref34","first-page":"818","article-title":"Efficient batched oblivious PRF with applications to private set intersection","volume-title":"Proc. ACM SIGSAC Conf. Comput. Commun. Secur.","author":"Kolesnikov"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2021.3101059"},{"key":"ref37","first-page":"506","article-title":"Public key encryption with keyword search","volume-title":"Proc. Adv. Cryptol.-Eurocrypt 2004: Int. Conf. Theory Appl. Cryptographic Techn.","author":"Boneh"},{"key":"ref38","first-page":"205","article-title":"Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions","volume-title":"Proc. 25th Annu. Int. Cryptol. Conf.","author":"Abdalla"},{"key":"ref39","first-page":"535","article-title":"Conjunctive, subset, and range queries on encrypted data","volume-title":"Proc. Theory Cryptogr.: 4th Theory Cryptogr. Conf.","author":"Boneh"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462196"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.ins.2013.03.008","article-title":"Public key encryption with keyword search secure against keyword guessing attacks without random oracle","volume":"238","author":"Fang","year":"2013","journal-title":"Inf. Sci."},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2510822"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2703922"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.2968425"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2022.3227650"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10948402\/10869376.pdf?arnumber=10869376","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T03:24:31Z","timestamp":1743996271000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10869376\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":44,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3537613","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}