Indexed by:
Abstract:
k-anonymity is an effective method of privacy preserving. However, some traditional k-anonymity models do not capture diversity and dispersibility of sensitive values in each equivalence class, which makes the privacy disclosure of anonymity table occur easily. In this paper, an advanced (k, g)-anonymity model for numerical data is proposed, and a (k, g)-MDAV algorithm is designed to achieve (k, g)-algorithm. Experimental results show that the algorithm can lower the risk of privacy disclosure while maintaining the data availability. © 2013 IEEE.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
ISSN: 2166-9430
Year: 2013
Page: 16-19
Language: English
Cited Count:
SCOPUS Cited Count: 2
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: