Show simple item record

dc.contributor.authorParra-Arnau, Javier
dc.contributor.authorRebollo Monedero, David
dc.contributor.authorForné Muñoz, Jorge
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria Telemàtica
dc.date.accessioned2014-04-03T17:45:12Z
dc.date.available2014-04-03T17:45:12Z
dc.date.created2014-03
dc.date.issued2014-03
dc.identifier.citationParra-Arnau, J.; Rebollo-Monedero, D.; Forne, J. Optimal forgery and suppression of ratings for privacy enhancement in recommendation systems. "Entropy: international and interdisciplinary journal of entropy and information studies", Març 2014, vol. 16, núm. 3, p. 1586-1631.
dc.identifier.issn1099-4300
dc.identifier.urihttp://hdl.handle.net/2117/22511
dc.description.abstractRecommendation systems are information-filtering systems that tailor information to users on the basis of knowledge about their preferences. The ability of these systems to profile users is what enables such intelligent functionality, but at the same time, it is the source of serious privacy concerns. In this paper we investigate a privacy-enhancing technology that aims at hindering an attacker in its efforts to accurately profile users based on the items they rate. Our approach capitalizes on the combination of two perturbative mechanisms—the forgery and the suppression of ratings. While this technique enhances user privacy to a certain extent, it inevitably comes at the cost of a loss in data utility, namely a degradation of the recommendation’s accuracy. In short, it poses a trade-off between privacy and utility. The theoretical analysis of such trade-off is the object of this work. We measure privacy as the Kullback-Leibler divergence between the user’s and the population’s item distributions, and quantify utility as the proportion of ratings users consent to forge and eliminate. Equipped with these quantitative measures, we find a closed-form solution to the problem of optimal forgery and suppression of ratings, an optimization problem that includes, as a particular case, the maximization of the entropy of the perturbed profile. We characterize the optimal trade-off surface among privacy, forgery rate and suppression rate,and experimentally evaluate how our approach could contribute to privacy protection in a real-world recommendation system.
dc.format.extent46 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica::Seguretat informàtica
dc.subject.lcshComputer security
dc.subject.lcshRecommender systems (Information filtering)
dc.subject.otherInformation privacy
dc.subject.otherKullback-Leibler divergence
dc.subject.otherShannon’s entropy
dc.subject.otherUser profiling
dc.subject.otherPrivacy-enhancing technologies
dc.subject.otherData perturbation
dc.subject.otherRecommendation systems
dc.titleOptimal forgery and suppression of ratings for privacy enhancement in recommendation systems
dc.typeArticle
dc.subject.lemacSeguretat informàtica
dc.contributor.groupUniversitat Politècnica de Catalunya. SERTEL - Serveis Telemàtics
dc.identifier.doi10.3390/e16031586
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.mdpi.com/1099-4300/16/3/1586
dc.rights.accessOpen Access
drac.iddocument13705211
dc.description.versionPostprint (published version)
upcommons.citation.authorParra-Arnau, J.; Rebollo-Monedero, D.; Forne, J.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameEntropy: international and interdisciplinary journal of entropy and information studies
upcommons.citation.volume16
upcommons.citation.number3
upcommons.citation.startingPage1586
upcommons.citation.endingPage1631


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain