Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
E Ghosh, MT Goodrich, O Ohrimenko, R Tamassia
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Published : 2016
We propose a three-party model for maintaining a dynamic data structure that supports verifiable and privacy-preserving (zeroknowledge) queries. We give efficient constructions supporting this model for order queries on data organized in lists, trees, and partially-ordered sets of bounded dimension.