BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//POPNET - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.popnet.io
X-WR-CALDESC:Events for POPNET
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Amsterdam:20210831T140000
DTEND;TZID=Europe/Amsterdam:20210831T150000
DTSTAMP:20260403T213358
CREATED:20210827T084317Z
LAST-MODIFIED:20211029T100311Z
UID:613-1630418400-1630422000@www.popnet.io
SUMMARY:Measuring Structural Anonymity in Complex Networks
DESCRIPTION:Master thesis presentation by Rachel de Jong \n\n\n\nWhen sharing sensitive data\, it should be made sure that entities represented in it are sufficiently anonymous in order to avoid a possible breach of privacy. In the field of statistical disclosure control\, this concept is well studied. However\, thus far the majority of work in this field focuses on microdata and (aggregated) tabular data. In this work\, we discuss a new measure for anonymity in networks: d-k-anonymity. It improves upon existing measures (which are in most cases too weak\, too strict\, or not able to account for triangles) by being parametrized in strictness and taking into account all information in the d-neighbourhood of a vertex. This enables the user to select the right level of anonymity based on how much a possible attacker knows. We present an algorithm that can efficiently measure the anonymity and apply it to three well known-graph models with up to 10\,000 vertices\, as well as a real-world network; the full family network of the Netherlands\, consisting of over 15 million vertices. In our experiments\, we find that for graph models most anonymity is lost when measuring 2-k-anonymity\, and vertices quickly all become unique as the edge density increases. For the family network\, over 2.7 million vertices have an anonymity of 1 when measuring 5-k-anonymity\, implying that they are uniquely identifiable when their exact position in their 5-neighbourhood is known. \n\n\n\nSupervisors: Frank Takes and Mark van der Loo (CBS) \n\n\n\nIf you wish to join this presentation\, please send an email to popnet@uva.nl.
URL:https://www.popnet.io/events/measuring-structural-anonymity-in-complex-networks/
CATEGORIES:Lecture
ATTACH;FMTTYPE=image/jpeg:https://www.popnet.io/wp-content/uploads/2021/05/POPNET-header-scaled.jpg
END:VEVENT
END:VCALENDAR