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

We propose a three-party model for maintaining a dynamic data structure that supports verifiable and privacy-preserving zero-knowledge queries. We give efficient constructions supporting this model for order queries on data organized in lists, trees, and partially-ordered sets of bounded dimension.