{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:33:30Z","timestamp":1772120010189,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T00:00:00Z","timestamp":1684972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T00:00:00Z","timestamp":1684972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s12083-023-01488-8","type":"journal-article","created":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T07:02:25Z","timestamp":1684998145000},"page":"1716-1738","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A searchable encryption scheme with hidden search pattern and access pattern on distributed cloud system"],"prefix":"10.1007","volume":"16","author":[{"given":"Shengchen","family":"Duan","sequence":"first","affiliation":[]},{"given":"Hong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Lize","family":"Gu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"1488_CR1","unstructured":"Song DX, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. Proc IEEE Symp Sec Priv IEEE 44\u201355"},{"key":"1488_CR2","unstructured":"Goh EJ et al (2003) Secure incidences. In IACR Cryptol, ePrint Arch 216"},{"key":"1488_CR3","doi-asserted-by":"publisher","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2006","unstructured":"Curtmola R, Garay J, Kamara S, Ostrovsky R (2006) Searchable symmetric encryption: Improved definitions and efficient constructions. J Comput Secur 19:895\u2013934","journal-title":"J Comput Secur"},{"key":"1488_CR4","doi-asserted-by":"crossref","unstructured":"Kamara S, Papamanthou C, Roeder T (2012) Dynamic searchable symmetric encryption. Proc ACM Conf Comput Commun Sec 965\u2013976\u00a0","DOI":"10.1145\/2382196.2382298"},{"key":"1488_CR5","first-page":"12","volume":"20","author":"MS Islam","year":"2012","unstructured":"Islam MS, Kuzu M, Kantarcioglu M (2012) Access pattern disclosure on searchable encryption: ramification, attack and mitigation. Ndss 20:12","journal-title":"Ndss"},{"key":"1488_CR6","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ins.2013.11.021","volume":"265","author":"C Liu","year":"2014","unstructured":"Liu C, Zhu L, Wang M, Tan Y-A (2014) Search pattern leakage in searchable encryption: Attacks and new construction. Inf Sci 265:176\u2013188","journal-title":"Inf Sci"},{"key":"1488_CR7","doi-asserted-by":"crossref","unstructured":"Cash D, Grubbs P, Perry J, Ristenpart T (2015) Leakage-abuse attacks against searchable encryption. Proc ACM SIGSAC Conf Comput Commun Sec 668\u2013679\u00a0","DOI":"10.1145\/2810103.2813700"},{"key":"1488_CR8","unstructured":"Zhang Y, Katz J, Papamanthou C (2016) All your queries are belong to us: The power of file-injection attacks on searchable encryption. In: 25th {USENIX} Security Symposium ({USENIX} Security 16), pp. 707\u2013720"},{"key":"1488_CR9","unstructured":"Oya S, Kerschbaum F (2021) Hiding the access pattern is not enough: Exploiting search pattern leakage in searchable encryption. USENIX Sec Symp (USENIX Security 21) 127\u2013142"},{"key":"1488_CR10","unstructured":"Hoang T, Yavuz AA, Guajardo J (2017) A high-security searchable encryption framework for privacy-critical cloud storage services. IACR Cryptol, ePrint Arch 1237"},{"key":"1488_CR11","doi-asserted-by":"crossref","unstructured":"Stefanov E, Papamanthou C, Shi E (2014) Practical dynamic searchable encryption with small leakage. NDSS 72\u201375","DOI":"10.14722\/ndss.2014.23298"},{"key":"1488_CR12","doi-asserted-by":"crossref","unstructured":"Bost R, Minaud B, Ohrimenko O (2017) Forward and backward private searchable encryption from constrained cryptographic primitives. Proc ACM SIGSAC Conf Comput Commun Sec 1465\u20131482","DOI":"10.1145\/3133956.3133980"},{"key":"1488_CR13","doi-asserted-by":"crossref","unstructured":"Sun S-F, Yuan X, Liu JK, Steinfeld R, Sakzad A, Vo V, Nepal S (2018) Practical backward-secure searchable encryption from symmetric puncturable encryption. Proc ACM SIGSAC Conf Comput Commun Sec 763\u2013780","DOI":"10.1145\/3243734.3243782"},{"issue":"3","key":"1488_CR14","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich O, Ostrovsky R (1996) Software protection and simulation on oblivious rams. J ACM (JACM) 43(3):431\u2013473","journal-title":"J ACM (JACM)"},{"key":"1488_CR15","doi-asserted-by":"crossref","unstructured":"Zhang J, Ma Q, Zhang W, Qiao D (2016) Tskt-oram: A two-server k-ary tree oram for access pattern protection in cloud storage. In: MILCOM 2016\u20132016 IEEE Military Communications Conference, IEEE, pp. 527\u2013532","DOI":"10.1109\/MILCOM.2016.7795381"},{"key":"1488_CR16","first-page":"1010","volume":"2015","author":"S Garg","year":"2015","unstructured":"Garg S, Mohassel P, Papamanthou C (2015) Tworam: Round-optimal oblivious ram with applications to searchable encryption. IACR Cryptol ePrint Arch 2015:1010","journal-title":"IACR Cryptol ePrint Arch"},{"key":"1488_CR17","doi-asserted-by":"crossref","unstructured":"Kamara S, Moataz T, Ohrimenko O (2018) Structured encryption and leakage suppression. Ann Int Cryptol Conf, Springer 339\u2013370","DOI":"10.1007\/978-3-319-96884-1_12"},{"key":"1488_CR18","unstructured":"Dauterman E, Feng E, Luo E et al (2020) {DORY}: An encrypted search system with distributed trust. USENIX Symp Oper Syst Des Implement (OSDI 20) 1101\u20131119"},{"key":"1488_CR19","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1109\/TSC.2020.2973139","volume":"15","author":"Y Wang","year":"2020","unstructured":"Wang Y, Sun SF, Wang J et al (2020) Achieving searchable encryption scheme with search pattern hidden. IEEE Trans Serv Comput 15:1012\u20131025","journal-title":"IEEE Trans Serv Comput"},{"key":"1488_CR20","doi-asserted-by":"crossref","unstructured":"Hoang T, Yavuz AA, Guajardo J (2016) Practical and secure dynamic searchable encryption via oblivious access on distributed data structure. Proc Ann Conf Comput Sec Appl 302\u2013313","DOI":"10.1145\/2991079.2991088"},{"key":"1488_CR21","doi-asserted-by":"crossref","unstructured":"Hoang T, Yavuz AA, Durak FB, Guajardo J (2018) Oblivious dynamic searchable encryption on distributed cloud systems. IFIP Ann Conf Data Appl Sec Priv, Springer 113\u2013130","DOI":"10.1007\/978-3-319-95729-6_8"},{"issue":"3","key":"1488_CR22","first-page":"87","volume":"2019","author":"A Akavia","year":"2019","unstructured":"Akavia A, Gentry C, Halevi S, Leibovich M (2019) Setup-free secure search on encrypted data: Faster and post-processing free. Proc Priv Enh Technol 2019(3):87\u2013107","journal-title":"Proc Priv Enh Technol"},{"key":"1488_CR23","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: International Conference on the Theory and Applications of Cryptographic Techniques, Springer, pp. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"1488_CR24","doi-asserted-by":"crossref","unstructured":"Zhang Z, Wang K, Lin W, Fu AW-C, Wong RC-W (2019) Repeatable oblivious shuffling of large outsourced data blocks. Proc ACM Symp Cloud Comput 287\u2013298","DOI":"10.1145\/3357223.3362732"},{"key":"1488_CR25","doi-asserted-by":"crossref","unstructured":"Wang C, Cao N, Li J, Ren K, Lou W (2010) Secure ranked keyword search over encrypted cloud data. IEEE Int Conf Distrib Comput Syst IEEE 253\u2013262","DOI":"10.1109\/ICDCS.2010.34"},{"key":"1488_CR26","doi-asserted-by":"crossref","unstructured":"Sun W, Wang B, Cao N, Li M, Lou W, Hou YT, Li H (2013) Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking. Proc ACM SIGSAC Symp Inf Comput Commun Sec 71\u201382","DOI":"10.1145\/2484313.2484322"},{"issue":"1","key":"1488_CR27","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/TPDS.2013.45","volume":"25","author":"N Cao","year":"2013","unstructured":"Cao N, Wang C, Li M, Ren K, Lou W (2013) Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans Parallel Distrib Syst 25(1):222\u2013233","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"8","key":"1488_CR28","doi-asserted-by":"publisher","first-page":"3648","DOI":"10.1109\/TII.2018.2794442","volume":"14","author":"R Zhou","year":"2018","unstructured":"Zhou R, Zhang X, Du X, Wang X, Yang G, Guizani M (2018) File-centric multi-key aggregate keyword searchable encryption for industrial internet of things. IEEE Trans Industr Inf 14(8):3648\u20133658","journal-title":"IEEE Trans Industr Inf"},{"key":"1488_CR29","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.comnet.2018.01.034","volume":"133","author":"H Cui","year":"2018","unstructured":"Cui H, Deng RH, Lai J, Yi X, Nepal S (2018) An efficient and expressive ciphertext-policy attribute-based encryption scheme with partially hidden access structures, revisited. Comput Netw 133:157\u2013165","journal-title":"Comput Netw"},{"issue":"2","key":"1488_CR30","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TPDS.2015.2401003","volume":"27","author":"Z Xia","year":"2016","unstructured":"Xia Z, Wang X, Sun X, Wang Q (2016) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340\u2013352","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"1488_CR31","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/TDSC.2016.2599883","volume":"15","author":"H Cui","year":"2018","unstructured":"Cui H, Wan Z, Deng R, Wang G, Li Y (2018) Efficient and expressive keyword search over encrypted data in the cloud. IEEE Trans Dependable Secure Comput 15(3):409\u2013422","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"1488_CR32","doi-asserted-by":"crossref","unstructured":"Asharov G, Naor M, Segev G, Shahaf I (2016) Searchable symmetric encryption: optimal locality in linear space via twodimensional balanced allocations. Proc Ann ACM Symp Theory Comput 1101\u20131114","DOI":"10.1145\/2897518.2897562"},{"key":"1488_CR33","doi-asserted-by":"crossref","unstructured":"Demertzis I, Papamanthou C (2017) Fast searchable encryption with tunable locality. Proc ACM Int Conf Manag Data 1053\u20131067","DOI":"10.1145\/3035918.3064057"},{"key":"1488_CR34","doi-asserted-by":"crossref","unstructured":"Bost R (2016) o\u03d5o\u03c2: Forward secure searchable encryption. Proc ACM SIGSAC Conf Comput Commun Sec 1143\u20131154","DOI":"10.1145\/2976749.2978303"},{"key":"1488_CR35","doi-asserted-by":"crossref","unstructured":"Zhang R, Xue R, Yu T, Liu L (2016) Pvsae: A public verifiable searchable encryption service framework for outsourced encrypted data. IEEE Int Conf Web Serv (ICWS), IEEE 428\u2013435","DOI":"10.1109\/ICWS.2016.62"},{"key":"1488_CR36","doi-asserted-by":"publisher","first-page":"68384","DOI":"10.1109\/ACCESS.2018.2872743","volume":"6","author":"J Zhang","year":"2018","unstructured":"Zhang J, Song C, Wang Z, Yang T, Ma W (2018) Efficient and provable security searchable asymmetric encryption in the cloud. IEEE Access 6:68384\u201368393","journal-title":"IEEE Access"},{"issue":"4","key":"1488_CR37","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TSUSC.2017.2704163","volume":"2","author":"C Liu","year":"2017","unstructured":"Liu C, Zhu L, Chen J (2017) Graph encryption for top-k nearest keyword search queries on cloud. IEEE Trans Sustain Comput 2(4):371\u2013381","journal-title":"IEEE Trans Sustain Comput"},{"key":"1488_CR38","doi-asserted-by":"crossref","unstructured":"Kamara S, Moataz T (2017) Boolean searchable symmetric encryption with worst-case sub-linear complexity. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, pp. 94\u2013124","DOI":"10.1007\/978-3-319-56617-7_4"},{"key":"1488_CR39","doi-asserted-by":"publisher","first-page":"45725","DOI":"10.1109\/ACCESS.2018.2866031","volume":"6","author":"X Ge","year":"2018","unstructured":"Ge X, Yu J, Hu C, Zhang H, Hao R (2018) Enabling efficient verifiable fuzzy keyword search over encrypted data in cloud computing. IEEE Access 6:45725\u201345739","journal-title":"IEEE Access"},{"key":"1488_CR40","unstructured":"Demertzis I, Papadopoulos D, Papamanthou C, Shintre S (2020) {SEAL}: Attack mitigation for encrypted databases via adjustable leakage. In: 29th {USENIX} Security Symposium ({USENIX} Security 20), pp. 2433\u20132450"},{"key":"1488_CR41","doi-asserted-by":"crossref","unstructured":"Cash D, Jaeger J, Jarecki S, Jutla CS, Krawczyk H, Rosu M-C, Steiner M (2014) Dynamic searchable encryption in very-large databases: data structures and implementation. NDSS 23\u201326","DOI":"10.14722\/ndss.2014.23264"},{"key":"1488_CR42","unstructured":"Naveed M (2015) The fallacy of composition of oblivious ram and searchable encryption. IACR Cryptol, ePrint Arch 668"},{"key":"1488_CR43","doi-asserted-by":"crossref","unstructured":"Stefanov E, Van Dijk M, Shi E, Fletcher C, Ren L, Yu X, Devadas S (2013) Path oram: an extremely simple oblivious ram protocol. Proc ACM SIGSAC Conf Comput Commun Sec 299\u2013310","DOI":"10.1145\/2508859.2516660"},{"key":"1488_CR44","doi-asserted-by":"crossref","unstructured":"Chen G, Lai TH, Reiter MK, Zhang Y (2018) Differentially private access patterns for searchable symmetric encryption. IEEE INFOCOM Conf Comput Commun, IEEE 810\u2013818","DOI":"10.1109\/INFOCOM.2018.8486381"},{"key":"1488_CR45","doi-asserted-by":"crossref","unstructured":"Patel S, Persiano G, Yeoand K, Yung M (2019) Mitigating leakage in secure cloud-hosted data structures: Volume-hiding for multi-maps via hashing. Proc ACM SIGSAC Conf Comput Commun Sec 79\u201393","DOI":"10.1145\/3319535.3354213"},{"key":"1488_CR46","doi-asserted-by":"crossref","unstructured":"Dauterman E, Rathee M, Popa RA, Stoica I (2022) Waldo: A private time-series database from function secret sharing. IEEE Symp Sec Priv IEEE 2450\u20132468","DOI":"10.1109\/SP46214.2022.9833611"},{"key":"1488_CR47","doi-asserted-by":"crossref","unstructured":"Cheng H, Shojafar M, Alazab M, Tafazolli R, Liu Y (2021) PPVF: privacy-preserving protocol for vehicle feedback in cloud-assisted VANET. IEEE Trans Intell Transp Syst 1524\u20139050","DOI":"10.1109\/TITS.2021.3117950"},{"key":"1488_CR48","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.future.2022.03.032","volume":"133","author":"S Halder","year":"2022","unstructured":"Halder S, Newe T (2022) Enabling secure time-series data sharing via homomorphic encryption. Future Gener Comput Syst 133:351\u2013363","journal-title":"Future Gener Comput Syst"},{"issue":"1","key":"1488_CR49","first-page":"136","volume":"52","author":"X Ge","year":"2021","unstructured":"Ge X, Yu J, Zhang H, Bai J, Fan J, Xiong NN (2021) SPPS: A search pattern privacy system for approximate shortest distance query of encrypted graphs in IIoT. IEEE Transact Syst 52(1):136\u2013150","journal-title":"IEEE Transact Syst"},{"key":"1488_CR50","first-page":"3","volume":"1","author":"MP Nath","year":"2019","unstructured":"Nath MP, Sridharan R, Bhargava A, Mohammed T (2019) Cloud computing: an overview, benefits, issues & research challenges. Idea 1:3","journal-title":"Idea"},{"key":"1488_CR51","unstructured":"Cohen W (2016) The cmu enron email dataset. http:\/\/www.cs.cmu.edu\/~enron\/, Accessed 2006"},{"issue":"3","key":"1488_CR52","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"MF Porter","year":"1980","unstructured":"Porter MF (1980) An algorithm for suffix stripping. Program 14(3):130\u2013137","journal-title":"Program"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-023-01488-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-023-01488-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-023-01488-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:18:09Z","timestamp":1689121089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-023-01488-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,25]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1488"],"URL":"https:\/\/doi.org\/10.1007\/s12083-023-01488-8","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2158129\/v1","asserted-by":"object"}]},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,25]]},"assertion":[{"value":"12 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publish"}},{"value":"All authors declared there were no conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}