The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Dynamic searchable symmetric encryption
Abstract
Searchable symmetric encryption (SSE) allows a client to encrypt its data in such a way that this data can still be searched. The most immediate application of SSE is to cloud storage, where it enables a client to securely outsource its data to an untrusted cloud provider without sacrificing the ability to search over it.
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
Introduction to Modern Cryptography
Katz, J., & Lindell, Y. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b17668 · Cited by 1,880
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
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
Introduction to Modern Cryptography
Katz, J., & Lindell, Y. (2007) · doi:10.1201/9781420010756 · Cited by 1,238
Advanced Encryption Standard (AES)
Heron, S. (2009) · Network Security · doi:10.1016/s1353-4858(10)70006-4 · Cited by 1,216
Kamara, S., & Lauter, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14992-4_13 · Cited by 1,071
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
Searchable symmetric encryption: Improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2011) · Journal of Computer Security · doi:10.3233/jcs-2011-0426 · Cited by 914
Self-citationStoring 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
The Psycho-Biology of Language
Tinker, M. A., & Zipf, G. K. (1936) · The American Journal of Psychology · doi:10.2307/1415586 · Cited by 728
Structured 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
Self-citationAccess Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation.
Islam, M. S., Kuzu, M., & Kantarcıoğlu, M. (2012) · Cited by 491
Introduction to Modern Cryptography (Chapman & Hall/CRC Cryptography and Network Security Series)
Katz, J. I., & Lindell, Y. (2020) · Cited by 451
UC-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
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
Cited by
A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data
Xia, Z., Wang, X., Sun, X., & Wang, Q. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2401003 · Cited by 1,181
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
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
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
Practical Dynamic Searchable Encryption with Small Leakage
Stefanov, E., Papamanthou, C., & Shi, E. (2014) · Proceedings 2014 Network and Distributed System Security Symposium · doi:10.14722/ndss.2014.23298 · Cited by 606
Self-citation
Metadata
- Authors
- Kamara, S., Papamanthou, C., & Roeder, T.
- Venue
- Proceedings of the 2012 ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2012-10-16
- Pages
- 965-976
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2152516507
- Cited by
- 1,111
- References
- 19
- FWCI
- 39.39
- 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.