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

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

Paper 2015/283

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

Esha Ghosh, Michael T. Goodrich, 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.

Metadata

Available format(s): PDF
Category: Applications
Publication info: Preprint. MINOR revision.
Keywords: network data privacy cloud security fully dynamic zero-knowledge updates zero-knowledge order queries authenticated online list labeling trees partial orders aggregate signature
Contact author(s): esha_ghosh @ brown edu
goodrich @ uci edu
oohrim @ microsoft com
roberto_tamassia @ brown edu
History: 2015-03-26: received
Short URL: https://ia.cr/2015/283
License: CC BY

BibTeX

@misc{cryptoeprint:2015/283,
      author = {Esha Ghosh and Michael T.  Goodrich and Olga Ohrimenko and Roberto Tamassia},
      title = {Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/283},
      year = {2015},
      url = {https://eprint.iacr.org/2015/283}
}