Cryptology ePrint Archive: Report 2015/283

Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data

Esha Ghosh and Michael T. Goodrich and Olga Ohrimenko and Roberto Tamassia

Abstract: We show how to provide privacy-preserving (zero-knowledge) answers to order queries on network data that is organized in lists, trees, and partially-ordered sets of bounded dimension. Our methods are efficient and dynamic, in that they allow for updates in the ordering information while also providing for quick and verifiable answers to queries that reveal no information besides the answers to the queries themselves.

Category / Keywords: applications / network data privacy, cloud security, fully dynamic zero-knowledge updates, zero-knowledge order queries, authenticated online list labeling, trees, partial orders, aggregate signature

Date: received 25 Mar 2015

Contact author: esha_ghosh at brown edu,goodrich@uci edu, oohrim@microsoft com,roberto_tamassia@brown edu

Available format(s): PDF | BibTeX Citation

Version: 20150326:094855 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]