Private database search with sublinear query time

  • Authors:

  • Keith B. Frikken;Boyang Li

  • Affiliations:

  • Department of Computer Science and Software Engineering, Miami University, Oxford, OH;Department of Computer Science and Software Engineering, Miami University, Oxford, OH

  • Venue:
  • DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of private database search has been well studied. The notion of privacy considered is twofold: i) the querier only learns the result of the query (and things that can be deduced from it), and ii) the server learns nothing (in a computational sense) about the query. A fundamental drawback with prior approaches is that the query computation is linear in the dataset. We overcome this drawback by making the following assumption: the server has its dataset ahead of time and is able to perform linear precomputation for each query. This new model, which we call the precomputation model, is appropriate in circumstances where it is crucial that queries are answered efficiently once they become available. Our main contribution is a precomputed search protocol that requires linear precomputation time but that allows logarithmic search time. Using this protocol, we then show how to answer the following types of queries with sublinear query computation in this precomputation model: i) point existence queries, ii) rank queries, iii) lookup queries, and iv) one-dimensional range queries.