匿名
采购
互联网隐私
业务
脆弱性(计算)
个人可识别信息
面板数据
计算机科学
K-匿名
度量(数据仓库)
广告
计算机安全
营销
数据挖掘
经济
计量经济学
作者
Shaobo Li,Matthew J. Schneider,Yan Yu,Sachin Gupta
出处
期刊:Information Systems Research
[Institute for Operations Research and the Management Sciences]
日期:2022-10-07
卷期号:34 (3): 1066-1088
被引量:11
标识
DOI:10.1287/isre.2022.1169
摘要
Market research companies collect extensive data on purchasing, travel, and app and media usage behaviors of consumers, prescriptions written by physicians, and so forth. Although the companies provide assurances of anonymity to the study participants, there is a significant concern about the vulnerability of these data. Could a motivated intruder match the pattern of purchases with the name and other personal and potentially sensitive details of an individual? We find that 17% to 94% of market research panelists in 15 frequently bought consumer goods categories are subject to high risk of reidentification through a potential record linkage attack based on their unique purchasing histories even when their identities are anonymized. We also demonstrate that the risk of reidentification in such data are vastly understated by the conventional measure, unicity, and propose a new measure, termed “sno-unicity.” To protect the privacy of panelists, we consider the well-known privacy notion of k-anonymity and develop a new approach called “graph-based minimum movement k-anonymization” that is designed especially for retaining the usefulness of panel data. We show that our approach works well in protecting participants’ privacy without substantially altering the information that marketers need for sound marketing decisions.
科研通智能强力驱动
Strongly Powered by AbleSci AI