Privacy-enhanced public view for social graphs

Hyoungshick Kim, Joseph Bonneau

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook's public search listings, which expose user profiles to search engines along with a fixed number of each user's friends. If this public view is produced by uniform random sampling, an adversary can accurately approximate many sensitive features of the original graph, including the degree of individual nodes. We propose several schemes to produce public views which hide degree information. We demonstrate the practicality of our schemes using real data and show that it is possible to mitigate inference of degree while still providing useful public views.

Original languageEnglish (US)
Title of host publication2nd ACM Workshop on Social Web Search and Mining, SWSM'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009
Pages41-48
Number of pages8
DOIs
StatePublished - 2009
Event2nd ACM Workshop on Social Web Search and Mining, SWSM'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009 - Hong Kong, China
Duration: Nov 2 2009Nov 6 2009

Other

Other2nd ACM Workshop on Social Web Search and Mining, SWSM'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009
CountryChina
CityHong Kong
Period11/2/0911/6/09

Fingerprint

Graph
Node
Privacy
Search engine
User profile
Random sampling
Inference
Facebook

Keywords

  • Graph obfuscation
  • Privacy
  • Public view
  • Social networks

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Business, Management and Accounting(all)

Cite this

Kim, H., & Bonneau, J. (2009). Privacy-enhanced public view for social graphs. In 2nd ACM Workshop on Social Web Search and Mining, SWSM'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009 (pp. 41-48) https://doi.org/10.1145/1651437.1651445

Privacy-enhanced public view for social graphs. / Kim, Hyoungshick; Bonneau, Joseph.

2nd ACM Workshop on Social Web Search and Mining, SWSM'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009. 2009. p. 41-48.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, H & Bonneau, J 2009, Privacy-enhanced public view for social graphs. in 2nd ACM Workshop on Social Web Search and Mining, SWSM'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009. pp. 41-48, 2nd ACM Workshop on Social Web Search and Mining, SWSM'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, 11/2/09. https://doi.org/10.1145/1651437.1651445
Kim H, Bonneau J. Privacy-enhanced public view for social graphs. In 2nd ACM Workshop on Social Web Search and Mining, SWSM'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009. 2009. p. 41-48 https://doi.org/10.1145/1651437.1651445
Kim, Hyoungshick ; Bonneau, Joseph. / Privacy-enhanced public view for social graphs. 2nd ACM Workshop on Social Web Search and Mining, SWSM'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009. 2009. pp. 41-48
@inproceedings{78a22765e5fd4969bc4e5f2c99d8aa54,
title = "Privacy-enhanced public view for social graphs",
abstract = "We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook's public search listings, which expose user profiles to search engines along with a fixed number of each user's friends. If this public view is produced by uniform random sampling, an adversary can accurately approximate many sensitive features of the original graph, including the degree of individual nodes. We propose several schemes to produce public views which hide degree information. We demonstrate the practicality of our schemes using real data and show that it is possible to mitigate inference of degree while still providing useful public views.",
keywords = "Graph obfuscation, Privacy, Public view, Social networks",
author = "Hyoungshick Kim and Joseph Bonneau",
year = "2009",
doi = "10.1145/1651437.1651445",
language = "English (US)",
isbn = "9781605588063",
pages = "41--48",
booktitle = "2nd ACM Workshop on Social Web Search and Mining, SWSM'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009",

}

TY - GEN

T1 - Privacy-enhanced public view for social graphs

AU - Kim, Hyoungshick

AU - Bonneau, Joseph

PY - 2009

Y1 - 2009

N2 - We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook's public search listings, which expose user profiles to search engines along with a fixed number of each user's friends. If this public view is produced by uniform random sampling, an adversary can accurately approximate many sensitive features of the original graph, including the degree of individual nodes. We propose several schemes to produce public views which hide degree information. We demonstrate the practicality of our schemes using real data and show that it is possible to mitigate inference of degree while still providing useful public views.

AB - We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook's public search listings, which expose user profiles to search engines along with a fixed number of each user's friends. If this public view is produced by uniform random sampling, an adversary can accurately approximate many sensitive features of the original graph, including the degree of individual nodes. We propose several schemes to produce public views which hide degree information. We demonstrate the practicality of our schemes using real data and show that it is possible to mitigate inference of degree while still providing useful public views.

KW - Graph obfuscation

KW - Privacy

KW - Public view

KW - Social networks

UR - http://www.scopus.com/inward/record.url?scp=74049160363&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=74049160363&partnerID=8YFLogxK

U2 - 10.1145/1651437.1651445

DO - 10.1145/1651437.1651445

M3 - Conference contribution

SN - 9781605588063

SP - 41

EP - 48

BT - 2nd ACM Workshop on Social Web Search and Mining, SWSM'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009

ER -