The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Panda: Public Auditing for Shared Data with Efficient User Revocation in the Cloud
Abstract
With data storage and sharing services in the cloud, users can easily modify and share data as a group. To ensure shared data integrity can be verified publicly, users in the group need to compute signatures on all the blocks in shared data. Different blocks in shared data are generally signed by different users due to data modifications performed by different users. For security reasons, once a user is revoked from the group, the blocks which were previously signed by this revoked user must be re-signed by an existing user. The straightforward method, which allows an existing user to download the corresponding part of shared data and re-sign it during user revocation, is inefficient due to the large size of shared data in the cloud. In this paper, we propose a novel public auditing mechanism for the integrity of shared data with efficient user revocation in mind. By utilizing the idea of proxy re-signatures, we allow the cloud to re-sign blocks on behalf of existing users during user revocation, so that existing users do not need to download and re-sign blocks by themselves. In addition, a public verifier is always able to audit the integrity of shared data without retrieving the entire data from the cloud, even if some part of shared data has been re-signed by the cloud. Moreover, our mechanism is able to support batch auditing by verifying multiple auditing tasks simultaneously. Experimental results show that our mechanism can significantly improve the efficiency of user revocation.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 3×
“Given s1 and s2, two random values a1, a2 in Zp and a block m 0 ¼ a1m1þ a2m2 2 Zp, a verifier is able to check the correctness of blockm0 without knowingm1 andm2.”
BackgroundArmbrust, 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
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
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
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
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
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
Ensuring 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
Toward Secure and Dependable Storage Services in Cloud Computing
Wang, C., Wang, Q., Ren, K., Cao, N., & Lou, W. (2012) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2011.24 · Cited by 643
Oruta: privacy-preserving public auditing for shared data in the cloud
Wang, B., Li, B., & Li, H. (2014) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2014.2299807 · Cited by 458
Self-citationPORs: Proofs of Retrievability for Large FilesPreprint
Juels, A., & Kaliski, B. S. (2007) · Cited by 404
Dynamic Audit Services for Outsourced Storages in Clouds
Zhu, Y., Ahn, G.-J., Hu, H., Yau, S. S., An, H. G., & Hu, C.-J. (2013) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2011.51 · Cited by 319
Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud
Liu, X., Zhang, Y., Wang, B., & Yan, J. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.331 · Cited by 274
Self-citationFindU: Privacy-preserving personal profile matching in mobile social networks
Li, M., Cao, N., Yu, S., & Lou, W. (2011) · 2011 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2011.5935065 · Cited by 223
Public auditing for shared data with efficient user revocation in the cloud
Wang, B., Li, B., & Li, H. (2013) · 2013 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2013.6567101 · Cited by 180
Self-citationRemote data checking for network coding-based distributed storage systems
Chen, B., Curtmola, R., Ateniese, G., & Burns, R. (2010) · Proceedings of the 2010 ACM workshop on Cloud computing security workshop · doi:10.1145/1866835.1866842 · Cited by 178
CL-PRE: a certificateless proxy re-encryption scheme for secure data sharing with public cloud
Xu, L., Wu, X., & Zhang, X. (2012) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2414456.2414507 · Cited by 160
Storing Shared Data on the Cloud via Security-Mediator
Wang, B., Chow, S. S. M., Li, M., & Li, H. (2013) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2013.60 · Cited by 126
Self-citationHourglass schemes: how to prove that cloud files are encrypted
van Dijk, M., Juels, A., Oprea, A., Rivest, R. L., Stefanov, E., & Triandopoulos, N. (2012) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2382196.2382227 · Cited by 76
Multi-user dynamic proofs of data possession using trusted hardware
Tate, S. R., Vishwanathan, R., & Everhart, L. (2013) · ACM Conference on Data and Application Security and Privacy (CODASPY) · doi:10.1145/2435349.2435400 · Cited by 34
Cited by
Oruta: privacy-preserving public auditing for shared data in the cloud
Wang, B., Li, B., & Li, H. (2014) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2014.2299807 · Cited by 458
Self-citationFan, K., Ren, Y., Wang, Y., Li, H., & Yang, Y. (2018) · IET Communications · doi:10.1049/iet-com.2017.0619 · Cited by 177
Self-citation
Metadata
- Authors
- Wang, B., Li, B., & Li, H.
- Venue
- IEEE Transactions on Services Computing
- Published
- 2015-01
- Volume
- 8
- Issue
- 1
- Pages
- 92-106
- ISSN
- 1939-1374 (ISSN-L)
- OpenAlex
- W1974304004
- Cited by
- 321
- References
- 24
- FWCI
- 78.59
- 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
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.