Implementing a tamper-evident database system

  • Authors:
  • Gerome Miklau;Dan Suciu

  • Affiliations:
  • University of Massachusetts, Amherst;University of Washington

  • Venue:
  • ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data integrity is an assurance that data has not been modified in an unknown or unauthorized manner. The goal of this paper is to allow a user to leverage a small amount of trusted client-side computation to achieve guarantees of integrity when interacting with a vulnerable or untrusted database server. To achieve this goal we describe a novel relational hash tree, designed for efficient database processing, and evaluate the performance penalty for integrity guarantees. We show that strong cryptographic guarantees of integrity can be provided in a relational database with modest overhead.