The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Practical Dynamic Searchable Encryption with Small Leakage
Abstract
Dynamic Searchable Symmetric Encryption (DSSE) enables a client to encrypt his document collection in a way that it is still searchable and efficiently updatable.However, all DSSE constructions that have been presented in the literature so far come with several problems: Either they leak a significant amount of information (e.g., hashes of the keywords contained in the updated document) or are inefficient in terms of space or search/update time (e.g., linear in the number of documents).In this paper we revisit the DSSE problem.We propose the first DSSE scheme that achieves the best of both worlds, i.e., both small leakage and efficiency.In particular, our DSSE scheme leaks significantly less information than any other previous DSSE construction and supports both updates and searches in sublinear time in the worst case, maintaining at the same time a data structure of only linear size.We finally provide an implementation of our construction, showing its practical efficiency.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Practical techniques for searches on encrypted data
Song, D. X., Wagner, D., & Perrig, A. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848445 · Cited by 3,350
Public Key Encryption with Keyword Search
Boneh, D., Di Crescenzo, G., Ostrovsky, R., & Persiano, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_30 · Cited by 3,134
Jacob, M. (1989) · Health Education Journal · doi:10.1177/001789698904800401 · Cited by 3,090
Searchable symmetric encryption: improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180417 · Cited by 1,671
Software protection and simulation on oblivious RAMs
Goldreich, O., & Ostrovsky, R. (1996) · Journal of the ACM · doi:10.1145/233551.233553 · Cited by 1,617
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
Dynamic searchable symmetric encryption
Kamara, S., Papamanthou, C., & Roeder, T. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382298 · Cited by 1,111
Self-citationPrivacy Preserving Keyword Searches on Remote Encrypted Data
Chang, Y.-C., & Mitzenmacher, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496137_30 · Cited by 1,041
Functional Encryption: Definitions and Challenges
Boneh, D., Sahai, A., & Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19571-6_16 · Cited by 1,010
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., & Steiner, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_20 · Cited by 883
Path ORAM: an extremely simple oblivious RAM protocol
Stefanov, E., van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., & Devadas, S. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516660 · Cited by 698
Self-citationMulti-Dimensional Range Query over Encrypted Data
Shi, E., Bethencourt, J., Chan, T.-H. H., Song, D., & Perrig, A. (2007) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2007.29 · Cited by 552
Self-citationParallel and Dynamic Searchable Symmetric Encryption
Kamara, S., & Papamanthou, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39884-1_22 · Cited by 528
Self-citationStructured Encryption and Controlled Disclosure
Chase, M., & Kamara, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_33 · Cited by 520
Towards a theory of software protection and simulation by oblivious RAMs
Goldreich, O. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28416 · Cited by 507
Predicate Privacy in Encryption Systems
Shen, E., Shi, E., & Waters, B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00457-5_27 · Cited by 436
Self-citationUC-Secure Searchable Symmetric Encryption
Kurosawa, K., & Ohtaki, Y. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32946-3_21 · Cited by 255
ObliviStore: High Performance Oblivious Cloud Storage
Stefanov, E., & Shi, E. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.25 · Cited by 248
Self-citationBuilding castles out of mud: practical access pattern privacy and correctness on untrusted storage
Williams, P., Sion, R., & Carbunar, B. (2008) · Proceedings of the 15th ACM conference on Computer and communications security · doi:10.1145/1455770.1455790 · Cited by 230
Outsourced symmetric private information retrieval
Jarecki, S., Jutla, C. S., Krawczyk, H., Rosu, M. C., & Steiner, M. (2013) · doi:10.1145/2508859.2516730 · Cited by 229
Private information storage (extended abstract)
Ostrovsky, R., & Shoup, V. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258606 · Cited by 225
Computationally Efficient Searchable Symmetric Encryption
van Liesdonk, P., Sedghi, S., Doumen, J., Hartel, P., & Jonker, W. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15546-8_7 · Cited by 194
Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation ∗
Goodrich, M. T., Mitzenmacher, M., Ohrimenko, O., & Tamassia, R. (n.d.) · Cited by 184
Ousterhout, J., Agrawal, P., Erickson, D., Kozyrakis, C., Leverich, J., Mazières, D., Mitra, S., Narayanan, A., Ongaro, D., Parulkar, G., et al. (2011) · Communications of the ACM · doi:10.1145/1965724.1965751 · Cited by 159
Oblivious RAM simulation with efficient worst-case access overhead
Goodrich, M. T., Mitzenmacher, M., Ohrimenko, O., & Tamassia, R. (2011) · Cloud Computing Security Workshop · doi:10.1145/2046660.2046680 · Cited by 127
Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation
Goodrich, M. T., Mitzenmacher, M., Ohrimenko, O., & Tamassia, R. (2012) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973099.14 · Cited by 125
Cited by
Leakage-Abuse Attacks Against Searchable Encryption
Cash, D., Grubbs, P., Perry, J., & Ristenpart, T. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813700 · Cited by 609
Dynamic Searchable Encryption via Blind Storage
Naveed, M., Prabhakaran, M., & Gunter, C. A. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.47 · Cited by 308
Security and privacy protection in cloud computing: Discussions and challenges
Sun, P. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102642 · Cited by 287
∑oφoς: Forward Secure Searchable Encryption
Bost, R. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978303 · Cited by 279
Blockchain Security: A Survey of Techniques and Research Directions
Leng, J., Zhou, M., Zhao, J. L., Huang, Y., & Bian, Y. (2022) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2020.3038641 · Cited by 279
Metadata
- Authors
- Stefanov, E., Papamanthou, C., & Shi, E.
- Venue
- Proceedings 2014 Network and Distributed System Security Symposium
- Publisher
- Internet Society
- Published
- 2014
- OpenAlex
- W2016575873
- Cited by
- 606
- References
- 26
- FWCI
- 24.90
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.