Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Journal of the ACM (JACM)
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Journal of Complexity - Special issue on coding and cryptography
Privacy protection in personalized search
ACM SIGIR Forum
Proceedings of the 2007 ACM workshop on Privacy in electronic society
Stratified analysis of AOL query log
Information Sciences: an International Journal
Preserving user's privacy in web search engines
Computer Communications
User-private information retrieval based on a peer-to-peer community
Data & Knowledge Engineering
Trustable Relays for Anonymous Communication
Transactions on Data Privacy
A survey of single-database private information retrieval: techniques and applications
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Using social networks to distort users' profiles generated by web search engines
Computer Networks: The International Journal of Computer and Telecommunications Networking
Coprivacy: towards a theory of sustainable privacy
PSD'10 Proceedings of the 2010 international conference on Privacy in statistical databases
Privacy preservation with X.509 standard certificates
Information Sciences: an International Journal
Information Sciences: an International Journal
Hi-index | 0.07 |
User profiling in web search has the advantage of enabling personalized web search: the quality of the results offered by the search engine to the user is increased by taking the user's interests into account when presenting those results. The negative side is that the interests and the query history of users may contain information considered as private; hence, technology should be provided for users to avoid profiling if they wish so. There are several anti-profiling approaches in web search, from basic level countermeasures to private information retrieval and including profile obfuscation. Except private information retrieval (PIR), which hides the retrieved item from the database, the rest of approaches focus on anonymizing the user's identity and fall into the category of anonymous keyword search (also named sometimes user-private information retrieval). Most current PIR protocols are ill-suited to provide PIR from a search engine or large database, due to their complexity and their assumption that the database actively cooperates in the PIR protocol. Peer-to-peer profile obfuscation protocols appear as a competitive option provided that peers are rationally interested in helping each other. We present a game-theoretic analysis of P2P profile obfuscation protocols which shows under which conditions helping each other is in the peers' rational interest.