Private searching on streaming data based on keyword frequency

Xun Yi, Elisa Bertino, Jaideep Vaidya, Chaoping Xing

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


Private searching on streaming data is a process to dispatch to a public server a program, which searches streaming sources of data without revealing searching criteria and then sends back a buffer containing the findings. From an Abelian group homomorphic encryption, the searching criteria can be constructed by only simple combinations of keywords, for example, disjunction of keywords. The recent breakthrough in fully homomorphic encryption has allowed us to construct arbitrary searching criteria theoretically. In this paper, we consider a new private query, which searches for documents from streaming data on the basis of keyword frequency, such that the frequency of a keyword is required to be higher or lower than a given threshold. This form of query can help us in finding more relevant documents. Based on the state of the art fully homomorphic encryption techniques, we give disjunctive, conjunctive, and complement constructions for private threshold queries based on keyword frequency. Combining the basic constructions, we further present a generic construction for arbitrary private threshold queries based on keyword frequency. Our protocols are semantically secure as long as the underlying fully homomorphic encryption scheme is semantically secure.

Original languageEnglish (US)
Article number6588225
Pages (from-to)155-167
Number of pages13
JournalIEEE Transactions on Dependable and Secure Computing
Issue number2
StatePublished - 2014

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


  • Private searching on streaming data
  • binary linear code
  • fully homomorphic encryption


Dive into the research topics of 'Private searching on streaming data based on keyword frequency'. Together they form a unique fingerprint.

Cite this