Super-efficient verification of dynamic outsourced databases

37Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previous approaches by considering super-efficient answer verification, where answers to queries are validated in time asymptotically less that the time spent to produce them and using lightweight cryptographic operations. We achieve this property by adopting the decoupling of query answering and answer verification in a way designed for queries related to range search. Our techniques allow for efficient updates of the database and protect against replay attacks performed by the responder. One such technique uses an off-line audit mechanism: the data source and the user keep digests of the sequence of operations, yet are able to jointly audit the responder to determine if a replay attack has occurred since the last audit. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Goodrich, M. T., Tamassia, R., & Triandopoulos, N. (2008). Super-efficient verification of dynamic outsourced databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4964 LNCS, pp. 407–424). https://doi.org/10.1007/978-3-540-79263-5_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free