You are looking at a specific version 20150326:094855 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- Category
- Applications
- Publication info
- Preprint. MINOR revision.
- Keywords
- network data privacycloud securityfully dynamic zero-knowledge updateszero-knowledge order queriesauthenticated online list labelingtreespartial ordersaggregate 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