Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 162

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Efficient Public Verification of Data Integrity for Cloud Storage Systems from Indistinguishability Obfuscation

Zhang, Yuan, Xu, Chunxiang, Liang, Xiaohui, Li, Hongwei, Mu, Yi, Zhang, Xiaojun · 2017 · IEEE Transactions on Information Forensics and Security

Abstract

Cloud storage services allow users to outsource their data to cloud servers to save local data storage costs. However, unlike using local storage devices, users do not physically manage the data stored on cloud servers; therefore, the data integrity of the outsourced data has become an issue. Many public verification schemes have been proposed to enable a third-party auditor to verify the data integrity for users. These schemes make an impractical assumption-the auditors have enough computation capability to bear expensive verification costs. In this paper, we propose a novel public verification scheme for the cloud storage using indistinguishability obfuscation, which requires a lightweight computation on the auditor and the delegate most computation to the cloud. We further extend our scheme to support batch verification and data dynamic operations, where multiple verification tasks from different users can be performed efficiently by the auditor and the cloud-stored data can be updated dynamically. Compared with other existing works, our scheme significantly reduces the auditor's computation overhead. Moreover, the batch verification overhead on the auditor side in our scheme is independent of the number of verification tasks. Our scheme could be practical in a scenario, where the data integrity verifications are executed frequently, and the number of verification tasks (i.e., the number of users) is numerous; even if the auditor is equipped with a low-power device, it can verify the data integrity efficiently. We prove the security of our scheme under the strongest security model proposed by Shi et al. (ACM CCS 2013). Finally, we conduct a performance analysis to demonstrate that our scheme is more efficient than other existing works in terms of the auditor's communication and computation efficiency.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tifs.2016.2631951

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 162

Metadata

Authors
Zhang, Y., Xu, C., Liang, X., Li, H., Mu, Y., & Zhang, X.
Venue
IEEE Transactions on Information Forensics and Security
Published
2017-03
Volume
12
Issue
3
Pages
676-688
ISSN
  • 1556-6013 (ISSN-L)
  • 1556-6021
OpenAlex
W2557181213
Cited by
162
References
1
FWCI
42.36
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: Efficient Public Verification of Data Integrity for Cloud Storage Systems from Indistinguishability Obfuscation. https://app.cochat.ai/papers/10.1109/tifs.2016.2631951
The paper
Zhang, Y., Xu, C., Liang, X., Li, H., Mu, Y., & Zhang, X. (2017). Efficient Public Verification of Data Integrity for Cloud Storage Systems from Indistinguishability Obfuscation. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2016.2631951

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.