The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Authentication and integrity in outsourced databases
Abstract
In the Outsourced Database (ODB) model, entities outsource their data management needs to a third-party service provider. Such a service provider offers mechanisms for its clients to create, store, update, and access (query) their databases. This work provides mechanisms to ensure data integrity and authenticity for outsourced databases. Specifically, this article provides mechanisms that assure the querier that the query results have not been tampered with and are authentic (with respect to the actual data owner). It investigates both the security and efficiency aspects of the problem and constructs several secure and practical schemes that facilitate the integrity and authenticity of query replies while incurring low computational and communication costs.
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
Practical techniques for searches on encrypted data
Song, D. X., Wagner, D., & Perrig, A. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848445 · Cited by 3,350
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
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
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
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
Providing database as a service
Hacigumus, H., Iyer, B., & Mehrotra, S. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994695 · Cited by 613
Protecting data privacy in private information retrieval schemes
Gertner, Y., Ishai, Y., Kushilevitz, E., & Malkin, T. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276723 · Cited by 445
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
Bellare, M., & Palacio, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_11 · Cited by 312
Authenticating query results in edge computing
Pang, H. H., & Tan, K.-L. (2004) · Proceedings. 20th International Conference on Data Engineering · doi:10.1109/icde.2004.1320027 · Cited by 241
Authentic Third-Party Data Publication
Devanbu, P., Gertz, M., Martel, C., & Stubblebine, S. G. (2002) · IFIP International Federation for Information Processing · doi:10.1007/0-306-47008-x_9 · Cited by 227
Private Information Retrieval by Keywords
Chor, B., Gilboa, N., & Naor, M. (1997) · Cited by 175
Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —
Naccache, D., M'RaÏhi, D., Vaudenay, S., & Raphaeli, D. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053426 · Cited by 165
Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups.
Joux, A., & Nguyen, K. T. (2001) · Cited by 143
Attacking and Repairing Batch Verification Schemes
Boyd, C., & Pavlovski, C. J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44448-3_5 · Cited by 75
Fiat, A. (1997) · Journal of Cryptology · doi:10.1007/s001459900021 · Cited by 70
Cited by
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
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
Self-citationDynamic authenticated index structures for outsourced databases
Li, F., Hadjieleftheriou, M., Kollios, G., & Reyzin, L. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142488 · Cited by 415
Cloud Computing Security: From Single to Multi-clouds
AlZain, M. A., Pardede, E., Soh, B., & Thom, J. A. (2012) · 2012 45th Hawaii International Conference on System Sciences · doi:10.1109/hicss.2012.153 · Cited by 285
Verifying completeness of relational query results in data publishing
Pang, H., Jain, A., Ramamritham, K., & Tan, K.-L. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066204 · Cited by 267
Metadata
- Authors
- Mykletun, E., Narasimha, M., & Tsudik, G.
- Venue
- ACM Transactions on Storage
- Published
- 2006-05
- Volume
- 2
- Issue
- 2
- Pages
- 107-138
- ISSN
- 1553-3077 (ISSN-L)
- 1553-3093
- OpenAlex
- W1564122094
- Cited by
- 382
- References
- 21
- FWCI
- 76.79
- 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.