Triangle randomization for social network data anonymization

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F14%3A43924757" target="_blank" >RIV/49777513:23520/14:43924757 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Triangle randomization for social network data anonymization

Original language description

In order to protect privacy of social network participants, network graph data should be anonymised prior to its release. Most proposals in the literature aim to achieve k-anonymity under specific assumptions about the background information available tothe attacker. Our method is based on randomizing the location of the triangles in the graph. We show that this simple method preserves the main structural parameters of the graph to a high extent, while providing a high re-identification confusion.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2014

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

ARS MATHEMATICA CONTEMPORANEA

ISSN

1855-3966

e-ISSN

—

Volume of the periodical

7

Issue of the periodical within the volume

2

Country of publishing house

SI - SLOVENIA

Number of pages

17

Pages from-to

"461?477"

UT code for WoS article

000346150500016

EID of the result in the Scopus database

—