{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:39:32Z","timestamp":1763458772625,"version":"3.45.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2017,8,12]],"date-time":"2017-08-12T00:00:00Z","timestamp":1502496000000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Strategic Priority Research Program of the Chinese Academy of Sciences","award":["XDA06010701"],"award-info":[{"award-number":["XDA06010701"]}]},{"name":"Intel ISTC on Cloud Computing"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-0905493, CNS-1115375, NSF 1547102 and SaTC 1564097"],"award-info":[{"award-number":["IIS-0905493, CNS-1115375, NSF 1547102 and SaTC 1564097"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61402471 and 61472414"],"award-info":[{"award-number":["61402471 and 61472414"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2016,8,22]]},"abstract":"<jats:p>\n                    Querying over encrypted data is gaining increasing popularity in cloud-based data hosting services. Security and efficiency are recognized as two important and yet conflicting requirements for querying over encrypted data. In this article, we propose an efficient private keyword search (EPKS) scheme that supports binary search and extend it to dynamic settings (called\n                    <jats:italic toggle=\"yes\">DEPKS<\/jats:italic>\n                    ) for inverted index--based encrypted data. First, we describe our approaches of constructing a searchable symmetric encryption (SSE) scheme that supports binary search. Second, we present a novel framework for EPKS and provide its formal security definitions in terms of\n                    <jats:italic toggle=\"yes\">plaintext privacy<\/jats:italic>\n                    and\n                    <jats:italic toggle=\"yes\">predicate privacy<\/jats:italic>\n                    by modifying Shen et al.\u2019s security notions [Shen et al. 2009]. Third, built on the proposed framework, we design an EPKS scheme whose complexity is logarithmic in the number of keywords. The scheme is based on the groups of prime order and enjoys strong notions of security, namely statistical plaintext privacy and statistical predicate privacy. Fourth, we extend the EPKS scheme to support dynamic keyword and document updates. The extended scheme not only maintains the properties of logarithmic-time search efficiency and plaintext privacy and predicate privacy but also has fewer rounds of communications for updates compared to existing dynamic search encryption schemes. We experimentally evaluate the proposed EPKS and DEPKS schemes and show that they are significantly more efficient in terms of both keyword search complexity and communication complexity than existing randomized SSE schemes.\n                  <\/jats:p>","DOI":"10.1145\/2940328","type":"journal-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T14:17:46Z","timestamp":1471270666000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Dynamic and Efficient Private Keyword Search over Inverted Index--Based Encrypted Data"],"prefix":"10.1145","volume":"16","author":[{"given":"Rui","family":"Zhang","sequence":"first","affiliation":[{"name":"SKLOIS, Institute of Information Engineering, Chinese Academy of Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Xue","sequence":"additional","affiliation":[{"name":"SKLOIS, Institute of Information Engineering, Chinese Academy of Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Yu","sequence":"additional","affiliation":[{"name":"Qatar Computing Research Institute, Hamad Bin Khalifa University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Computing, Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777777.1777820"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935306"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.84"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23264"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_17"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_30"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987260.1987274"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_3"},{"key":"e_1_2_1_12_1","unstructured":"Eu-Jin Goh. 2003. Cryptology ePrint Archive: Report 2003\/216. Secure Indexes. Retrieved July 14 2016 from http:\/\/eprint.iacr.org\/2003\/216\/."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28416"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38980-1_22"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the NDSS Conference (NDSS\u201912)","author":"Islam Mohammad Saiful","year":"2012","unstructured":"Mohammad Saiful Islam, Mehmet Kuzu, and Murat Kantarcioglu. 2012. Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In Proceedings of the NDSS Conference (NDSS\u201912)."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516730"},{"key":"e_1_2_1_18_1","volume-title":"The Java Pairing Based Cryptography Library (JPBC). Retrieved","author":"Library JPBC","year":"2016","unstructured":"JPBC Library. 2013. The Java Pairing Based Cryptography Library (JPBC). Retrieved July 14, 2016, from http:\/\/gas.dia.unisa.it\/projects\/jpbc Seny Kamara and Charalampos Papamanthou. 2013. Parallel and dynamic searchable symmetric encryption. In FC 2013. LNCS, Vol. 7859. Springer Berlin Heidelberg, 258--274."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788414.1788423"},{"key":"e_1_2_1_21_1","series-title":"Lecture Notes in Computer Science","volume-title":"Financial Cryptography and Data Security","author":"Kurosawa Kaoru","unstructured":"Kaoru Kurosawa and Yasuhiro Ohtaki. 2012. UC-secure searchable symmetric encryption. In Financial Cryptography and Data Security. Lecture Notes in Computer Science, Vol. 7397. Springer, 285--298."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095129"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_20"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1889159.1889169"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the NDSS Conference (NDSS\u201912)","author":"Lu Yanbin","year":"2012","unstructured":"Yanbin Lu. 2012. Privacy-preserving logarithmic-time search on encrypted data in cloud. In Proceedings of the NDSS Conference (NDSS\u201912)."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881447"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_27"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_46"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/882494.884426"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23298"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.25"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484322"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.282"},{"volume-title":"Proceedings of the INFOCOM Conference (INFOCOM\u201912)","author":"Wang C.","key":"e_1_2_1_36_1","unstructured":"C. Wang, K. Ren, S. Yu, and K. Urs. 2012. Achieving usable and privacy-assured similarity search over outsourced cloud data. In Proceedings of the INFOCOM Conference (INFOCOM\u201912). 451--459."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24177-7_10"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33272-2_14"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940328","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2940328","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2940328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:34:43Z","timestamp":1763458483000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,12]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,8,22]]}},"alternative-id":["10.1145\/2940328"],"URL":"https:\/\/doi.org\/10.1145\/2940328","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"type":"print","value":"1533-5399"},{"type":"electronic","value":"1557-6051"}],"subject":[],"published":{"date-parts":[[2016,8,12]]},"assertion":[{"value":"2015-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-08-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}