| Title | Performance Analysis of a Privacy Constrained kNN Recommendation Using Data Sketches |
| Publication Type | Conference Paper |
| Year of Publication | 2018 |
| Authors | Afsharinejad, Armita, Hurley, Neil |
| Conference Name | Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 978-1-4503-5581-0 |
| Keywords | collaborative filtering, composability, data sketching, Metrics, privacy preservation, pubcrawl, sybil attacks, user-based top-n recommneder |
| Abstract | This paper evaluates two algorithms, BLIP and JLT, for creating differentially private data sketches of user profiles, in terms of their ability to protect a kNN collaborative filtering algorithm from an inference attack by third-parties. The transformed user profiles are employed in a user-based top-N collaborative filtering system. For the first time, a theoretical analysis of the BLIP is carried out, to derive expressions that relate its parameters to its performance. This allows the two techniques to be fairly compared. The impact of deploying these approaches on the utility of the system--its ability to make good recommendations, and on its privacy level--the ability of third-parties to make inferences about the underlying user preferences, is examined. An active inference attack is evaluated, that consists of the injection of a number of tailored sybil profiles into the system database. User profile data of targeted users is then inferred from the recommendations made to the sybils. Although the differentially private sketches are designed to allow the transformed user profiles to be published without compromising privacy, the attack we examine does not use such information and depends only on some pre-existing knowledge of some user preferences as well as the neighbourhood size of the kNN algorithm. Our analysis therefore assesses in practical terms a relatively weak privacy attack, which is extremely simple to apply in systems that allow low-cost generation of sybils. We find that, for a given differential privacy level, the BLIP injects less noise into the system, but for a given level of noise, the JLT offers a more compact representation. |
| URL | http://doi.acm.org/10.1145/3159652.3159673 |
| DOI | 10.1145/3159652.3159673 |
| Citation Key | afsharinejad_performance_2018 |
Performance Analysis of a Privacy Constrained kNN Recommendation Using Data Sketches