User-friendly matching protocol for online social networks

Qiang Tang

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

    Abstract

    In this paper, we outline a privacy-preserving matching protocol for OSN (online social network) users to find their potential friends. With the proposed protocol, a logged-in user can match her profile with that of an off-line stranger, while both profiles are maximally protected. Our solution successfully eliminates the requirement of "out-of-band" communication channels, which is one of the biggest obstacles facing cryptographic solutions for OSNs.
    Original languageUndefined
    Title of host publicationACM Conference on Computer and Communications Security
    Place of PublicationNew York
    PublisherAssociation for Computing Machinery (ACM)
    Pages732-734
    Number of pages3
    ISBN (Print)978-1-4503-0245-6
    DOIs
    Publication statusPublished - Oct 2010
    Event17th ACM Conference on Computer and Communications Security, CCS 2010 - Chicago, United States
    Duration: 4 Oct 20108 Oct 2010
    Conference number: 17

    Publication series

    Name
    PublisherACM

    Conference

    Conference17th ACM Conference on Computer and Communications Security, CCS 2010
    Abbreviated titleCCS
    CountryUnited States
    CityChicago
    Period4/10/108/10/10

    Keywords

    • METIS-277475
    • Matching
    • IR-75363
    • EWI-19182
    • nline social network
    • SCS-Cybersecurity
    • Privacy

    Cite this

    Tang, Q. (2010). User-friendly matching protocol for online social networks. In ACM Conference on Computer and Communications Security (pp. 732-734). New York: Association for Computing Machinery (ACM). https://doi.org/10.1145/1866307.1866413