{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T23:12:30Z","timestamp":1790637150431,"version":"4.1.0"},"reference-count":32,"publisher":"Privacy Enhancing Technologies Symposium Advisory Board","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Searchable symmetric encryption (SSE) enables a client to perform searches over its outsourced encrypted files while preserving privacy of the files and queries. Dynamic schemes, where files can be added or removed, leak more information than static schemes. For dynamic schemes, <jats:italic>forward privacy<\/jats:italic> requires that a newly added file cannot be linked to previous searches. We present a new dynamic SSE scheme that achieves forward privacy by replacing the keys revealed to the server on each search. Our scheme is efficient and parallelizable and outperforms the best previous schemes providing forward privacy, and achieves competitive performance with dynamic schemes <jats:italic>without<\/jats:italic> forward privacy. We provide a full security proof in the random oracle model. In our experiments on the Wikipedia archive of about four million pages, the server takes one second to perform a search with 100,000 results.<\/jats:p>","DOI":"10.1515\/popets-2018-0002","type":"journal-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T22:16:20Z","timestamp":1515795380000},"page":"5-20","source":"Crossref","is-referenced-by-count":97,"title":["Efficient Dynamic Searchable Encryption with Forward Privacy"],"prefix":"10.56553","volume":"2018","author":[{"given":"Mohammad","family":"Etemad","sequence":"first","affiliation":[{"name":"University of Virginia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alptekin","family":"K\u00fcp\u00e7\u00fc","sequence":"additional","affiliation":[{"name":"Ko\u00e7 University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[{"name":"University of Maryland , College Park"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Evans","sequence":"additional","affiliation":[{"name":"University of Virginia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"35752","published-online":{"date-parts":[[2018,1,11]]},"reference":[{"key":"2021040711051155675_j_popets-2018-0002_ref_001_w2aab3b7b2b1b6b1ab1ab1Aa","doi-asserted-by":"crossref","unstructured":"[1] I. H. Akin and B. Sunar, \u201cOn the difficulty of securing web applications using cryptdb,\u201d in IEEE International Conference on Big Data and Cloud Computing Conference, 2014.","DOI":"10.1109\/BDCloud.2014.75"},{"key":"2021040711051155675_j_popets-2018-0002_ref_002_w2aab3b7b2b1b6b1ab1ab2Aa","doi-asserted-by":"crossref","unstructured":"[2] R. Alonso-Calvo, J. Crespo, M. Garc\u2019ia-Remesal, A. Anguita, and V. Maojo, \u201cOn distributing load in cloud computing: A real application for very-large image datasets,\u201d Procedia Computer Science, vol. 1, no. 1, 2010.","DOI":"10.1016\/j.procs.2010.04.300"},{"key":"2021040711051155675_j_popets-2018-0002_ref_003_w2aab3b7b2b1b6b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"[3] D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, \u201cPublic key encryption with keyword search,\u201d in EUROCRYPT\u2019 04, 2004.","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"2021040711051155675_j_popets-2018-0002_ref_004_w2aab3b7b2b1b6b1ab1ab4Aa","unstructured":"[4] D. Boneh and B. Waters, \u201cConjunctive, subset, and range queries on encrypted data,\u201d in Theory of Cryptography, 2007."},{"key":"2021040711051155675_j_popets-2018-0002_ref_005_w2aab3b7b2b1b6b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"[5] C. B\u00f6sch, A. Peter, B. Leenders, H. W. Lim, Q. Tang, H. Wang, P. Hartel, and W. Jonker, \u201cDistributed searchable symmetric encryption,\u201d in IEEE Conference on Privacy, Security and Trust (PST), 2014.","DOI":"10.1109\/PST.2014.6890956"},{"key":"2021040711051155675_j_popets-2018-0002_ref_006_w2aab3b7b2b1b6b1ab1ab6Aa","doi-asserted-by":"crossref","unstructured":"[6] R. Bost, \u201c\u03c3\u03bf\u03c6\u03bf\u03c2: Forward secure searchable encryption,\u201d in ACM Conference on Computer and Communications Security (CCS), 2016.","DOI":"10.1145\/2976749.2978303"},{"key":"2021040711051155675_j_popets-2018-0002_ref_007_w2aab3b7b2b1b6b1ab1ab7Aa","doi-asserted-by":"crossref","unstructured":"[7] D. Cash, P. Grubbs, J. Perry, and T. Ristenpart, \u201cLeakage-abuse attacks against searchable encryption,\u201d in ACM Conference on Computer and Communications Security (CCS), 2015.","DOI":"10.1145\/2810103.2813700"},{"key":"2021040711051155675_j_popets-2018-0002_ref_008_w2aab3b7b2b1b6b1ab1ab8Aa","doi-asserted-by":"crossref","unstructured":"[8] D. Cash, J. Jaeger, S. Jarecki, C. Jutla, H. Krawczyk, M.-C. Rosu, and M. Steiner, \u201cDynamic searchable encryption in very-large databases: Data structures and implementation,\u201d in Network and Distributed System Security (NDSS), 2014.","DOI":"10.14722\/ndss.2014.23264"},{"key":"2021040711051155675_j_popets-2018-0002_ref_009_w2aab3b7b2b1b6b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"[9] D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M.-C. Rosu, and M. Steiner, \u201cHighly-scalable searchable symmetric encryption with support for boolean queries,\u201d in CRYPTO\u201913, 2013.","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"2021040711051155675_j_popets-2018-0002_ref_010_w2aab3b7b2b1b6b1ab1ac10Aa","doi-asserted-by":"crossref","unstructured":"[10] Y.-C. Chang and M. Mitzenmacher, \u201cPrivacy preserving keyword searches on remote encrypted data,\u201d in Applied Cryptography and Network Security (ACNS), 2005.","DOI":"10.1007\/11496137_30"},{"key":"2021040711051155675_j_popets-2018-0002_ref_011_w2aab3b7b2b1b6b1ab1ac11Aa","doi-asserted-by":"crossref","unstructured":"[11] M. Chase and S. Kamara, \u201cStructured encryption and controlled disclosure,\u201d in ASIACRYPT\u201910, 2010.","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"2021040711051155675_j_popets-2018-0002_ref_012_w2aab3b7b2b1b6b1ab1ac12Aa","doi-asserted-by":"crossref","unstructured":"[12] R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, \u201cSearchable symmetric encryption: Improved definitions and efficient constructions,\u201d in ACM Conference on Computer and Communications Security (CCS), 2006.","DOI":"10.1145\/1180405.1180417"},{"key":"2021040711051155675_j_popets-2018-0002_ref_013_w2aab3b7b2b1b6b1ab1ac13Aa","unstructured":"[13] I. B. Damg\u00e5rd, \u201cCollision free hash functions and public key signature schemes,\u201d in EUROCRYPT\u201987, 1988."},{"key":"2021040711051155675_j_popets-2018-0002_ref_014_w2aab3b7b2b1b6b1ab1ac14Aa","doi-asserted-by":"crossref","unstructured":"[14] S. Garg, P. Mohassel, and C. Papamanthou, \u201cTworam: efficient oblivious ram in two rounds with applications to searchable encryption,\u201d in Annual Cryptology Conference, 2016.","DOI":"10.1007\/978-3-662-53015-3_20"},{"key":"2021040711051155675_j_popets-2018-0002_ref_015_w2aab3b7b2b1b6b1ab1ac15Aa","doi-asserted-by":"crossref","unstructured":"[15] O. Goldreich and R. Ostrovsky, \u201cSoftware protection and simulation on oblivious rams,\u201d Journal of the ACM, vol. 43, no. 3, 1996.","DOI":"10.1145\/233551.233553"},{"key":"2021040711051155675_j_popets-2018-0002_ref_016_w2aab3b7b2b1b6b1ab1ac16Aa","doi-asserted-by":"crossref","unstructured":"[16] M. T. Goodrich and M. Mitzenmacher, \u201cPrivacy-preserving access of outsourced data via oblivious ram simulation,\u201d in International Colloquium on Automata, Languages and Programming, 2011.","DOI":"10.1007\/978-3-642-22012-8_46"},{"key":"2021040711051155675_j_popets-2018-0002_ref_017_w2aab3b7b2b1b6b1ab1ac17Aa","unstructured":"[17] M. Islam, M. Kuzu, and M. Kantarcioglu, \u201cAccess pattern disclosure on searchable encryption: Ramification, attack and mitigation,\u201d in Network and Distributed System Security (NDSS), 2012."},{"key":"2021040711051155675_j_popets-2018-0002_ref_018_w2aab3b7b2b1b6b1ab1ac18Aa","unstructured":"[18] Jeffrey Walton, \u201cCrypto++ 5.6.5 Benchmarks,\u201d https:\/\/www.cryptopp.com\/benchmarks.html, May 2017."},{"key":"2021040711051155675_j_popets-2018-0002_ref_019_w2aab3b7b2b1b6b1ab1ac19Aa","doi-asserted-by":"crossref","unstructured":"[19] S. Kamara and C. Papamanthou, \u201cParallel and dynamic searchable symmetric encryption,\u201d in Financial Cryptography and Data Security (FC), 2013.","DOI":"10.1007\/978-3-642-39884-1_22"},{"key":"2021040711051155675_j_popets-2018-0002_ref_020_w2aab3b7b2b1b6b1ab1ac20Aa","doi-asserted-by":"crossref","unstructured":"[20] S. Kamara, C. Papamanthou, and T. Roeder, \u201cDynamic searchable symmetric encryption,\u201d in ACM Conference on Computer and Communications Security (CCS), 2012.","DOI":"10.1145\/2382196.2382298"},{"key":"2021040711051155675_j_popets-2018-0002_ref_021_w2aab3b7b2b1b6b1ab1ac21Aa","doi-asserted-by":"crossref","unstructured":"[21] J. Katz and Y. Lindell, Introduction to modern cryptography. CRC Press, 2014.","DOI":"10.1201\/b17668"},{"key":"2021040711051155675_j_popets-2018-0002_ref_022_w2aab3b7b2b1b6b1ab1ac22Aa","doi-asserted-by":"crossref","unstructured":"[22] K. Kurosawa and Y. Ohtaki, \u201cUc-secure searchable symmetric encryption,\u201d in Financial Cryptography and Data Security (FC), 2012.","DOI":"10.1007\/978-3-642-32946-3_21"},{"key":"2021040711051155675_j_popets-2018-0002_ref_023_w2aab3b7b2b1b6b1ab1ac23Aa","doi-asserted-by":"crossref","unstructured":"[23] C. Liu, L. Zhu, M. Wang, and Y.-a. Tan, \u201cSearch pattern leakage in searchable encryption: Attacks and new construction,\u201d Information Sciences, vol. 265, 2014.","DOI":"10.1016\/j.ins.2013.11.021"},{"key":"2021040711051155675_j_popets-2018-0002_ref_024_w2aab3b7b2b1b6b1ab1ac24Aa","unstructured":"[24] M. Naveed, \u201cThe fallacy of composition of oblivious ram and searchable encryption,\u201d Cryptology ePrint Archive, Report 2015\/668, 2015."},{"key":"2021040711051155675_j_popets-2018-0002_ref_025_w2aab3b7b2b1b6b1ab1ac25Aa","doi-asserted-by":"crossref","unstructured":"[25] M. Naveed, S. Kamara, and C. V. Wright, \u201cInference attacks on property-preserving encrypted databases,\u201d in ACM Conference on Computer and Communications Security (CCS), 2015.","DOI":"10.1145\/2810103.2813651"},{"key":"2021040711051155675_j_popets-2018-0002_ref_026_w2aab3b7b2b1b6b1ab1ac26Aa","doi-asserted-by":"crossref","unstructured":"[26] M. Naveed, M. Prabhakaran, and C. A. Gunter, \u201cDynamic searchable encryption via blind storage,\u201d in IEEE Symposium on Security and Privacy, 2014.","DOI":"10.1109\/SP.2014.47"},{"key":"2021040711051155675_j_popets-2018-0002_ref_027_w2aab3b7b2b1b6b1ab1ac27Aa","unstructured":"[27] M. Porter, \u201cThe English (Porter2) Stemming Algorithm,\u201d http:\/\/snowball.tartarus.org\/algorithms\/english\/stemmer.html, 2001."},{"key":"2021040711051155675_j_popets-2018-0002_ref_028_w2aab3b7b2b1b6b1ab1ac28Aa","doi-asserted-by":"crossref","unstructured":"[28] N. G. Shivaratri, P. Krueger, and M. Singhal, \u201cLoad distributing for locally distributed systems,\u201d IEEE Computer, vol. 25, no. 12, 1992.","DOI":"10.1109\/2.179115"},{"key":"2021040711051155675_j_popets-2018-0002_ref_029_w2aab3b7b2b1b6b1ab1ac29Aa","doi-asserted-by":"crossref","unstructured":"[29] E. Stefanov, C. Papamanthou, and E. Shi, \u201cPractical dynamic searchable encryption with small leakage,\u201d in Network and Distributed System Security (NDSS), 2014.","DOI":"10.14722\/ndss.2014.23298"},{"key":"2021040711051155675_j_popets-2018-0002_ref_030_w2aab3b7b2b1b6b1ab1ac30Aa","doi-asserted-by":"crossref","unstructured":"[30] Q. Wei, B. Veeravalli, B. Gong, L. Zeng, and D. Feng, \u201cCdrm: A cost-effective dynamic replication management scheme for cloud storage cluster,\u201d in IEEE International Conference on Cluster Computing, 2010.","DOI":"10.1109\/CLUSTER.2010.24"},{"key":"2021040711051155675_j_popets-2018-0002_ref_031_w2aab3b7b2b1b6b1ab1ac31Aa","doi-asserted-by":"crossref","unstructured":"[31] S. Zahur, X. Wang, M. Raykova, A. Gasc\u00f3n, J. Doerner, D. Evans, and J. Katz, \u201cRevisiting Square-Root ORAM: Efficient Random Access in Multi-Party Computation,\u201d in IEEE Symposium on Security and Privacy, 2016.","DOI":"10.1109\/SP.2016.21"},{"key":"2021040711051155675_j_popets-2018-0002_ref_032_w2aab3b7b2b1b6b1ab1ac32Aa","unstructured":"[32] Y. Zhang, J. Katz, and C. Papamanthou, \u201cAll your queries are belong to us: The power of file-injection attacks on searchable encryption,\u201d in USENIX Security Symposium, 2016."}],"container-title":["Proceedings on Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/popets\/2018\/1\/article-p5.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/popets-2018-0002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T16:29:59Z","timestamp":1658334599000},"score":1,"resource":{"primary":{"URL":"https:\/\/petsymposium.org\/popets\/2018\/popets-2018-0002.php"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,1]]},"references-count":32,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,1,11]]},"published-print":{"date-parts":[[2018,1,1]]}},"alternative-id":["10.1515\/popets-2018-0002"],"URL":"https:\/\/doi.org\/10.1515\/popets-2018-0002","relation":{},"ISSN":["2299-0984"],"issn-type":[{"value":"2299-0984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,1]]}}}