The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Authorized Public Auditing of Dynamic Big Data Storage on Cloud with Efficient Verifiable Fine-Grained Updates
Abstract
Cloud computing opens a new era in IT as it can provide various elastic and scalable IT services in a pay-as-you-go fashion, where its users can reduce the huge capital investments in their own IT infrastructure. In this philosophy, users of cloud storage services no longer physically maintain direct control over their data, which makes data security one of the major concerns of using cloud. Existing research work already allows data integrity to be verified without possession of the actual data file. When the verification is done by a trusted third party, this verification process is also called data auditing, and this third party is called an auditor. However, such schemes in existence suffer from several common drawbacks. First, a necessary authorization/authentication process is missing between the auditor and cloud service provider, i.e., anyone can challenge the cloud service provider for a proof of integrity of certain file, which potentially puts the quality of the so-called ‘auditing-as-a-service’ at risk; Second, although some of the recent work based on BLS signature can already support fully dynamic data updates over fixed-size data blocks, they only support updates with fixed-sized blocks as basic unit, which we call coarse-grained updates. As a result, every small update will cause re-computation and updating of the authenticator for an entire file block, which in turn causes higher storage and communication overheads. In this paper, we provide a formal analysis for possible types of fine-grained data updates and propose a scheme that can fully support authorized auditing and fine-grained update requests. Based on our scheme, we also propose an enhancement that can dramatically reduce communication overheads for verifying small updates. Theoretical analysis and experimental results demonstrate that our scheme can offer not only enhanced security and flexibility, but also significantly lower overhead for big data applications with a large number of frequent small updates, such as applications in social media and business transactions.
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
A Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998
Cited by
Gai, K., Qiu, M., & Sun, X. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2017.10.011 · Cited by 566
Big data privacy: a technological perspective and review
Jain, P., Gyanchandani, M., & Khare, N. (2016) · Journal of Big Data · doi:10.1186/s40537-016-0059-y · Cited by 392
Protection of Big Data Privacy
Mehmood, A., Natgunanathan, I., Xiang, Y., Hua, G., & Guo, S. (2016) · IEEE Access · doi:10.1109/access.2016.2558446 · Cited by 276
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
Metadata
- Authors
- Liu, C., Chen, J., Yang, L. T., Zhang, X., Yang, C., Ranjan, R., & Rao, K.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2014-09
- Volume
- 25
- Issue
- 9
- Pages
- 2234-2244
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2078656587
- Cited by
- 230
- References
- 1
- FWCI
- 55.56
- 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: Authorized Public Auditing of Dynamic Big Data Storage on Cloud with Efficient Verifiable Fine-Grained Updates. https://app.cochat.ai/papers/10.1109/tpds.2013.191
- The paper
- Liu, C., Chen, J., Yang, L. T., Zhang, X., Yang, C., Ranjan, R., & Rao, K. (2014). Authorized Public Auditing of Dynamic Big Data Storage on Cloud with Efficient Verifiable Fine-Grained Updates. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2013.191
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.