Verifiable Auditing for Outsourced Database in Cloud Computing
Open accessThe DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Abstract
The notion of database outsourcing enables the data owner to delegate the database management to a cloud service provider (CSP) that provides various database services to different users. Recently, plenty of research work has been done on the primitive of outsourced database. However, it seems that no existing solutions can perfectly support the properties of both correctness and completeness for the query results, especially in the case when the dishonest CSP intentionally returns an empty set for the query request of the user. In this paper, we propose a new verifiable auditing scheme for outsourced database, which can simultaneously achieve the correctness and completeness of search results even if the dishonest CSP purposely returns an empty set. Furthermore, we can prove that our construction can achieve the desired security properties even in the encrypted outsourced database. Besides, the proposed scheme can be extended to support the dynamic database setting by incorporating the notion of verifiable database with updates.
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
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492 · cited 14×
“A Bloom filter tree refers to a binary tree structure (Fig.”
BackgroundInfluentialBuyya, R., Yeo, C. S., Venugopal, S., Broberg, J., & Brandic, I. (2009) · Future Generation Computer Systems · doi:10.1016/j.future.2008.12.001 · Cited by 5,937
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 · cited 1×
“The seminal works include Provable Data Possession (PDP) [1] and Proof of Retrievability (POR) [23].”
MethodNetwork Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991 · cited 2×
“According to [2], to achieve the requirement of false positive Pf 2 (20), the ratio of the length of Bloom filter and tuple number is fixed to 32.”
BackgroundPors: 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 · cited 1×
“The seminal works include Provable Data Possession (PDP) [1] and Proof of Retrievability (POR) [23].”
MethodEnabling 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
Protocols 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 · cited 1×
“Merkle hash tree [25] is a specific binary tree, which is used”
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 · cited 1×
“remote data integrity verification have been investigated in [17], [21], [35], [36], [37].”
BackgroundPrivacy-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
Executing SQL over encrypted data in the database-service-provider model
Hacigümüş, H., Iyer, B., Li, C., & Mehrotra, S. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564717 · Cited by 1,149 · cited 1×
“The primitive of database outsourcing has been well studied in the past decades [14], [20], [22], [24], [27], [29], [30],”
Background
Cited by
Toward Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement
Fu, Z., Wu, X., Guan, C., Sun, X., & Ren, K. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2596138 · Cited by 547
Identity-Based Remote Data Integrity Checking With Perfect Data Privacy Preserving for Cloud Storage
Yu, Y., Au, M. H., Ateniese, G., Huang, X., Susilo, W., Dai, Y., & Min, G. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2615853 · Cited by 479
Self-citation
Metadata
- Authors
- Wang, J., Chen, X., Huang, X., You, I., & Xiang, Y.
- Venue
- IEEE Transactions on Computers
- Published
- 2015-11-01
- Volume
- 64
- Issue
- 11
- Pages
- 3293-3303
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W1991318406
- Cited by
- 158
- References
- 39
- FWCI
- 60.36
- Type
- journal article
- Language
- en
- Open access
- green
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.