Verifiable algorithm for outsourced database with updating

Z, Guo; Li, Hui; Cao, Chunjie; Wei, Zhengxi

doi:10.1007/s10586-017-1133-8

Cited by 3 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Benabbas et al [16] present a delegation scheme on verifiable database minimizing the resources required by the clients of verifiable database. Guo et al [25] improve the update efficiency using a long polynomial for public keys and a short polynomial for private keys. Miao et al [36] enable efficient keyword search for VDB using enhanced vector commitment while HVDB [65] supports hierarchical verification by building a vector commitment tree.…”

Section: Verifiable Databasementioning

confidence: 99%

Spitz

et al. 2020

View full text Add to dashboard Cite

Databases in the past have helped businesses maintain and extract insights from their data. Today, it is common for a business to involve multiple independent, distrustful parties. This trend towards decentralization introduces a new and important requirement to databases: the integrity of the data, the history, and the execution must be protected. In other words, there is a need for a new class of database systems whose integrity can be verified (or verifiable databases). In this paper, we identify the requirements and the design challenges of verifiable databases. We observe that the main challenges come from the need to balance data immutability, tamper evidence, and performance. We first consider approaches that extend existing OLTP and OLAP systems with support for verification. We next examine a clean-slate approach, by describing a new system, Spitz, specifically designed for efficiently supporting immutable and tamperevident transaction management. We conduct a preliminary performance study of both approaches against a baseline system, and provide insights on their performance.

show abstract