The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
VABKS: Verifiable attribute-based keyword search over outsourced encrypted data
Abstract
It is common nowadays for data owners to outsource their data to the cloud. Since the cloud cannot be fully trusted, the outsourced data should be encrypted. This however brings a range of problems, such as: How should a data owner grant search capabilities to the data users? How can the authorized data users search over a data owner's outsourced encrypted data? How can the data users be assured that the cloud faithfully executed the search operations on their behalf? Motivated by these questions, we propose a novel cryptographic solution, called verifiable attribute-based keyword search (VABKS). The solution allows a data user, whose credentials satisfy a data owner's access control policy, to (i) search over the data owner's outsourced encrypted data, (ii) outsource the tedious search operations to the cloud, and (iii) verify whether the cloud has faithfully executed the search operations. We formally define the security requirements of VA B K S and describe a construction that satisfies them. Performance evaluation shows that the proposed schemes are practical and deployable.
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
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
Ciphertext-Policy Attribute-Based Encryption
Bethencourt, J., Sahai, A., & Waters, B. (2007) · 2007 IEEE Symposium on Security and Privacy (SP '07) · doi:10.1109/sp.2007.11 · Cited by 5,131
Attribute-based encryption for fine-grained access control of encrypted data
Goyal, V., Pandey, O., Sahai, A., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180418 · Cited by 5,009
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
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
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
Conjunctive, 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
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Boneh, D., Boyen, X., & Goh, E.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_26 · Cited by 1,334
Multi-authority Attribute Based Encryption
Chase, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_28 · Cited by 1,112
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
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Katz, J., Sahai, A., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_9 · Cited by 1,081
Kamara, S., & Lauter, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14992-4_13 · Cited by 1,071
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
Chosen-Ciphertext Security from Identity-Based Encryption
Canetti, R., Halevi, S., & Katz, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_13 · Cited by 900
Improving privacy and security in multi-authority attribute-based encryption
Chase, M., & Chow, S. S. M. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653678 · Cited by 795
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
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
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
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
Okamoto, T., & Takashima, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_11 · Cited by 507
Public Key Encryption with Keyword Search Revisited
Baek, J., Safavi-Naini, R., & Susilo, W. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69839-5_96 · Cited by 498
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
Verifiable Delegation of Computation over Large Datasets
Benabbas, S., Gennaro, R., & Vahlis, Y. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_7 · Cited by 379
Building an Encrypted and Searchable Audit Log.
Waters, B. R., Balfanz, D., Durfee, G., & Smetters, D. K. (2004) · Cited by 372
Lewko, A., & Waters, B. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_12 · Cited by 371
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
Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers
Chai, Q., & Gong, G. (2012) · International Conference on Communications · doi:10.1109/icc.2012.6364125 · Cited by 306
Hierarchical Predicate Encryption for Inner-Products
Okamoto, T., & Takashima, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_13 · Cited by 290
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
Camenisch, J. L., Kohlweiss, M., Rial, A., & Sheedy, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00468-1_12 · Cited by 144
CS2: A Searchable Cryptographic Cloud Storage System
Kamara, S., Papamanthou, C., & Roeder, T. (2011) · Cited by 66
Cited by
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
Security and Privacy-Preserving Challenges of e-Health Solutions in Cloud Computing
Chenthara, S., Ahmed, K., Wang, H., & Whittaker, F. (2019) · IEEE Access · doi:10.1109/access.2019.2919982 · Cited by 335
KSF-OABE: Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage
Li, J., Lin, X., Zhang, Y., & Han, J. (2017) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2016.2542813 · Cited by 321
Mamta, Gupta, B. B., Li, K.-C., Leung, V. C. M., Psannis, K. E., & Yamaguchi, S. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1004003 · Cited by 292
Achieving Efficient and Secure Data Acquisition for Cloud-Supported Internet of Things in Smart Grid
Guan, Z., Li, J., Wu, L., Zhang, Y., Wu, J., & Du, X. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2690522 · Cited by 244
Metadata
- Authors
- Zheng, Q., Xu, S., & Ateniese, G.
- Venue
- IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
- Publisher
- IEEE
- Published
- 2014-04
- Pages
- 522-530
- OpenAlex
- W1988169383
- Cited by
- 499
- References
- 32
- FWCI
- 24.11
- 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.