FPVI:用于发现微数据中的隐私漏洞的可扩展方法

A. Gkoulalas-Divanis, S. Braghin, S. Antonatos
{"title":"FPVI:用于发现微数据中的隐私漏洞的可扩展方法","authors":"A. Gkoulalas-Divanis, S. Braghin, S. Antonatos","doi":"10.1109/ISC2.2016.7580849","DOIUrl":null,"url":null,"abstract":"Governments are increasingly interested in making their data accessible through open data platforms to promote transparency and economic growth. At the same time, recent efforts towards personalized healthcare and smart transportation aim to analyze individuals' data, such as electronic medical records and user mobility patterns, to derive important insights. The implementation of a smart city largely depends on the ability to extract knowledge from person-specific data. This, however, may come at a cost to individuals' privacy. In this paper we propose FPVI, a fast algorithm for discovering privacy vulnerabilities in relational data. FPVI operates in a multi-threaded fashion to index and scan the data for vulnerabilities, while pruning the search space to boost performance. Our experimental evaluation shows that FPVI outperforms the state-of-the-art method and can analyze datasets of 11 million records and 20 attributes in less than 9 minutes.","PeriodicalId":171503,"journal":{"name":"2016 IEEE International Smart Cities Conference (ISC2)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"FPVI: A scalable method for discovering privacy vulnerabilities in microdata\",\"authors\":\"A. Gkoulalas-Divanis, S. Braghin, S. Antonatos\",\"doi\":\"10.1109/ISC2.2016.7580849\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Governments are increasingly interested in making their data accessible through open data platforms to promote transparency and economic growth. At the same time, recent efforts towards personalized healthcare and smart transportation aim to analyze individuals' data, such as electronic medical records and user mobility patterns, to derive important insights. The implementation of a smart city largely depends on the ability to extract knowledge from person-specific data. This, however, may come at a cost to individuals' privacy. In this paper we propose FPVI, a fast algorithm for discovering privacy vulnerabilities in relational data. FPVI operates in a multi-threaded fashion to index and scan the data for vulnerabilities, while pruning the search space to boost performance. Our experimental evaluation shows that FPVI outperforms the state-of-the-art method and can analyze datasets of 11 million records and 20 attributes in less than 9 minutes.\",\"PeriodicalId\":171503,\"journal\":{\"name\":\"2016 IEEE International Smart Cities Conference (ISC2)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Smart Cities Conference (ISC2)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISC2.2016.7580849\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Smart Cities Conference (ISC2)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISC2.2016.7580849","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

各国政府越来越有兴趣通过开放数据平台使其数据可访问,以促进透明度和经济增长。与此同时,最近针对个性化医疗和智能交通的努力旨在分析个人数据,例如电子医疗记录和用户移动模式,以获得重要见解。智慧城市的实施在很大程度上取决于从个人数据中提取知识的能力。然而,这可能会以个人隐私为代价。本文提出了一种快速发现关系数据隐私漏洞的算法FPVI。FPVI以多线程方式操作,索引和扫描数据以查找漏洞,同时修剪搜索空间以提高性能。我们的实验评估表明,FPVI优于最先进的方法,可以在不到9分钟的时间内分析1100万条记录和20个属性的数据集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
FPVI: A scalable method for discovering privacy vulnerabilities in microdata
Governments are increasingly interested in making their data accessible through open data platforms to promote transparency and economic growth. At the same time, recent efforts towards personalized healthcare and smart transportation aim to analyze individuals' data, such as electronic medical records and user mobility patterns, to derive important insights. The implementation of a smart city largely depends on the ability to extract knowledge from person-specific data. This, however, may come at a cost to individuals' privacy. In this paper we propose FPVI, a fast algorithm for discovering privacy vulnerabilities in relational data. FPVI operates in a multi-threaded fashion to index and scan the data for vulnerabilities, while pruning the search space to boost performance. Our experimental evaluation shows that FPVI outperforms the state-of-the-art method and can analyze datasets of 11 million records and 20 attributes in less than 9 minutes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信