Verified query results from hybrid authentication trees

摘要: We address the problem of verifying accuracy query results provided by an untrusted third party Publisher on behalf a trusted data Owner. propose flexible database verification structure, Hybrid Authentication Tree (HAT), based fast cryptographic hashing and careful use more expensive one-way accumulator. This eliminates dependence tree height earlier Merkle proposals improves VB tree, recent proposal to reduce proof sizes, eliminating trust assumption reliance signatures. An evaluation against Authentic Publication showing that HAT provides smallest proofs faster than tree. With moderate bandwidth limitations, HATs low overhead reduces transfer time significantly outweigh Publication. A supports two modes can vary per Client match resources applications. flexibility allows best performance both hash accumulator methods.