Private Searching On Streaming Data

Rafail Ostrovsky; William E.  Skeith III

Paper 2005/242

Private Searching On Streaming Data

Rafail Ostrovsky and William E. Skeith III

Abstract

In this paper, we consider the problem of private searching on streaming data, where we can efficiently implement searching for documents under a secret criteria (such as 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 a Private Information Retrieval (to the more general queries and to a streaming environment as well as to public-key program obfuscation); as positive results on privacy-preserving datamining; and as a delegation of hidden program computation to other machines.

Metadata

Available format(s): PDF PS
Publication info: Published elsewhere. Abridged version appeared at CRYPTO 2005.
Keywords: Code Obfuscation Crypto-computing Software security Database security Public-key Encryption Private Information Retrieval Privacy-Preserving Keyword Search Secure Algorithms for Streaming Data Privacy-Preserving Datamining Searching with Privacy Mobile Code
Contact author(s): wskeith @ math ucla edu
History: 2006-11-03: last of 6 revisions; 2005-07-30: received; See all versions
Short URL: https://ia.cr/2005/242
License: CC BY

BibTeX

@misc{cryptoeprint:2005/242,
      author = {Rafail Ostrovsky and William E.  Skeith III},
      title = {Private Searching On Streaming Data},
      howpublished = {Cryptology ePrint Archive, Paper 2005/242},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/242}},
      url = {https://eprint.iacr.org/2005/242}
}