Peer-to-Peer Private Information Retrieval

Authors:
Josep Domingo-Ferrer;Maria Bras-Amorós
Affiliations:
Department of Computer Engineering and Mathematics, Universitat Rovira i Virgili, UNESCO Chair in Data Privacy, Tarragona E-43007;Department of Computer Engineering and Mathematics, Universitat Rovira i Virgili, UNESCO Chair in Data Privacy, Tarragona E-43007
Venue:
PSD '08 Proceedings of the UNESCO Chair in data privacy international conference on Privacy in Statistical Databases
Year:
2008

Citing 0
Cited 5

User-private information retrieval based on a peer-to-peer community

Data & Knowledge Engineering
Optimal configurations for peer-to-peer user-private information retrieval

Computers & Mathematics with Applications
Private predictions on hidden Markov models

Artificial Intelligence Review
On query self-submission in peer-to-peer user-private information retrieval

Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society
Exploiting social networks to provide privacy in personalized web search

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Private information retrieval (PIR) is normally modeled as a game between two players: a user and a database. The user wants to retrieve some item from the database without the latter learning which item. Most current PIR protocols are ill-suited to provide PIR from a search engine or large database: i) their computational complexity is linear in the size of the database; ii) they assume active cooperation by the database server in the PIR protocol. If the database cannot be assumed to cooperate, a peer-to-peer user community is a natural alternative to achieve some query anonymity: a user submits a query on behalf of another user in the community. A peer-to-peer PIR system is described in this paper which relies on an underlying combinatorial structure to reduce the required key material and increase availability.