Efficient privacy-enhanced familiarity-based recommender system

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    17 Citations (Scopus)
    142 Downloads (Pure)


    Recommender systems can help users to find interesting content, often based on similarity with other users. However, studies have shown that in some cases familiarity gives comparable results to similarity. Using familiarity has the added bonus of increasing privacy between users and utilizing a smaller dataset. In this paper, we propose an efficient privacy-enhanced recommender system that is based on familiarity. It is built on top of any given social network (without changing its behaviour) that already has information about the social relations between users. Using secure multi-party computation techniques and somewhat homomorphic encryption the privacy of the users can be ensured, assuming honest-but-curious participants. Two different solutions are given, one where all users are online, and another where most users are offline. Initial results on a prototype and a dataset of 50 familiar users and 1000 items show a recommendation time of four minutes for the solution with online users and of five minutes for the solution with offline users.
    Original languageUndefined
    Title of host publicationProceedings of the 18th European Symposium on Research in Computer Security, ESORICS 2013
    Place of PublicationBerlin Heidelberg
    Number of pages18
    ISBN (Print)978-3-642-40203-6
    Publication statusPublished - Sep 2013
    Event18th European Symposium on Research in Computer Security, ESORICS 2013 - Egham, UK
    Duration: 9 Sep 201313 Sep 2013

    Publication series

    NameLecture Notes in Computer Science


    Conference18th European Symposium on Research in Computer Security, ESORICS 2013
    Other9-13 September 2013


    • SCS-Cybersecurity
    • METIS-297794
    • IR-87058
    • EWI-23611

    Cite this