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. © 2007 International Association for Cryptologic Research.
CITATION STYLE
Ostrovsky, R., & Skeith, W. E. (2007). Private searching on streaming data. Journal of Cryptology, 20(4), 397–430. https://doi.org/10.1007/s00145-007-0565-3
Mendeley helps you to discover research relevant for your work.