Issue No. 05 - Sept.-Oct. (2012 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2012.16
David Rebollo-Monedero , Universitat Politècnica de Catalunya, Barcelona
Jordi Forné , Universitat Politècnica de Catalunya, Barcelona
Josep Domingo-Ferrer , Universitat Rovira i Virgili, Tarragona
We address the problem of query profile obfuscation by means of partial query exchanges between two users, in order for their profiles of interest to appear distorted to the information provider (database, search engine, etc.). We illustrate a methodology to reach mutual privacy gain, that is, a situation where both users increase their own privacy protection through collaboration in query exchange. To this end, our approach starts with a mathematical formulation, involving the modeling of the users' apparent profiles as probability distributions over categories of interest, and the measure of their privacy as the corresponding Shannon entropy. The question of which query categories to exchange translates into finding optimization variables representing exchange policies, for various optimization objectives based on those entropies, possibly under exchange traffic constraints.
Privacy, Protocols, IP networks, Histograms, Entropy, Forgery, Optimization, information theory., Profile obfuscation, private information retrieval, privacy via user collaboration, entropy
J. Forné, D. Rebollo-Monedero and J. Domingo-Ferrer, "Query Profile Obfuscation by Means of Optimal Query Exchange between Users," in IEEE Transactions on Dependable and Secure Computing, vol. 9, no. , pp. 641-654, 2012.