Paper 2015/1183

Authenticated Range \& Closest Point Queries in Zero-Knowledge

Esha Ghosh, Olga Ohrimenko, and Roberto Tamassia


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.

Available format(s)
Cryptographic protocols
Publication info
Preprint. MINOR revision.
zero-knowledge datastructuressecure data outsourcinghierarchical identitiy based encryptionimplementation
Contact author(s)
esha_ghosh @ brown edu
2015-12-13: received
Short URL
Creative Commons Attribution


      author = {Esha Ghosh and Olga Ohrimenko and Roberto Tamassia},
      title = {Authenticated Range \& Closest Point Queries in Zero-Knowledge},
      howpublished = {Cryptology ePrint Archive, Paper 2015/1183},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.