首页 | 本学科首页   官方微博 | 高级检索  
     


Ordinal,Continuous and Heterogeneous <Emphasis Type="Italic">k</Emphasis>-Anonymity Through Microaggregation
Authors:Email author" target="_blank">Josep?Domingo-FerrerEmail author  Vicen??Torra
Affiliation:1.Department of Computer Engineering and Maths,Rovira i Virgili University of Tarragona,Tarragona,Spain;2.Institut d'Investigació en Intel·ligència Artificial-CSIC,Bellaterra,Spain
Abstract:k-Anonymity is a useful concept to solve the tension between data utility and respondent privacy in individual data (microdata) protection. However, the generalization and suppression approach proposed in the literature to achieve k-anonymity is not equally suited for all types of attributes: (i) generalization/suppression is one of the few possibilities for nominal categorical attributes; (ii) it is just one possibility for ordinal categorical attributes which does not always preserve ordinality; (iii) and it is completely unsuitable for continuous attributes, as it causes them to lose their numerical meaning. Since attributes leading to disclosure (and thus needing k-anonymization) may be nominal, ordinal and also continuous, it is important to devise k-anonymization procedures which preserve the semantics of each attribute type as much as possible. We propose in this paper to use categorical microaggregation as an alternative to generalization/suppression for nominal and ordinal k-anonymization; we also propose continuous microaggregation as the method for continuous k-anonymization. Editor: Geoff Webb
Keywords:k-anonymity  microdata privacy  database security  microaggregation
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号