The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Dynamic Searchable Encryption via Blind Storage
Open accessAbstract
Dynamic Searchable Symmetric Encryption allows a client to store a dynamic collection of encrypted documents with a server, and later quickly carry out keyword searches on these encrypted documents, while revealing minimal information to the server. In this paper we present a new dynamic SSE scheme that is simpler and more efficient than existing schemes while revealing less information to the server than prior schemes, achieving fully adaptive security against honest-but-curious servers. We implemented a prototype of our scheme and demonstrated its efficiency on datasets from prior work. Apart from its concrete efficiency, our scheme is also simpler: in particular, it does not require the server to support any operation other than upload and download of data. Thus the server in our scheme can be based solely on a cloud storage service, rather than a cloud computation service as well, as in prior work. In building our dynamic SSE scheme, we introduce a new primitive called Blind Storage, which allows a client to store a set of files on a remote server in such a way that the server does not learn how many files are stored, or the lengths of the individual files, as each file is retrieved, the server learns about its existence (and can notice the same file being downloaded subsequently), but the file's name and contents are not revealed. This is a primitive with several applications other than SSE, and is of independent interest.
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
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
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Goldreich, O. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
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
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
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
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
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
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
Guidelines on security and privacy in public cloud computing
Jansen, W., & Grance, T. (2011) · doi:10.6028/nist.sp.800-144 · Cited by 699
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
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
Parallel 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
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
Identifying the security risks associated with governmental use of cloud computing
Paquette, S., Jaeger, P. T., & Wilson, S. C. (2010) · Government Information Quarterly · doi:10.1016/j.giq.2010.01.002 · Cited by 337
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
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
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
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 Survey on IoT Security: Application Areas, Security Threats, and Solution Architectures
Hassija, V., Chamola, V., Saxena, V., Jain, D., Goyal, P., & Sikdar, B. (2019) · IEEE Access · doi:10.1109/access.2019.2924045 · Cited by 1,396
Securing Fog Computing for Internet of Things Applications: Challenges and Solutions
Ni, J., Zhang, K., Lin, X., & Shen, X. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2762345 · Cited by 659
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
Blockchain based searchable encryption for electronic health record sharing
Chen, L., Lee, W.-K., Chang, C.-C., Choo, K.-K. R., & Zhang, N. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.01.018 · Cited by 484
The Security of Big Data in Fog-Enabled IoT Applications Including Blockchain: A Survey
Tariq, N., Asim, M., Al-Obeidat, F., Zubair Farooqi, M., Baker, T., Hammoudeh, M., & Ghafir, I. (2019) · Sensors · doi:10.3390/s19081788 · Cited by 268
Metadata
- Authors
- Naveed, M., Prabhakaran, M., & Gunter, C. A.
- Venue
- 2014 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2014-05
- Pages
- 639-654
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2011212169
- Cited by
- 308
- References
- 20
- FWCI
- 21.35
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.