A privacy protection algorithm based on hierarchical multiple sensitive attributes allowed by least mean square criterion
Authors
Tao Cui, Jijia Yang, Nan Meng, Wei Xie
Corresponding Author
Tao Cui
Available Online September 2016.
- DOI
- 10.2991/icence-16.2016.114How to use a DOI?
- Keywords
- Information Security; L-diversity; privacy Protection
- Abstract
Based on L-diversity multiple sensitive modules, a hierarchical multiple sensitive attributes algorithm is proposed according to least mean square criterion --- L-LMSU (L-Least Mean Square Uniqueness). The algorithm makes a hierarchical strategy according to the frequencies of the whole attributes firstly. Beyond the hierarchical strategy, the algorithm could decrease the hidden loss because of non-uniform distribution of attributes when releasing privacy data in groups. Analysis and experiments show that L-LMSU is with linear time complexity and could improve the availability of released privacy data and time performances effectively.
- Copyright
- © 2016, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Tao Cui AU - Jijia Yang AU - Nan Meng AU - Wei Xie PY - 2016/09 DA - 2016/09 TI - A privacy protection algorithm based on hierarchical multiple sensitive attributes allowed by least mean square criterion BT - Proceedings of the 2nd International Conference on Electronics, Network and Computer Engineering (ICENCE 2016) PB - Atlantis Press SP - 599 EP - 605 SN - 2352-538X UR - https://doi.org/10.2991/icence-16.2016.114 DO - 10.2991/icence-16.2016.114 ID - Cui2016/09 ER -