The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Searchable symmetric encryption: Improved definitions and efficient constructions
Abstract
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search over it. This problem has been the focus of active research and several security definitions and constructions have been proposed. In this paper we begin by reviewing existing notions of security and propose new and stronger security definitions. We then present two constructions that we show secure under our new definitions. Interestingly, in addition to satisfying stronger security guarantees, our constructions are more efficient than all previous constructions. Further, prior work on SSE only considered the setting where only the owner of the data is capable of submitting search queries. We consider the natural extension where an arbitrary group of parties other than the owner can submit search queries. We formally define SSE in this multi-user setting, and present an efficient construction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
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
Self-citationProtocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
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
Self-citationSoftware protection and simulation on oblivious RAMs
Goldreich, O., & Ostrovsky, R. (1996) · Journal of the ACM · doi:10.1145/233551.233553 · Cited by 1,617
Self-citationConjunctive, Subset, and Range Queries on Encrypted Data
Boneh, D., & Waters, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_29 · Cited by 1,432
Privacy 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
Replication is not needed: single database, computationally-private information retrieval
Kushilevitz, E., & Ostrovsky, R. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646125 · Cited by 932
Self-citationFarsite: federated, available, and reliable storage for an incompletely trusted environment
Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M., & Wattenhofer, R. P. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844130 · Cited by 780
Secure Conjunctive Keyword Search over Encrypted Data
Golle, P., Staddon, J., & Waters, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24852-1_3 · Cited by 773
Storing a Sparse Table with 0 (1) Worst Case Access Time
Fredman, M. L., Komlós, J., & Szemerédi, E. (1984) · Journal of the ACM · doi:10.1145/828.1884 · Cited by 748
Deterministic and Efficiently Searchable Encryption
Bellare, M., Boldyreva, A., & O’Neill, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_30 · Cited by 745
Multi-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
Two theorems on random polynomial time
Adleman, L. (1978) · 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) · doi:10.1109/sfcs.1978.37 · Cited by 316
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture Notes in Computer Science · doi:10.1007/11602897_35 · Cited by 299
Self-citationUniversal arguments and their applications
Barak, B., & Goldreich, O. (2003) · Proceedings 17th IEEE Annual Conference on Computational Complexity · doi:10.1109/ccc.2002.1004355 · Cited by 244
Ciphers with Arbitrary Finite Domains
Black, J., & Rogaway, P. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45760-7_9 · Cited by 205
Private Searching on Streaming Data
Ostrovsky, R., & Skeith, W. E. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_14 · Cited by 159
Self-citationIshai, Y., Eyal Kushilevitz, Z., Ostrovsky, R., & Sahai, A. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.25 · Cited by 142
Self-citationChecking the correctness of memories
Blum, M., Evans, W., Gemmell, P. S., et al. (2002) · doi:10.1109/sfcs.1991.185352 · Cited by 131
How to Encipher Messages on a Small Domain
Morris, B., Rogaway, P., & Stegers, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03356-8_17 · Cited by 103
Towards an Information Theoretic Analysis of Searchable Encryption
Sedghi, S., Doumen, J. M., Hartel, P., et al. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88625-9_23 · Cited by 10
Cited by
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation
Cash, D., Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., & Steiner, M. (2014) · Proceedings 2014 Network and Distributed System Security Symposium · doi:10.14722/ndss.2014.23264 · Cited by 677
Data security and privacy-preserving in edge computing paradigm: survey and open issues
Zhang, J., Chen, B., Zhao, Y., Cheng, X., & Hu, F. (2018) · IEEE Access · doi:10.1109/access.2018.2820162 · Cited by 514
Block Design-Based Key Agreement for Group Data Sharing in Cloud Computing
Shen, J., Zhou, T., He, D., Zhang, Y., Sun, X., & Xiang, Y. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2017.2725953 · Cited by 304
Privacy in Internet of Things: From Principles to Technologies
Li, C., & Palanisamy, B. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2864168 · Cited by 130
IoT Big Data Security and Privacy Versus Innovation
Sollins, K. R. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2898113 · Cited by 97
Metadata
- Authors
- Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R.
- Venue
- Journal of Computer Security
- Publisher
- SAGE Publications
- Published
- 2011-11-04
- Volume
- 19
- Issue
- 5
- Pages
- 895-934
- ISSN
- 0926-227X (ISSN-L)
- 1875-8924
- OpenAlex
- W2145426052
- Cited by
- 914
- References
- 26
- FWCI
- 18.92
- Type
- journal article
- 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.