Partially materialized digest scheme: An efficient verification method for outsourced databases

Mouratidis, K; Sacharidis, D; Pang, H

dc.contributor.author	Mouratidis, K	en
dc.contributor.author	Sacharidis, D	en
dc.contributor.author	Pang, H	en
dc.date.accessioned	2014-03-01T01:31:37Z
dc.date.available	2014-03-01T01:31:37Z
dc.date.issued	2009	en
dc.identifier.issn	1066-8888	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/19852
dc.subject	Authentication in outsourced databases	en
dc.subject	Query result verification	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.other	And verifications	en
dc.subject.other	Authentication informations	en
dc.subject.other	Conventional approaches	en
dc.subject.other	Data indices	en
dc.subject.other	Database models	en
dc.subject.other	Empirical evaluations	en
dc.subject.other	Query result verification	en
dc.subject.other	Real datums	en
dc.subject.other	Spatial queries	en
dc.subject.other	Static and dynamics	en
dc.subject.other	User queries	en
dc.subject.other	Verification methods	en
dc.subject.other	Access control	en
dc.subject.other	Authentication	en
dc.subject.other	Database systems	en
dc.subject.other	Decision trees	en
dc.subject.other	Mathematical models	en
dc.subject.other	Polarization mode dispersion	en
dc.subject.other	Trees (mathematics)	en
dc.title	Partially materialized digest scheme: An efficient verification method for outsourced databases	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s00778-008-0108-z	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s00778-008-0108-z	en
heal.language	English	en
heal.publicationDate	2009	en
heal.abstract	In the outsourced database model, a data owner publishes her database through a third-party server; i.e., the server hosts the data and answers user queries on behalf of the owner. Since the server may not be trusted, or may be compromised, users need a means to verify that answers received are both authentic and complete, i.e., that the returned data have not been tampered with, and that no qualifying results have been omitted. We propose a result verification approach for one-dimensional queries, called Partially Materialized Digest scheme (PMD), that applies to both static and dynamic databases. PMD uses separate indexes for the data and for their associated verification information, and only partially materializes the latter. In contrast with previous work, PMD avoids unnecessary costs when processing queries that do not request verification, achieving the performance of an ordinary index (e.g., a B+-tree). On the other hand, when an authenticity and completeness proof is required, PMD outperforms the existing state-of-the-art technique by a wide margin, as we demonstrate analytically and experimentally. Furthermore, we design two verification methods for spatial queries. The first, termed Merkle R-tree (MR-tree), extends the conventional approach of embedding authentication information into the data index (i.e., an R-tree). The second, called Partially Materialized KD-tree (PMKD), follows the PMD paradigm using separate data and verification indexes. An empirical evaluation with real data shows that the PMD methodology is superior to the traditional approach for spatial queries too. © 2008 Springer-Verlag.	en
heal.publisher	SPRINGER	en
heal.journalName	VLDB Journal	en
dc.identifier.doi	10.1007/s00778-008-0108-z	en
dc.identifier.isi	ISI:000262317000016	en
dc.identifier.volume	18	en
dc.identifier.issue	1	en
dc.identifier.spage	363	en
dc.identifier.epage	381	en