TY - GEN
T1 - Query execution assurance for outsourced databases
AU - Sion, Radu
PY - 2005
Y1 - 2005
N2 - In this paper we propose and analyze a method for proofs of actual query execution in an outsourced database framework, in which a client outsources its data management needs to a specialized provider. The solution is not limited to simple selection predicate queries but handles arbitrary query types. While this work focuses mainly on read-only, compute-intensive (e.g. data-mining) queries, it also provides preliminary mechanisms for handling data updates (at additional costs). We introduce query execution proofs; for each executed batch of queries the database service provider is required to provide a strong cryptographic proof that provides assurance that the queries were actually executed correctly over their entire target data set. We implement a proof of concept and present experimental results in a real-world data mining application, proving the deployment feasibility of our solution. We analyze the solution and show that its overheads are reasonable and are far outweighed by the added security bene ts. For example an assurance level of over 95% can be achieved with less than 25% execution time overhead.
AB - In this paper we propose and analyze a method for proofs of actual query execution in an outsourced database framework, in which a client outsources its data management needs to a specialized provider. The solution is not limited to simple selection predicate queries but handles arbitrary query types. While this work focuses mainly on read-only, compute-intensive (e.g. data-mining) queries, it also provides preliminary mechanisms for handling data updates (at additional costs). We introduce query execution proofs; for each executed batch of queries the database service provider is required to provide a strong cryptographic proof that provides assurance that the queries were actually executed correctly over their entire target data set. We implement a proof of concept and present experimental results in a real-world data mining application, proving the deployment feasibility of our solution. We analyze the solution and show that its overheads are reasonable and are far outweighed by the added security bene ts. For example an assurance level of over 95% can be achieved with less than 25% execution time overhead.
UR - https://www.scopus.com/pages/publications/33745601730
M3 - Conference contribution
AN - SCOPUS:33745601730
SN - 1595931546
SN - 9781595931542
T3 - VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases
SP - 601
EP - 612
BT - VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases
T2 - VLDB 2005 - 31st International Conference on Very Large Data Bases
Y2 - 30 August 2005 through 2 September 2005
ER -