通信学报 ›› 2015, Vol. 36 ›› Issue (4): 97-104.doi: 10.11959/j.issn.1000-436x.2015093

• 学术论文 • 上一篇    下一篇

面向近邻泄露的数值型敏感属性隐私保护方法

谢静,张健沛,杨静,张冰   

  1. 哈尔滨工程大学 计算机科学与技术学院,黑龙江 哈尔滨150001
  • 出版日期:2015-04-25 发布日期:2015-04-15
  • 基金资助:
    国家自然科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;教育部高等学校博士学科点专项科研基金资助项目;教育部高等学校博士学科点专项科研基金资助项目

Privacy preserving approach based on proximity privacy for numerical sensitive attributes

Jing XIE,Jian-pei ZHANG,Jing YANG,Bing ZHANG   

  1. College of Computer Science and Technology,Harbin Engineering University,Harbin 150001,China
  • Online:2015-04-25 Published:2015-04-15
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Research Foundation for the Doctoral Program of Higher Education of China;The National Research Foundation for the Doctoral Program of Higher Education of China

摘要:

提出一种面向近邻泄露的数值型敏感属性隐私保护方法,该方法首先在保护准标识符属性和数值型敏感属性内在关系的前提下,将数值型敏感属性进行离散化划分;然后,提出一种面向近邻泄露的隐私保护原则——(k,ε)-proximity;最后,设计了最大邻域优先算法MNF(maximal neighborhood first)来实现该原则。实验结果表明,提出的方法能在有效保护数值型敏感信息不泄露的同时保持较高的数据效用,并且保护了数据间的关系。

关键词: 隐私保护, 数值型敏感属性, 近邻泄露, 离散化

Abstract:

A model based on proximity breach for numerical sensitive attributes is proposed.At first,it divides numerical sensitive value into several intervals on the premise of protecting the internal relations between quasi-identifier attributes and numerical sensitive attributes.Secondly,it proposes a (k,ε)-proximity privacy preserving principle to defense proximity privacy.In the end,a maximal neighborhood first algorithm (MNF) is designed to realize the (k,ε)-proximity.The experiment results show that the proposed model can preserve privacy of sensitive data well meanwhile it can also keep a high data utility and protect the internal relations.

Key words: privacy preserving, numerical sensitive attributes, proximity privacy, discretization

No Suggested Reading articles found!