Book Chapter10.1007/11596370_5
Implementing a tamper-evident database system
Gerome Miklau,Dan Suciu +1 more
TL;DR: A novel relational hash tree is described, designed for efficient database processing, and strong cryptographic guarantees of integrity can be provided in a relational database with modest overhead.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Computational geometry
F. Frances Yao
- 02 Jan 1991
TL;DR: This report documents the program and the outcomes of Dagstuhl Seminar 21181 “Computational Geometry”, which was held online in a virtual manner, and 36 participants from various countries attended it.
1.6K
Time and space efficient algorithms for two-party authenticated data structures
Charalampos Papamanthou,Roberto Tamassia +1 more
- 12 Dec 2007
TL;DR: This paper presents a model and protocol for two-party authentication of data structures, whereby a client outsources its data structure and verifies that the answers to the queries have not been tampered with, thus providing an efficient authentication primitive for outsourced data.
•Proceedings Article
Proof-infused streams: enabling authentication of sliding window queries on streams
Feifei Li,Ke Yi,Marios Hadjieleftheriou,George Kollios +3 more
- 23 Sep 2007
TL;DR: This work studies a variety of authentication algorithms for selection and aggregation queries over sliding windows based on Merkle hash trees over a forest of space partitioning data structures, and tries to leverage key features, like update, query, signing, and authentication costs.
Patent
System And Method For Verifying The Integrity And Completeness Of Records
Windsor Wee Sun Hsu,Xiaonan Ma +1 more
- 08 Feb 2007
TL;DR: In this article, a correctness verification system receives a query, executes the query using a query logic, and produces a query result, which comprises data records that satisfy the query, data verification objects associated with the data records, index segments accessed during the execution of the query and index verification object associated with index segments, and the query.
48
Authenticated relational tables and authenticated skip lists
Giuseppe Di Battista,Bernardo Palazzi +1 more
- 08 Jul 2007
TL;DR: This work presents a general method, based on the usage of typical DBMS primitives, for maintaining authenticated relational tables that exploits techniques to represent hierarchical data structures into relational tables and queries that allow an efficient selection of the elements needed for authentication.
References
Computational geometry.
Michael Ian Shamos
- 01 Jan 1978
TL;DR: The first such result is provided by showing that greedy routing can be made to work on Planar triangulations, and some well known results in geometry are generalized to the topological plane.
3.3K
Computational Geometry
Franco P. Preparata,M. Shamos +1 more
- 01 Sep 1985
TL;DR: This book clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics and points the way to the solution of the more challenging problems in dimensions higher than two.
3.1K
A Certified Digital Signature
Ralph C. Merkle
- 20 Aug 1989
TL;DR: A practical digital signature system based on a conventionalryption function which is as secure as the conventional encryption function is described, without the several years delay required for certification of an untested system.
•Book
Computational geometry
F. Frances Yao
- 02 Jan 1991
TL;DR: This report documents the program and the outcomes of Dagstuhl Seminar 21181 “Computational Geometry”, which was held online in a virtual manner, and 36 participants from various countries attended it.
1.6K
Protocols for Public Key Cryptosystems
Ralph C. Merkle
- 14 Apr 1980
TL;DR: Several protocols for public key distribution and for digital signatures are briefly compared with each other and with the conventional alternative.
1.5K
Related Papers (5)
Ralph C. Merkle
- 20 Aug 1989
HweeHwa Pang,Kian-Lee Tan +1 more
- 30 Mar 2004
Jinyuan Li,Maxwell Krohn,David Mazières,Dennis Shasha +3 more
- 06 Dec 2004