The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing
Abstract
Cloud Computing is the long dreamed vision of computing as a utility, where users can remotely store their data into the cloud so as to enjoy the on-demand high quality applications and services from a shared pool of configurable computing resources. By data outsourcing, users can be relieved from the burden of local data storage and maintenance. However, the fact that users no longer have physical possession of the possibly large size of outsourced data makes the data integrity protection in Cloud Computing a very challenging and potentially formidable task, especially for users with constrained computing resources and capabilities. Thus, enabling public auditability for cloud data storage security is of critical importance so that users can resort to an external audit party to check the integrity of outsourced data when needed. To securely introduce an effective third party auditor (TPA), the following two fundamental requirements have to be met: 1) TPA should be able to efficiently audit the cloud data storage without demanding the local copy of data, and introduce no additional on-line burden to the cloud user; 2) The third party auditing process should bring in no new vulnerabilities towards user data privacy. In this paper, we utilize and uniquely combine the public key based homomorphic authenticator with random masking to achieve the privacy-preserving public cloud data auditing system, which meets all above requirements. To support efficient handling of multiple auditing tasks, we further explore the technique of bilinear aggregate signature to extend our main result into a multi-user setting, where TPA can perform multiple auditing tasks simultaneously. Extensive security and performance analysis shows the proposed schemes are provably secure and highly efficient.
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) · Cited by 5,796
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
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
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
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
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
Boneh, D., Gentry, C., Lynn, B., & Shacham, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_26 · Cited by 1,821
Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing
Yu, S., Wang, C., Ren, K., & Lou, W. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462174 · Cited by 1,602
Self-citationProtocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
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
Security Proofs for Signature Schemes
Pointcheval, D., & Stern, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_33 · Cited by 1,077
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-citationEnsuring data storage security in Cloud Computing
Wang, C., Wang, Q., Ren, K., & Lou, W. (2009) · 2009 17th International Workshop on Quality of Service · doi:10.1109/iwqos.2009.5201385 · Cited by 767
Self-citationEfficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_68 · Cited by 751
Fast batch verification for modular exponentiation and digital signatures
Bellare, M., Garay, J. A., & Rabin, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054130 · Cited by 443
Efficient identification andsignatures for smart cards
Schnorr, C. P. (1990) · International Cryptology Conference · Cited by 202
Batch Verification of Short Signatures
Camenisch, J., Hohenberger, S., & Pedersen, M. Ø. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72540-4_14 · Cited by 170
Cited by
On blockchain and its integration with IoT. Challenges and opportunities
Reyna, A., Martín, C., Chen, J., Soler, E., & Díaz, M. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.05.046 · Cited by 1,908
A Survey on the Edge Computing for the Internet of Things
Yu, W., Liang, F., He, X., Hatcher, W. G., Lu, C., Lin, J., & Yang, X. (2018) · IEEE Access · doi:10.1109/access.2017.2778504 · Cited by 1,520
Privacy-Preserving Public Auditing for Secure Cloud Storage
Wang, C., Chow, S. S. M., Wang, Q., Ren, K., & Lou, W. (2013) · IEEE Transactions on Computers · doi:10.1109/tc.2011.245 · Cited by 1,374
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-citation
Metadata
- Authors
- Wang, C., Wang, Q., Ren, K., & Lou, W.
- Venue
- 2010 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2010-03
- Pages
- 1-9
- OpenAlex
- W2125858711
- Cited by
- 1,415
- References
- 19
- FWCI
- 54.87
- 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.