The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing
Abstract
Cloud computing is an emerging computing paradigm in which resources of the computing infrastructure are provided as services over the Internet. As promising as it is, this paradigm also brings forth many new challenges for data security and access control when users outsource sensitive data for sharing on cloud servers, which are not within the same trusted domain as data owners. To keep sensitive user data confidential against untrusted servers, existing solutions usually apply cryptographic methods by disclosing data decryption keys only to authorized users. However, in doing so, these solutions inevitably introduce a heavy computation overhead on the data owner for key distribution and data management when fine-grained data access control is desired, and thus do not scale well. The problem of simultaneously achieving fine-grainedness, scalability, and data confidentiality of access control actually still remains unresolved. This paper addresses this challenging open issue by, on one hand, defining and enforcing access policies based on data attributes, and, on the other hand, allowing the data owner to delegate most of the computation tasks involved in fine-grained data access control to untrusted cloud servers without disclosing the underlying data contents. We achieve this goal by exploiting and uniquely combining techniques of attribute-based encryption (ABE), proxy re-encryption, and lazy re-encryption. Our proposed scheme also has salient properties of user access privilege confidentiality and user secret key accountability. Extensive analysis shows that our proposed scheme is highly efficient and provably secure under existing security models.
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
Above the Clouds: A Berkeley View of Cloud Computing
Armbrust, M., Fox, A., Griffith, R., Joseph, A. D., Katz, R. H., Konwinski, A., Lee, G., Patterson, D. A., Rabkin, A., Stoica, I. G., et al. (2009) · UC Berkeley · Cited by 6,274
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
Divertible 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
Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing
Wang, Q., Wang, C., Ren, K., Lou, W., & Li, J. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.183 · Cited by 1,511
Self-citationImproved proxy re-encryption schemes with applications to secure distributed storage
Ateniese, G., Fu, K., Green, M., & Hohenberger, S. (2006) · ACM Transactions on Information and System Security · doi:10.1145/1127345.1127346 · Cited by 1,475 · cited 2×
“Ateniese et al [13] proposed a secure distributed storage scheme based on proxy re-encryption.”
BackgroundRevocation and Tracing Schemes for Stateless Receivers
Naor, D., Naor, M., & Lotspiech, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_3 · Cited by 1,118
Toward a Unified Ontology of Cloud Computing
Youseff, L., Butrico, M., & Da Silva, D. (2008) · 2008 Grid Computing Environments Workshop · doi:10.1109/gce.2008.4738443 · Cited by 898
Dynamic provable data possession
Erway, C., Küpçü, A., Papamanthou, C., & Tamassia, R. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653688 · Cited by 897
Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing
Wang, Q., Wang, C., Li, J., Ren, K., & Lou, W. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04444-1_22 · Cited by 892
Self-citationPlutus: Scalable Secure File Sharing on Untrusted Storage
Kallahalla, M., Riedel, E., Swaminathan, R., Wang, Q., & Fu, K. E. (2003) · Cited by 666
Computer Security Technology Planning Study
Anderson, J. P. (1972) · Cited by 660
SiRiUS: Securing Remote Untrusted Storage.
Goh, E.-J., Shacham, H., Modadugu, N., & Boneh, D. (2003) · Cited by 471
Over-Encryption: Management of Access Control Evolution on Encrypted Data
di Vimercati, S. D. C., Foresti, S., Jajodia, S., Paraboschi, S., & Samarati, P. (2007) · Very Large Data Bases · Cited by 371
A unified scheme for resource protection in automated trust negotiation
Yu, T., & Winslett, M. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199331 · Cited by 171
Automated trust negotiation using cryptographic credentials
Li, J., Li, N., & Winsborough, W. H. (2005) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1102120.1102129 · Cited by 130
Methods and limitations of security policy reconciliation
MDaniel, P., & Prakash, A. (2005) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2002.1004363 · Cited by 88
Defending against Key Abuse Attacks in KP-ABE Enabled Broadcast Systems
Yu, S., Ren, K., Lou, W., & Li, J. (2009) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-05284-2_18 · Cited by 71
Self-citationPrinciples of Policy in Secure Groups.
Harney, H., Colgrove, A., & McDaniel, P. D. (2001) · Cited by 51
Cited by
Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing
Wang, C., Wang, Q., Ren, K., & Lou, W. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462173 · Cited by 1,415
Self-citationA Survey of Fog Computing: Concepts, Applications and Issues
Yi, S., Li, C., & Li, Q. (2015) · Proceedings of the 2015 Workshop on Mobile Big Data · doi:10.1145/2757384.2757397 · Cited by 1,339
Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
Cao, N., Wang, C., Li, M., Ren, K., & Lou, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.45 · Cited by 1,259
Self-citationLi, 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-citationSurvey on fog computing: architecture, key technologies, applications and open issues
Hu, P., Dhelim, S., Ning, H., & Qiu, T. (2017) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2017.09.002 · Cited by 877
Metadata
- Authors
- Yu, S., Wang, C., Ren, K., & Lou, W.
- Venue
- 2010 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2010-03
- Pages
- 1-9
- OpenAlex
- W2116626915
- Cited by
- 1,602
- References
- 18
- FWCI
- 73.53
- 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.