k-Degree anonymity on directed networks

Abstract : In this paper, we consider the problem of anonymization on directed networks. Although there are several anonymization methods for networks, most of them have explicitly been designed to work with undirected networks and they cannot be straightforwardly applied when they are directed. Moreover, ignoring the direction of the edges causes important information loss on the anonymized networks in the best case. In the worst case, the direction of the edges may be used for reidentification, if it is not considered in the anonymization process. Here, we propose two different models for k-degree anonymity on directed networks, and we also present algorithms to fulfill these k-degree anonymity models. Given a network G, we construct a k-degree anonymous network by the minimum number of edge additions. Our algorithms use multivariate micro-aggregation to anonymize the degree sequence, and then, they modify the graph structure to meet the k-degree anonymous sequence. We apply our algorithms to several real datasets and demonstrate their efficiency and practical utility.
Complete list of metadatas

Cited literature [40 references]  Display  Hide  Download

https://hal-centralesupelec.archives-ouvertes.fr/hal-01950285
Contributor : Fragkiskos Malliaros <>
Submitted on : Tuesday, December 18, 2018 - 12:31:10 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:27 PM

Identifiers

Citation

Jordi Casas-Roma, Julián Salas, Fragkiskos Malliaros, Michalis Vazirgiannis. k-Degree anonymity on directed networks. Knowledge and Information Systems (KAIS), Springer, 2018, ⟨10.1007/s10115-018-1251-5⟩. ⟨hal-01950285⟩

Share

Metrics

Record views

154