出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：¦Å,m)-anonymity considers ¦Åas the interval to define similarity between two values, an d m as the level of privacy protection. For example {40,60} satisfies (¦Å,m)-anonymity but {40,50,60} doesn't, for ¦Å=15 and m=2. We show that protection in {40,50,60} sensitive values of an equivalence class is not less (if don't say more) than {40,60}. Therefore, although (¦Å,m)-anonymity has well studied publication of numerical sensitive values, it fails to address proximity in the right way. Accordingly, we introduce a revised principle which solve this problem by introducing (¦Ä,l)-diversity principle. Surprisingly, in contrast with (¦Å,m)-anonymity, the proposed principle respects monotonicity property which makes it adoptable to be exploited in other anonymity principles.
