Private Searching on Streaming Data

  • Authors:
  • Rafail Ostrovsky;William E. Skeith, III

  • Affiliations:
  • Department of Mathematics, University of California, Los Angeles, CA 90095, USA;Department of Mathematics, University of California, Los Angeles, CA 90095, USA

  • Venue:
  • Journal of Cryptology
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we consider the problem of private searching on streaming data, where we can efficiently implement searching for documents that satisfy a secret criteria (such as the presence or absence of a hidden combination of hidden keywords) under various cryptographic assumptions. Our results can be viewed in a variety of ways: as a generalization of the notion of private information retrieval (to more general queries and to a streaming environment); as positive results on privacy-preserving datamining; and as a delegation of hidden program computation to other machines.