Authentic data publication over the internet

  • Authors:
  • Premkumar Devanbu;Michael Gertz;Charles Martel;Stuart G. Stubblebine

  • Affiliations:
  • Department of Computer Science, University of California, Davis CA;Department of Computer Science, University of California, Davis, CA;Department of Computer Science, University of California, Davis, CA;Stubblebine Consulting, LLC, 8 Wayne Blvd, Madison, NJ

  • Venue:
  • Journal of Computer Security - IFIP 2000
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Integrity critical databases, such as financial information used in high-value decisions, are frequently published over the Internet. Publishers of such data must satisfy the integrity, authenticity, and nonrepudiation requirements of clients. Providing this protection over public data networks is an expensive proposition. This is, in part, due to the difficulty of building and running secure systems. In practice, large systems can not be verified to be secure and are frequently penetrated. The negative consequences of a system intrusion at the publisher can be severe. The problem is further complicated by data and server replication to satisfy availability and scalability requirements.To our knowledge this work is the first of its kind to give general approaches for reducing the trust required of publishers of large databases. To do this, we separate the roles of data owner and data publisher. With a few digital signatures on the part of the owner and no trust required of a publisher, we give techniques based on Merkle hash trees that publishers can use to provide authenticity and nonrepudiation of the answer to database queries posed by a client. This is done without requiring a key to be held in an on-line system, thus reducing the impact of system penetrations. By reducing the trust required of the publisher, our solution is a step towards the publication of large databases in a scalable manner.