The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Shared and searchable encrypted data for untrusted servers
Abstract
Current security mechanisms are not suitable for organisations that outsource their data management to untrusted servers. Encrypting and decrypting sensitive data at the client side is the normal approach in this situation but has high communication and computation overheads if only a subset of the data is required, for example, selecting records in a database table based on a keyword search. New cryptographic schemes have been proposed that support encrypted queries over encrypted data. But they all depend on a single set of secret keys, which implies single user access or sharing keys among multiple users, with key revocation requiring costly data re-encryption. In this paper, we propose an encryption scheme where each authorised user in the system has his own keys to encrypt and decrypt data. The scheme supports keyword search which enables the server to return only the encrypted data that satisfies an encrypted query without decrypting it. We provide a concrete construction of the scheme and give formal proofs of its security. We also report on the results of our implementation.
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Cited by
Li, M., Yu, S., Zheng, Y., Ren, K., & Lou, W. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.97 · Cited by 1,189
Li, M., Yu, S., Ren, K., & Lou, W. (2010) · Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-16161-2_6 · Cited by 396
A Survey of Provably Secure Searchable Encryption
Bösch, C., Hartel, P., Jonker, W., & Peter, A. (2015) · ACM Computing Surveys · doi:10.1145/2636328 · Cited by 357
Authorized Private Keyword Search over Encrypted Data in Cloud Computing
Li, M., Yu, S., Cao, N., & Lou, W. (2011) · 2011 31st International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2011.55 · Cited by 324
DAC-MACS: Effective Data Access Control for Multiauthority Cloud Storage Systems
Yang, K., Jia, X., Ren, K., Zhang, B., & Xie, R. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2279531 · Cited by 310
Metadata
- Authors
- Dong, C., Russello, G., & Dulay, N.
- Venue
- Journal of Computer Security
- Publisher
- SAGE Publications
- Published
- 2011-05-30
- Volume
- 19
- Issue
- 3
- Pages
- 367-397
- ISSN
- 0926-227X (ISSN-L)
- 1875-8924
- OpenAlex
- W3023749109
- Cited by
- 231
- References
- 2
- FWCI
- 21.29
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Shared and searchable encrypted data for untrusted servers. https://app.cochat.ai/papers/10.3233/jcs-2010-0415
- The paper
- Dong, C., Russello, G., & Dulay, N. (2011). Shared and searchable encrypted data for untrusted servers. Journal of Computer Security. https://doi.org/10.3233/jcs-2010-0415
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.