conference paper

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

Esha Ghosh^a✉, Michael T. Goodrich^b, Olga Ohrimenko^c, Roberto Tamassia^a

^aDepartment Computer Science, Brown University, Providence, USA
^bDepartment Computer Science, University of California, Irvine, USA
^cMicrosoft Research, Cambridge, UK
✉Corresponding author

Lecture notes in computer science Springer Science+Business Media2016-01-01 7 citations42 references

Looking for the full paper…

Export

Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.

Abstract

No abstract is available from our sources. Use “Read paper” to view it.

TL;DRThis work proposes a three-party model for maintaining a dynamic data structure that supports verifiable and privacy-preserving zero-knowledge queries and gives efficient constructions supporting this model for order queries on data organized in lists, trees, and partially-ordered sets of bounded dimension. (Semantic Scholar)

Plain-language summary

AI illustration of the topic of “Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees”

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

Abstract

Plain-language summary

Discussion