POSTER: Privacy-Preserving Profile Similarity Computation in Online Social Networks

Arjan Jeckmans, Qiang Tang, Pieter H. Hartel

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

    Abstract

    Currently, none of the existing online social networks (OSNs) enables its users to make new friends without revealing their private information. This leaves the users in a vulnerable position when searching for new friends. We propose a solution which enables a user to compute her profile similarity with another user in a privacy-preserving way. Our solution is designed for a realistic OSN environment, where a pair of users is unlikely to be online at the same time.
    Original languageUndefined
    Title of host publicationProceedings of the 18th ACM conference on Computer and communications security (CCS)
    Place of PublicationNew York
    PublisherAssociation for Computing Machinery (ACM)
    Pages793-795
    Number of pages3
    ISBN (Print)978-1-4503-0948-6
    DOIs
    Publication statusPublished - Oct 2011
    Event18th ACM conference on Computer and Communications Security, CCS 2011 - Chicago, United States
    Duration: 17 Oct 201121 Oct 2011
    Conference number: 18

    Publication series

    Name
    PublisherACM

    Conference

    Conference18th ACM conference on Computer and Communications Security, CCS 2011
    Abbreviated titleCCS
    CountryUnited States
    CityChicago
    Period17/10/1121/10/11

    Keywords

    • METIS-284927
    • SCS-Cybersecurity
    • EWI-21022
    • IR-79573

    Cite this