A Differentially Private Matching Scheme for Pairing Similar Users of Proximity Based Social Networking applications
Date
2018-01-03
Authors
Contributor
Advisor
Department
Instructor
Depositor
Speaker
Researcher
Consultant
Interviewer
Narrator
Transcriber
Annotator
Journal Title
Journal ISSN
Volume Title
Publisher
Volume
Number/Issue
Starting Page
Ending Page
Alternative Title
Abstract
The pervasiveness of smartphones has made connecting with users through proximity based mobile social networks commonplace in today’s culture. Many such networks connect users by matching them based on shared interests. With ever-increasing concern for privacy, users are wary of openly sharing personal information with strangers. Several methods have addressed this privacy concern such as encryption and k-anonymity, but none address issues of eliminating third party matches, achieving relevant matches, and prohibiting malicious users from inferring information based on their input into the system. In this paper, we propose a matching scheme that accurately pairs similar users while simultaneously providing protection from malicious users inferring information. Specifically, we match users in a proximity-based social network setting adapted from a framework of differential privacy. This eliminates the need for third-party matching schemes, allows for accurate matching, and ensures malicious users will be unable to infer information from matching results.
Description
Keywords
Decision Making in Online Social Networks, Differential Privacy Laplace Mechanism Proximity Based Social Networking
Citation
Extent
8 pages
Format
Geographic Location
Time Period
Related To
Proceedings of the 51st Hawaii International Conference on System Sciences
Related To (URI)
Table of Contents
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International
Rights Holder
Local Contexts
Collections
Email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.