具有亲子信息的匿名数据集中的再识别风险

计算机工程与设计 Pub Date : 2021-09-24 DOI:10.1109/SEEDA-CECNSM53056.2021.9566230

Revekka Kalli, M. Anagnostou

{"title":"具有亲子信息的匿名数据集中的再识别风险","authors":"Revekka Kalli, M. Anagnostou","doi":"10.1109/SEEDA-CECNSM53056.2021.9566230","DOIUrl":null,"url":null,"abstract":"We explore the risk of re-identification in anonymized data sets that preserve genealogical information (i.e. parent-child links). We consider attacks based on the number of children of an individual. We use part of a well known data set in our experiments, which show that a substantial part of the population involved in the set can be identified, even if additional anonymity protection measures based on graph trimming are taken. We have also found that the risk quickly increases with generatiou depth.","PeriodicalId":68279,"journal":{"name":"计算机工程与设计","volume":"27 1","pages":"1-7"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Re-Identification risk in anonymized data sets with parent-child information\",\"authors\":\"Revekka Kalli, M. Anagnostou\",\"doi\":\"10.1109/SEEDA-CECNSM53056.2021.9566230\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We explore the risk of re-identification in anonymized data sets that preserve genealogical information (i.e. parent-child links). We consider attacks based on the number of children of an individual. We use part of a well known data set in our experiments, which show that a substantial part of the population involved in the set can be identified, even if additional anonymity protection measures based on graph trimming are taken. We have also found that the risk quickly increases with generatiou depth.\",\"PeriodicalId\":68279,\"journal\":{\"name\":\"计算机工程与设计\",\"volume\":\"27 1\",\"pages\":\"1-7\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"计算机工程与设计\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1109/SEEDA-CECNSM53056.2021.9566230\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"计算机工程与设计","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/SEEDA-CECNSM53056.2021.9566230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们探索在保留家谱信息(即亲子链接)的匿名数据集中重新识别的风险。我们根据一个人的孩子的数量来考虑攻击。我们在实验中使用了已知数据集的一部分，这表明即使采取了基于图修剪的额外匿名保护措施，也可以识别出该集合中涉及的大部分人口。我们还发现，风险随着发电深度的增加而迅速增加。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Re-Identification risk in anonymized data sets with parent-child information

We explore the risk of re-identification in anonymized data sets that preserve genealogical information (i.e. parent-child links). We consider attacks based on the number of children of an individual. We use part of a well known data set in our experiments, which show that a substantial part of the population involved in the set can be identified, even if additional anonymity protection measures based on graph trimming are taken. We have also found that the risk quickly increases with generatiou depth.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

计算机工程与设计

自引率

0.00%

发文量

20353

期刊介绍： Computer Engineering and Design is supervised by China Aerospace Science and Industry Corporation and sponsored by the 706th Institute of the Second Academy of China Aerospace Science and Industry Corporation. It was founded in 1980. The purpose of the journal is to disseminate new technologies and promote academic exchanges. Since its inception, it has adhered to the principle of combining depth and breadth, theory and application, and focused on reporting cutting-edge and hot computer technologies. The journal accepts academic papers with innovative and independent academic insights, including papers on fund projects, award-winning research papers, outstanding papers at academic conferences, doctoral and master's theses, etc.