Paper 2015/283 Original: eprint.iacr.org/2015/283 ↗
Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data
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.
- History
- 2015-03-26: last updated
- 2015-03-26: published
- Short URL
- https://ia.cr/2015/283
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}