{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:37:02Z","timestamp":1767339422155,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T00:00:00Z","timestamp":1527033600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,23]]},"DOI":"10.1145\/3201595.3201598","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"3-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Storage Efficient Substring Searchable Symmetric Encryption"],"prefix":"10.1145","author":[{"given":"Iraklis","family":"Leontiadis","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[{"name":"University of Arizona, Tucson, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,5,23]]},"reference":[{"volume-title":"Proceedings of the Ninth International Symposium on String Processing and Information Retrieval","author":"Abouelhoda Mohamed Ibrahim","key":"e_1_3_2_1_1_1","unstructured":"Mohamed Ibrahim Abouelhoda , Enno Ohlebusch , and Stefan Kurtz . 2002. Optimal Exact String Matching Based on Suffix Arrays . In In Proceedings of the Ninth International Symposium on String Processing and Information Retrieval . SpringerVerlag , Lecture Notes in Computer Science. Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, and Stefan Kurtz. 2002. Optimal Exact String Matching Based on Suffix Arrays. In In Proceedings of the Ninth International Symposium on String Processing and Information Retrieval. SpringerVerlag, Lecture Notes in Computer Science."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"e_1_3_2_1_3_1","unstructured":"M. Burrows and D. J. Wheeler. 1994. A block-sorting lossless data compression algorithm. Technical Report.  M. Burrows and D. J. Wheeler. 1994. A block-sorting lossless data compression algorithm. Technical Report."},{"key":"e_1_3_2_1_4_1","volume-title":"Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference","author":"Cash David","year":"2013","unstructured":"David Cash , Stanislaw Jarecki , Charanjit S. Jutla , Hugo Krawczyk , Marcel-Catalin Rosu , and Michael Steiner . 2013. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries . In Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference , Santa Barbara, CA, USA , August 18--22, 2013 . Proceedings, Part I. 353--373. David Cash, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, and Michael Steiner. 2013. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. In Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I. 353--373."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_30"},{"key":"e_1_3_2_1_6_1","volume-title":"Advances in Cryptology - ASIACRYPT 2010 - 16th International Conference on the Theory and Application of Cryptology and Information Security","author":"Chase Melissa","year":"2010","unstructured":"Melissa Chase and Seny Kamara . 2010. Structured Encryption and Controlled Disclosure . In Advances in Cryptology - ASIACRYPT 2010 - 16th International Conference on the Theory and Application of Cryptology and Information Security , Singapore, December 5--9, 2010 . Proceedings . 577--594. Melissa Chase and Seny Kamara. 2010. Structured Encryption and Controlled Disclosure. In Advances in Cryptology - ASIACRYPT 2010 - 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5--9, 2010. Proceedings. 577--594."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1515\/popets-2015-0014","article-title":"Substring-Searchable Symmetric Encryption","volume":"2015","author":"Chase Melissa","year":"2015","unstructured":"Melissa Chase and Emily Shen . 2015 . Substring-Searchable Symmetric Encryption . PoPETs 2015 , 2 (2015), 263 -- 281 . http:\/\/www.degruyter.com\/view\/j\/popets.2015. 2015.issue-2\/popets-2015-0014\/popets-2015-0014.xml Melissa Chase and Emily Shen. 2015. Substring-Searchable Symmetric Encryption. PoPETs 2015, 2 (2015), 263--281. http:\/\/www.degruyter.com\/view\/j\/popets.2015. 2015.issue-2\/popets-2015-0014\/popets-2015-0014.xml","journal-title":"PoPETs"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings, Part II. 123--145","author":"Faber Sky","year":"2015","unstructured":"Sky Faber , Stanislaw Jarecki , Hugo Krawczyk , Quan Nguyen , Marcel-Catalin Rosu , and Michael Steiner . 2015 . Rich Queries on Encrypted Data: Beyond Exact Matches. In Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21--25, 2015 , Proceedings, Part II. 123--145 . Sky Faber, Stanislaw Jarecki, Hugo Krawczyk, Quan Nguyen, Marcel-Catalin Rosu, and Michael Steiner. 2015. Rich Queries on Encrypted Data: Beyond Exact Matches. In Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21--25, 2015, Proceedings, Part II. 123--145."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_48"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796543"},{"key":"e_1_3_2_1_12_1","volume-title":"PETS 2013, Bloomington, IN, USA, July 10--12, 2013. Proceedings. 1--18","author":"Gentry Craig","year":"2013","unstructured":"Craig Gentry , Kenny A. Goldman , Shai Halevi , Charanjit S. Jutla , Mariana Raykova , and Daniel Wichs . 2013 . Optimizing ORAM and Using It Efficiently for Secure Computation. In Privacy Enhancing Technologies - 13th International Symposium , PETS 2013, Bloomington, IN, USA, July 10--12, 2013. Proceedings. 1--18 . Craig Gentry, Kenny A. Goldman, Shai Halevi, Charanjit S. Jutla, Mariana Raykova, and Daniel Wichs. 2013. Optimizing ORAM and Using It Efficiently for Secure Computation. In Privacy Enhancing Technologies - 13th International Symposium, PETS 2013, Bloomington, IN, USA, July 10--12, 2013. Proceedings. 1--18."},{"volume-title":"Information Retrieval","author":"Gonnet Gaston H.","key":"e_1_3_2_1_13_1","unstructured":"Gaston H. Gonnet , Ricardo A. Baeza-Yates , and Tim Snider . 1992. Information Retrieval . Prentice-Hall, Inc. , Upper Saddle River, NJ, USA, Chapter New Indices for Text: PAT Trees and PAT Arrays, 66--82. Gaston H. Gonnet, Ricardo A. Baeza-Yates, and Tim Snider. 1992. Information Retrieval. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, Chapter New Indices for Text: PAT Trees and PAT Arrays, 66--82."},{"key":"e_1_3_2_1_14_1","volume-title":"30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. 943--955","author":"Karkkainen Juha","year":"2003","unstructured":"Juha Karkkainen and Peter Sanders . 2003 . Simple Linear Work Suffix Array Construction. In Automata, Languages and Programming , 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. 943--955 . Juha Karkkainen and Peter Sanders. 2003. Simple Linear Work Suffix Array Construction. In Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. 943--955."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0249"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"e_1_3_2_1_18_1","first-page":"46","article-title":"How To Simulate It - A Tutorial on the Simulation Proof Technique","volume":"2016","author":"Lindell Yehuda","year":"2016","unstructured":"Yehuda Lindell . 2016 . How To Simulate It - A Tutorial on the Simulation Proof Technique . IACR Cryptology ePrint Archive 2016 (2016), 46 . http:\/\/eprint.iacr.org\/ 2016\/046 Yehuda Lindell. 2016. How To Simulate It - A Tutorial on the Simulation Proof Technique. IACR Cryptology ePrint Archive 2016 (2016), 46. http:\/\/eprint.iacr.org\/ 2016\/046","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90)","author":"Manber Udi","year":"1990","unstructured":"Udi Manber and Gene Myers . 1990 . Suffix Arrays: A New Method for On-line String Searches . In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90) . Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 319--327. Udi Manber and Gene Myers. 1990. Suffix Arrays: A New Method for On-line String Searches. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 319--327."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"}],"event":{"name":"ASIA CCS '18: ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Incheon Republic of Korea","acronym":"ASIA CCS '18"},"container-title":["Proceedings of the 6th International Workshop on Security in Cloud Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3201595.3201598","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3201595.3201598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:53Z","timestamp":1750208933000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3201595.3201598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,23]]},"references-count":21,"alternative-id":["10.1145\/3201595.3201598","10.1145\/3201595"],"URL":"https:\/\/doi.org\/10.1145\/3201595.3201598","relation":{},"subject":[],"published":{"date-parts":[[2018,5,23]]},"assertion":[{"value":"2018-05-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}