您的位置:山东大学 -> 科技期刊社 -> 《山东大学学报(理学版)》

J4 ›› 2011, Vol. 46 ›› Issue (5): 82-85.

• SEWM 2011 会议 • 上一篇    下一篇

面向相关多敏感属性的隐私保护方法

李立,袁方,郗亚辉   

  1. 河北大学数学与计算机学院, 河北 保定 071000
  • 收稿日期:2010-12-06 发布日期:2011-05-25
  • 作者简介:李立(1986- ),女,硕士研究生,主要研究方向为数据挖掘. Email:lili6049@126.com
  • 基金资助:

    河北省教育厅科学研究重点项目(ZH200804)

Privacy preserving approaches for relational multiple sensitive attributes

LI Li, YUAN Fang, XI Ya-hui   

  1. College of Mathematics and Computer Science, Hebei University, Baoding 071000, Hebei, China
  • Received:2010-12-06 Published:2011-05-25

摘要:

将现有的敏感属性隐私保护方法直接应用于相关多敏感属性的隐私保护中会导致隐私数据的泄漏。本文借鉴有损连接对隐私数据进行保护的思想,对表中的记录进行聚类,保证了关系表中的记录按敏感等级划分。其次,对已划分的记录按照频率比较策略进行分组,提出了一种基于聚类的相关多敏感属性数据分组算法。实验结果表明该算法可以有效地防止隐私泄露,增强了数据发布的安全性。

关键词: 数据隐私;相关多敏感属性;k多样性;独立相关;联合相关

Abstract:

Directly applying the existing sensitive attribute privacy protection methods to multiple sensitive attributes privacy protection can divulge the privacy data. Firstl, the thought of lossy join to protect privacy data was inherited, and the records of tables were clustered to guarantee the sensitive rank division in tables. Then, the records were grouped according to the frequency of comparative strategy. And a grouping algorithm aimed at data containing multi-sensitive attributes was proposed based on the cluster. Experimental results indicated that this algorithm could prevent the privacy revelation and strengthen the security of data published.

Key words: data privacy; relational multi-sensitive attribute; k-diversity; independent relational; joint relational

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!