Cryptology ePrint Archive: Report 2015/1183

Authenticated Range \& Closest Point Queries in Zero-Knowledge

Esha Ghosh and Olga Ohrimenko and Roberto Tamassia

Abstract: We present an efficient method for answering one-dimensional range and closest-point queries in a verifiable and privacy-preserving manner. We consider a model where a data owner outsources a dataset of key-value pairs to a server, who answers range and closest-point queries issued by a client and provides proofs of the answers. The client verifies the correctness of the answers while learning nothing about the dataset besides the answers to the current and previous queries. Our work yields for the first time a zero-knowledge privacy assurance to authenticated range and closest-point queries. Previous work leaked the size of the dataset and used an inefficient proof protocol. Our construction is based on hierarchical identity-based encryption. We prove its security and analyze its efficiency both theoretically and with experiments.

Category / Keywords: cryptographic protocols / zero-knowledge datastructures, secure data outsourcing, hierarchical identitiy based encryption, zero-knowledge authenticated range and closest point queries, implementation

Date: received 10 Dec 2015

Contact author: esha_ghosh at brown edu

Available format(s): PDF | BibTeX Citation

Version: 20151213:041310 (All versions of this report)

Short URL: ia.cr/2015/1183

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]