The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Secure attribute-based data sharing for resource-limited users in cloud computing
Open accessAbstract
Abstract Data sharing becomes an exceptionally attractive service supplied by cloud computing platforms because of its convenience and economy. As a potential technique for realizing fine-grained data sharing, attribute-based encryption (ABE) has drawn wide attentions. However, most of the existing ABE solutions suffer from the disadvantages of high computation overhead and weak data security, which has severely impeded resource-constrained mobile devices to customize the service. The problem of simultaneously achieving fine-grainedness, high-efficiency on the data owner's side, and standard data confidentiality of cloud data sharing actually still remains unresolved. This paper addresses this challenging issue by proposing a new attribute-based data sharing scheme suitable for resource-limited mobile users in cloud computing. The proposed scheme eliminates a majority of the computation task by adding system public parameters besides moving partial encryption computation offline. In addition, a public ciphertext test phase is performed before the decryption phase, which eliminates most of computation overhead due to illegitimate ciphertexts. For the sake of data security, a Chameleon hash function is used to generate an immediate ciphertext, which will be blinded by the offline ciphertexts to obtain the final online ciphertexts. The proposed scheme is proven secure against adaptively chosen-ciphertext attacks, which is widely recognized as a standard security notion. Extensive performance analysis indicates that the proposed scheme is secure and efficient.
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
Armbrust, M., Fox, A., Griffith, R., Joseph, A. D., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I., et al. (2010) · Communications of the ACM · doi:10.1145/1721654.1721672 · Cited by 9,464
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
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
(2005) · Lecture notes in computer science · doi:10.1007/b136415 · Cited by 1,234
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
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
Waters, B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_36 · Cited by 919
Implementing Gentry’s Fully-Homomorphic Encryption Scheme
Gentry, C., & Halevi, S. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_9 · Cited by 889
Secure schemes for secret sharing and key distribution
Beimel, A. (1996) · Medical Entomology and Zoology · Cited by 779
Cited by
Significant Permission Identification for Machine-Learning-Based Android Malware Detection
Li, J., Sun, L., Yan, Q., Li, Z., Srisa-an, W., & Ye, H. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2017.2789219 · Cited by 607
Self-citationSecurity and Privacy in Smart Health: Efficient Policy-Hiding Attribute-Based Access Control
Zhang, Y., Zheng, D., & Deng, R. H. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2825289 · Cited by 487
Self-citationData-Driven Cybersecurity Incident Prediction: A Survey
Sun, N., Zhang, J., Rimba, P., Gao, S., Zhang, L. Y., & Xiang, Y. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2885561 · Cited by 323
Self-citationA hybrid particle swarm optimization algorithm using adaptive learning strategy
Wang, F., Zhang, H., Li, K., Lin, Z., Yang, J., & Shen, X.-L. (2018) · Information Sciences · doi:10.1016/j.ins.2018.01.027 · Cited by 284
Blockchain based Efficient and Robust Fair Payment for Outsourcing Services in Cloud Computing
Zhang, Y., Deng, R. H., Liu, X., & Zheng, D. (2018) · Information Sciences · doi:10.1016/j.ins.2018.06.018 · Cited by 228
Self-citation
Metadata
- Authors
- Li, J., Zhang, Y., Chen, X., & Xiang, Y.
- Venue
- Computers & Security
- Publisher
- Elsevier BV
- Published
- 2018-01
- Volume
- 72
- Pages
- 1-12
- ISSN
- 0167-4048 (ISSN-L)
- OpenAlex
- W2752901856
- Cited by
- 461
- References
- 63
- FWCI
- 44.94
- Type
- journal article
- Language
- en
- Open access
- green
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: Secure attribute-based data sharing for resource-limited users in cloud computing. https://app.cochat.ai/papers/10.1016/j.cose.2017.08.007
- The paper
- Li, J., Zhang, Y., Chen, X., & Xiang, Y. (2018). Secure attribute-based data sharing for resource-limited users in cloud computing. Computers & Security. https://doi.org/10.1016/j.cose.2017.08.007
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.