The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Protecting Your Right: Verifiable Attribute-Based Keyword Search with Fine-Grained Owner-Enforced Search Authorization in the Cloud
Abstract
Search over encrypted data is a critically important enabling technique in cloud computing, where encryption-before-outsourcing is a fundamental solution to protecting user data privacy in the untrusted cloud server environment. Many secure search schemes have been focusing on the single-contributor scenario, where the outsourced dataset or the secure searchable index of the dataset are encrypted and managed by a single owner, typically based on symmetric cryptography. In this paper, we focus on a different yet more challenging scenario where the outsourced dataset can be contributed from multiple owners and are searchable by multiple users, i.e., multi-user multi-contributor case. Inspired by attribute-based encryption (ABE), we present the first attribute-based keyword search scheme with efficient user revocation (ABKS-UR) that enables scalable fine-grained (i.e., file-level) search authorization. Our scheme allows multiple owners to encrypt and outsource their data to the cloud server independently. Users can generate their own search capabilities without relying on an always online trusted authority. Fine-grained search authorization is also implemented by the owner-enforced access policy on the index of each file. Further, by incorporating proxy re-encryption and lazy re-encryption techniques, we are able to delegate heavy system update workload during user revocation to the resourceful semi-trusted cloud server. We formalize the security definition and prove the proposed ABKS-UR scheme selectively secure against chosen-keyword attack. To build confidence of data user in the proposed secure search system, we also design a search result verification scheme. Finally, performance evaluation shows the efficiency of our scheme.
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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
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
A fully homomorphic encryption scheme
Boneh, D., & Gentry, C. (2009) · Cited by 2,341
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
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing
Yu, S., Wang, C., Ren, K., & Lou, W. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462174 · Cited by 1,602
Self-citationDivertible protocols and atomic proxy cryptography
Blaze, M., Bleumer, G., & Strauss, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054122 · Cited by 1,582
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
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
Self-citationDynamic 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
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
Provably secure ciphertext policy ABE
Cheung, L., & Newport, C. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315302 · Cited by 814
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
Plutus: Scalable Secure File Sharing on Untrusted Storage
Kallahalla, M., Riedel, E., Swaminathan, R., Wang, Q., & Fu, K. E. (2003) · Cited by 666
Attribute based data sharing with attribute revocation
Yu, S., Wang, C., Ren, K., & Lou, W. (2010) · Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security · doi:10.1145/1755688.1755720 · Cited by 642
Self-citationFaster Secure Two-Party Computation Using Garbled Circuits
Huang, Y., Evans, D., Katz, J. I., & Malka, L. (2011) · doi:10.18130/v3hj5c · Cited by 532
Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data
Wang, C., Cao, N., Ren, K., & Lou, W. (2012) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2011.282 · Cited by 531
Self-citationPrivacy-preserving multi-keyword ranked search over encrypted cloud data
Cao, N., Wang, C., Li, M., Ren, K., & Lou, W. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5935306 · Cited by 500
Self-citationPredicate 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
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System
Hwang, Y. H., & Lee, P. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73489-5_2 · Cited by 407
Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking
Sun, W., Wang, B., Cao, N., Li, M., Lou, W., Hou, Y. T., & Li, H. (2013) · Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security · doi:10.1145/2484313.2484322 · Cited by 338
Self-citationAuthorized 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
Self-citationAuthenticating query results in edge computing
Pang, H. H., & Tan, K.-L. (2004) · Proceedings. 20th International Conference on Data Engineering · doi:10.1109/icde.2004.1320027 · Cited by 241
Sun, W., Wang, B., Cao, N., Li, M., Lou, W., Hou, Y. T., & Li, H. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.282 · Cited by 214
Self-citationSun, W., Yu, S., Lou, W., Hou, Y. T., & Li, H. (2014) · IEEE INFOCOM 2014 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2014.6847943 · Cited by 194
Self-citationAuthenticating the query results of text search engines
Pang, H., & Mouratidis, K. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453875 · Cited by 79
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
Yang, Y., Zheng, X., Guo, W., Liu, X., & Chang, V. (2019) · Information Sciences · doi:10.1016/j.ins.2018.02.005 · Cited by 364
Security and privacy protection in cloud computing: Discussions and challenges
Sun, P. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102642 · Cited by 287
A Secure Data Sharing Platform Using Blockchain and Interplanetary File System
Naz, M., Al-zahrani, F. A., Khalid, R., Javaid, N., Qamar, A. M., Afzal, M. K., & Shafiq, M. (2019) · Sustainability · doi:10.3390/su11247054 · Cited by 272
VeriRange: A Verifiable Range Query Model on Encrypted Geographic Data for IoT Environment
Ma, W., Peng, Y., Liu, X., & Cui, J. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3294589 · Cited by 5
Metadata
- Authors
- Sun, W., Yu, S., Lou, W., Hou, Y. T., & Li, H.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2016-04-01
- Volume
- 27
- Issue
- 4
- Pages
- 1187-1198
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2144754501
- Cited by
- 351
- References
- 33
- FWCI
- 20.47
- 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.