Private searching for single and conjunctive keywords on streaming data

Authors:
Xun Yi;Elisa Bertino
Affiliations:
Victoria University, Melbourne, Australia;Purdue University, West Lafayette, USA
Venue:
Proceedings of the 10th annual ACM workshop on Privacy in the electronic society
Year:
2011

Citing 7
Cited 0

A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
New Constructions and Practical Applications for Private Stream Searching (Extended Abstract)

SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Private Searching on Streaming Data

Journal of Cryptology
New Techniques for Private Stream Searching

ACM Transactions on Information and System Security (TISSEC)
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Evaluating 2-DNF formulas on ciphertexts

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Private searching on streaming data

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current solutions for private searching on streaming data only support searching for "OR" of keywords or "AND" of two sets of keywords. In this paper, we extend the types of private queries to support searching on streaming data for an "OR" of a set of both single and conjunctive keywords. Our protocol is built on Boneh et al.'s result for the evaluation of 2-DNF formulas on ciphertexts. The size of our encrypted dictionary is O(|D|) only, which is much less than |D|2, the size of the encrypted dictionary if conjunctive keywords is treated as single keyword.