The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
An Efficient and Secure Dynamic Auditing Protocol for Data Storage in Cloud Computing
Abstract
In cloud computing, data owners host their data on cloud servers and users (data consumers) can access the data from cloud servers. Due to the data outsourcing, however, this new paradigm of data hosting service also introduces new security challenges, which requires an independent auditing service to check the data integrity in the cloud. Some existing remote integrity checking methods can only serve for static archive data and, thus, cannot be applied to the auditing service since the data in the cloud can be dynamically updated. Thus, an efficient and secure dynamic auditing protocol is desired to convince data owners that the data are correctly stored in the cloud. In this paper, we first design an auditing framework for cloud storage systems and propose an efficient and privacy-preserving auditing protocol. Then, we extend our auditing protocol to support the data dynamic operations, which is efficient and provably secure in the random oracle model. We further extend our auditing protocol to support batch auditing for both multiple owners and multiple clouds, without using any trusted organizer. The analysis and simulation results show that our proposed auditing protocols are secure and efficient, especially it reduce the computation cost of the auditor.
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
The NIST definition of cloud computing
Mell, P. M., & Grance, T. (2011) · doi:10.6028/nist.sp.800-145 · Cited by 11,795
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
Provable data possession at untrusted stores
Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., & Song, D. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315318 · Cited by 2,705
Pors: proofs of retrievability for large files
Juels, A., & Kaliski, B. S. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315317 · Cited by 1,894
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
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
Compact Proofs of Retrievability
Shacham, H., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89255-7_7 · Cited by 1,395
Scalable and efficient provable data possession
Ateniese, G., Di Pietro, R., Mancini, L. V., & Tsudik, G. (2008) · Proceedings of the 4th international conference on Security and privacy in communication netowrks · doi:10.1145/1460877.1460889 · Cited by 1,129
Attribute-based encryption with non-monotonic access structures
Ostrovsky, R., Sahai, A., & Waters, B. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315270 · Cited by 1,059
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
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
Fog Computing Micro Datacenter Based Dynamic Resource Estimation and Pricing Model for IoT
Aazam, M., & Huh, E.-N. (2015) · 2015 IEEE 29th International Conference on Advanced Information Networking and Applications · doi:10.1109/aina.2015.254 · Cited by 365
Security and privacy of smart cities: a survey, research issues and challenges
Sookhak, M., Tang, H., He, Y., & Yu, F. R. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2867288 · Cited by 212
Decentralized big data auditing for smart city environments leveraging blockchain technology
Yu, H., Yang, Z., & Sinnott, R. O. (2019) · IEEE Access · doi:10.1109/access.2018.2888940 · Cited by 130
Lins, S., Schneider, S., Szefer, J., Ibraheem, S., & Ali, A. (2019) · Communications of the Association for Information Systems · doi:10.17705/1cais.04425 · Cited by 26
Metadata
- Authors
- Yang, K., & Jia, X.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2013-09
- Volume
- 24
- Issue
- 9
- Pages
- 1717-1726
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2080488820
- Cited by
- 632
- References
- 22
- FWCI
- 93.48
- 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: An Efficient and Secure Dynamic Auditing Protocol for Data Storage in Cloud Computing. https://app.cochat.ai/papers/10.1109/tpds.2012.278
- The paper
- Yang, K., & Jia, X. (2013). An Efficient and Secure Dynamic Auditing Protocol for Data Storage in Cloud Computing. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2012.278
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.
