UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

On the k-Anonymization of Time-Varying and Multi-Layer Social Graphs

Rossi, L; Musolesi, M; Torsello, A; (2015) On the k-Anonymization of Time-Varying and Multi-Layer Social Graphs. In: Cha, M and Mascolo, C and Sandvig, C, (eds.) (Proceedings) The Ninth International Conference on Web and Social Media (ICWSM). (pp. pp. 377-386). AAAI Press Green open access

[thumbnail of 1503.06497v1.pdf]
Preview
Text
1503.06497v1.pdf - Accepted version

Download (660kB) | Preview

Abstract

The popularity of online social media platforms provides an unprecedented opportunity to study real-world complex networks of interactions. However, releasing this data to researchers and the public comes at the cost of potentially exposing private and sensitive user information. It has been shown that a naive anonymization of a network by removing the identity of the nodes is not sufficient to preserve users' privacy. In order to deal with malicious attacks, k-anonymity solutions have been proposed to partially obfuscate topological information that can be used to infer nodes' identity. In this paper, we study the problem of ensuring k-anonymity in time-varying graphs, i.e., graphs with a structure that changes over time, and multi-layer graphs, i.e., graphs with multiple types of links. More specifically, we examine the case in which the attacker has access to the degree of the nodes. The goal is to generate a new graph where, given the degree of a node in each (temporal) layer of the graph, such a node remains indistinguishable from other k-1 nodes in the graph. In order to achieve this, we find the optimal partitioning of the graph nodes such that the cost of anonymizing the degree information within each group is minimum. We show that this reduces to a special case of a Generalized Assignment Problem, and we propose a simple yet effective algorithm to solve it. Finally, we introduce an iterated linear programming approach to enforce the realizability of the anonymized degree sequences. The efficacy of the method is assessed through an extensive set of experiments on synthetic and real-world graphs.

Type: Proceedings paper
Title: On the k-Anonymization of Time-Varying and Multi-Layer Social Graphs
Event: The Ninth International Conference on Web and Social Media (ICWSM)
Location: Oxford, UK
Dates: May 26–29, 2015
ISBN-13: 978-1-57735-733-9
Open access status: An open access version is available from UCL Discovery
Publisher version: https://www.aaai.org/ocs/index.php/ICWSM/ICWSM15/p...
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
Keywords: k-anonymity; Time-varying Social Networks; Multi-layer Social Networks; Privacy
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: https://discovery.ucl.ac.uk/id/eprint/10062896
Downloads since deposit
14Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item