Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees

Concise UC Zero-Knowledge Proofs for Oblivious Updatable Databases

“…Several data structures that offer ZK properties exist. Examples include ZK sets [6], [15]- [17], updatable ZK databases [7], [18], ZK lists [19], [20] and trees [20]. These constructions typically require the size of the data structure to be hidden, which is a property we usually do not need for the applications of committed databases (CD) that we consider in this paper.…”

“…(Some works relax this property [12], [21], [22].) On the other hand, for CD it is fundamental that the data structure can be modified dynamically, which is provided only in [7], [18], [20]. We provide a detailed comparison between those constructions and our committed database in Section IX.…”

“…Most constructions for ZKADS do not allow the data owner to perform updates (see [19] and references therein). Recently, an updatable ZKADS for sets with proofs of membership [55], and an updatable ZKADS for lists, trees and partially-ordered sets of bounded dimension [20] were proposed.…”