Proceedings of the National Academy of Sciences · 2020 · 87 citations · 20 references
ComputingComputer ScienceRegulatory PolicyComputer SecurityInformation Security ManagementSecurity PolicyData AnonymizationData PrivacyData ProtectionData SecurityPrivacy LawPrivacy-preserving ProtocolsData Protection RegulationPersonal DataPersonal Data PrivacyPrivacyPrivacy AttacksPrivacy DefensesPrivacy-preserving Data ReleaseStatistical Disclosure Limitation
). We argue that PSO security is a mathematical concept with legal consequences. Any data-release mechanism that purports to "render anonymous" personal data under the GDPR must prevent singling out and, hence, must be PSO secure. We analyze the properties of PSO security, showing that it fails to compose. Namely, a combination of more than logarithmically many exact counts, each individually PSO secure, facilitates predicate singling out. Finally, we ask whether differential privacy and k-anonymity are PSO secure. Leveraging a connection to statistical generalization, we show that differential privacy implies PSO security. However, and in contrast with current legal guidance, k-anonymity does not: There exists a simple predicate singling out attack under mild assumptions on the k-anonymizer and the data distribution.
20
Ashwin Machanavajjhala, Daniel Kifer, Johannes Gehrke et al. · ACM Transactions on Knowledge Discovery from Data · 2007 · 3.6K citations
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Ninghui Li, Tiancheng Li, Suresh Venkatasubramanian · 2007 · 3.4K citations
L-diversity: privacy beyond k-anonymity
Ashwin Machanavajjhala, Johannes Gehrke, Daniel Kifer et al. · 2006 · 2.4K citations