A Hierarchical VDB Scheme with Scalable Verification and Tampered Record Localization

Abstract

The notion of verifiable database (VDB) plays an important role in secure outsourcing of data storage, which allows a client, typically a resource-limited one, to outsource a large-scale database to an untrusted server and make retrieval and update queries. For each query request, the server responds with a query result and a proof that is used to verify the result. Many VDB schemes have been proposed to provide the verification of outsourced databases, however, the existing VDB schemes are impracticable because of their inefficiency of initialization and query, unacceptable public key size and inability of tampered record localization scope. Therefore, in this paper, we present a new VDB scheme based on the Vector Commitments Tree (VCT) which is a new extension of the traditional Vector Commitments (VC). Our VDB scheme is superior to exiting schemes in at least two aspects: one is that the efficiency of initialization and query is greatly improved, and the other is that hierarchical scalable verification and tampered record localization are realized.