{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T21:10:02Z","timestamp":1749849002263,"version":"3.41.0"},"reference-count":24,"publisher":"Privacy Enhancing Technologies Symposium Advisory Board","issue":"1","license":[{"start":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T00:00:00Z","timestamp":1482364800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In recent years searchable symmetric encryption has seen a rapid increase in query expressiveness including keyword, phrase, Boolean, and fuzzy queries. With this expressiveness came increasingly complex constructions. Having these facts in mind, we present an efficient and generic searchable symmetric encryption construction for phrase queries. Our construction is straightforward to implement, and is proven secure under adaptively chosen query attacks (CQA2) in the random oracle model with an honest-but-curious adversary. To our knowledge, this is the first encrypted phrase search system that achieves CQA2 security. Moreover, we demonstrate that our document collection preprocessing algorithm allows us to extend a dynamic SSE construction so that it supports phrase queries. We also provide a compiler theorem which transforms any CQA2-secure SSE construction for keyword queries into a CQA2-secure SSE construction that supports phrase queries.<\/jats:p>","DOI":"10.1515\/popets-2017-0002","type":"journal-article","created":{"date-parts":[[2016,12,23]],"date-time":"2016-12-23T19:41:36Z","timestamp":1482522096000},"page":"4-20","source":"Crossref","is-referenced-by-count":0,"title":["Generic Adaptively Secure Searchable Phrase Encryption"],"prefix":"10.56553","volume":"2017","author":[{"given":"Zachary A.","family":"Kissel","sequence":"first","affiliation":[{"name":"Merrimack College Department of Computer Science, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Massachusetts Lowell Department of Computer Science United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"35752","published-online":{"date-parts":[[2016,12,22]]},"reference":[{"key":"2021040618170847169_j_popets-2017-0002_ref_1_w2aab2b8c19b1b7b1ab1ab1Aa","doi-asserted-by":"crossref","unstructured":"[1] Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, and Giuseppe Persiano. Public key encryption with keyword search. In Christian Cachin and Jan Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 506-522. Springer Berlin \/ Heidelberg, 2004.","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"2021040618170847169_j_popets-2017-0002_ref_2_w2aab2b8c19b1b7b1ab1ab2Aa","doi-asserted-by":"crossref","unstructured":"[2] Christoph B\u00f6sch, Pieter Hartel, Willem Jonker, and Andreas Peter. A survey of provably secure searchable encryption. ACM Comput. Surv., 47(2):18:1-18:51, August 2014.","DOI":"10.1145\/2636328"},{"key":"2021040618170847169_j_popets-2017-0002_ref_3_w2aab2b8c19b1b7b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"[3] David Cash, Paul Grubbs, Jason Perry, and Thomas Ristenpart. Leakage-abuse attacks against searchable encryption.In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pages 668-679. ACM, 2015.","DOI":"10.1145\/2810103.2813700"},{"key":"2021040618170847169_j_popets-2017-0002_ref_4_w2aab2b8c19b1b7b1ab1ab4Aa","doi-asserted-by":"crossref","unstructured":"[4] David Cash, Joseph Jaeger, Stanislaw Jarecki, Charanjit Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, and Michael Steiner. Dynamic searchable encryption in very large databases: Data structures and implementation. In Proceedings of NDSS 2014, 2014.","DOI":"10.14722\/ndss.2014.23264"},{"key":"2021040618170847169_j_popets-2017-0002_ref_5_w2aab2b8c19b1b7b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"[5] David Cash, Stanislaw Jarecki, Charanjit Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, and Michael Steiner. Highly-scalable searchable symmetric encryption with support for boolean queries. In Advances in Cryptology- CRYPTO 2013, pages 353-373. Springer, 2013.","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"2021040618170847169_j_popets-2017-0002_ref_6_w2aab2b8c19b1b7b1ab1ab6Aa","doi-asserted-by":"crossref","unstructured":"[6] Qi Chai and Guang Gong. Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. In IEEE International Conference on Communications, ICC\u201912, June 2012.","DOI":"10.1109\/ICC.2012.6364125"},{"key":"2021040618170847169_j_popets-2017-0002_ref_7_w2aab2b8c19b1b7b1ab1ab7Aa","doi-asserted-by":"crossref","unstructured":"[7] Yan-Cheng Chang and Michael Mitzenmacher. Privacy preserving keyword searches on remote encrypted data. In Proceedings of the Third international conference on Applied Cryptography and Network Security, ACNS\u201905, pages 442-455, Berlin, Heidelberg, 2005. Springer-Verlag.","DOI":"10.1007\/11496137_30"},{"key":"2021040618170847169_j_popets-2017-0002_ref_8_w2aab2b8c19b1b7b1ab1ab8Aa","doi-asserted-by":"crossref","unstructured":"[8] Reza Curtmola, Juan Garay, Seny Kamara, and Rafail Ostrovsky. Searchable symmetric encryption: improved definitions and efficient constructions. In Proceedings of the 13th ACM conference on Computer and communications security, CCS \u201906, pages 79-88, New York, NY, USA, 2006. ACM.","DOI":"10.1145\/1180405.1180417"},{"key":"2021040618170847169_j_popets-2017-0002_ref_9_w2aab2b8c19b1b7b1ab1ab9Aa","unstructured":"[9] Eu-Jin Goh. Secure indexes. IACR Cryptology ePrint Archive, 2003:216, 2003."},{"key":"2021040618170847169_j_popets-2017-0002_ref_10_w2aab2b8c19b1b7b1ab1ac10Aa","unstructured":"[10] MS Islam, Mehmet Kuzu, and Murat Kantarcioglu. Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In Network and Distributed System Security Symposium (NDSS\u201912), 2012."},{"key":"2021040618170847169_j_popets-2017-0002_ref_11_w2aab2b8c19b1b7b1ab1ac11Aa","doi-asserted-by":"crossref","unstructured":"[11] Seny Kamara and Charalampos Papamanthou. Parallel and dynamic searchable symmetric encryption. In Financial Cryptography and Data Security, pages 258-274. Springer Berlin Heidelberg, 2013.","DOI":"10.1007\/978-3-642-39884-1_22"},{"key":"2021040618170847169_j_popets-2017-0002_ref_12_w2aab2b8c19b1b7b1ab1ac12Aa","doi-asserted-by":"crossref","unstructured":"[12] Seny Kamara, Charalampos Papamanthou, and Tom Roeder. Dynamic searchable symmetric encryption. In Proceedings of the 2012 ACM Conference on Computer and Communications Security, CCS \u201912, pages 965-976, New York, NY, USA, 2012. ACM.","DOI":"10.1145\/2382196.2382298"},{"key":"2021040618170847169_j_popets-2017-0002_ref_13_w2aab2b8c19b1b7b1ab1ac13Aa","doi-asserted-by":"crossref","unstructured":"[13] Zachary A. Kissel and Jie Wang. Verifiable phrase search over encrypted data secure against a semi-honest -butcurious adversary. In IEEE International Conference on Distributed Computing Systems, CCRM Workshop, July 2013.","DOI":"10.1109\/ICDCSW.2013.62"},{"key":"2021040618170847169_j_popets-2017-0002_ref_14_w2aab2b8c19b1b7b1ab1ac14Aa","doi-asserted-by":"crossref","unstructured":"[14] Jin Li, Qian Wang, Cong Wang, Ning Cao, Kui Ren, and Wenjing Lou. Fuzzy keyword search over encrypted data in cloud computing. In Proceedings of the 29th conference on Information communications, INFOCOM\u201910, pages 441-445, Piscataway, NJ, USA, 2010. IEEE Press.","DOI":"10.1109\/INFCOM.2010.5462196"},{"key":"2021040618170847169_j_popets-2017-0002_ref_15_w2aab2b8c19b1b7b1ab1ac15Aa","doi-asserted-by":"crossref","unstructured":"[15] Ralph C. Merkle. A digital signature based on a conventional encryption function. In Carl Pomerance, editor, Advances in Cryptology - CRYPTO \u201987: Proceedings, pages 369-378. Springer Berlin Heidelberg, Berlin, Heidelberg, 1988.","DOI":"10.1007\/3-540-48184-2_32"},{"key":"2021040618170847169_j_popets-2017-0002_ref_16_w2aab2b8c19b1b7b1ab1ac16Aa","doi-asserted-by":"crossref","unstructured":"[16] Daniele Micciancio. Oblivious data structures: applications to cryptography. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 456-464. ACM, 1997.","DOI":"10.1145\/258533.258638"},{"key":"2021040618170847169_j_popets-2017-0002_ref_17_w2aab2b8c19b1b7b1ab1ac17Aa","doi-asserted-by":"crossref","unstructured":"[17] Moni Naor and Vanessa Teague. Anti-presistence: history independent data structures. In Proceedings of the thirtythird annual ACM symposium on Theory of computing, pages 492-501. ACM, 2001.","DOI":"10.1145\/380752.380844"},{"key":"2021040618170847169_j_popets-2017-0002_ref_18_w2aab2b8c19b1b7b1ab1ac18Aa","doi-asserted-by":"crossref","unstructured":"[18] Dawn Xiaoding Song, David Wagner, and Adrian Perrig. Practical techniques for searches on encrypted data. In Proceedings of the 2000 IEEE Symposium on Security and Privacy, SP \u201900, pages 44-55, Washington, DC, USA, 2000. IEEE Computer Society.","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"2021040618170847169_j_popets-2017-0002_ref_19_w2aab2b8c19b1b7b1ab1ac19Aa","doi-asserted-by":"crossref","unstructured":"[19] Emil Stefanov, Charalampos Papamanthou, and Elaine Shi. Practical dynamic searchable encryption with small leakage. IACR Cryptology ePrint Archive, 2013:832, 2013.","DOI":"10.14722\/ndss.2014.23298"},{"key":"2021040618170847169_j_popets-2017-0002_ref_20_w2aab2b8c19b1b7b1ab1ac20Aa","doi-asserted-by":"crossref","unstructured":"[20] Emil Stefanov, Charalampos Papamanthou, and Elaine Shi. Practical dynamic searchable encryption with small leakage. In NDSS, volume 14, pages 23-26, 2014.","DOI":"10.14722\/ndss.2014.23298"},{"key":"2021040618170847169_j_popets-2017-0002_ref_21_w2aab2b8c19b1b7b1ab1ac21Aa","unstructured":"[21] Yinqi Tang, Dawu Gu, Ning Ding, and Haining Lu. Phrase search over encrypted data with symmetric encryption scheme. 2012 32nd International Conference on Distributed Computing Systems Workshops, 0:471-480, 2012."},{"key":"2021040618170847169_j_popets-2017-0002_ref_22_w2aab2b8c19b1b7b1ab1ac22Aa","unstructured":"[22] Jianfeng Wang, Xiaofeng Chen, Hua Ma, Qiang Tang, Jin Li, and Hui Zhu. A verifiable fuzzy keyword search scheme over encrypted data. Journal of Internet Services and Information Security (JISIS), 2(1\/2):49-58, 2 2012."},{"key":"2021040618170847169_j_popets-2017-0002_ref_23_w2aab2b8c19b1b7b1ab1ac23Aa","unstructured":"[23] Hugh E Williams, Justin Zobel, and Phil Anderson. What\u2019s next? index structures for efficient phrase querying. In Proceedings of the Australasian Database Conference, pages 141-152. Australian Computer Society, 1999."},{"key":"2021040618170847169_j_popets-2017-0002_ref_24_w2aab2b8c19b1b7b1ab1ac24Aa","unstructured":"[24] Yupeng Zhang, Jonathan Katz, and Charalampos Papamanthou. All your queries are belong to us: The power of fileinjection attacks on searchable encryption. IACR Cryptology ePrint Archive, 2016:172, 2016."}],"container-title":["Proceedings on Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/popets\/2017\/1\/article-p4.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/popets-2017-0002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T20:53:52Z","timestamp":1749848032000},"score":1,"resource":{"primary":{"URL":"https:\/\/petsymposium.org\/popets\/2017\/popets-2017-0002.php"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,22]]},"references-count":24,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,12,22]]},"published-print":{"date-parts":[[2017,1,1]]}},"alternative-id":["10.1515\/popets-2017-0002"],"URL":"https:\/\/doi.org\/10.1515\/popets-2017-0002","relation":{},"ISSN":["2299-0984"],"issn-type":[{"type":"electronic","value":"2299-0984"}],"subject":[],"published":{"date-parts":[[2016,12,22]]}}}