粒化(α,k)-匿名方法研究  

Research of granulating(α, k)-anonymous method

作　　者：刘丽杰[1] 李盼池[2] 李守威 

机构地区：[1]黑龙江八一农垦大学信息技术学院,黑龙江大庆163319 [2]东北石油大学计算机与信息技术学院,黑龙江大庆163318 [3]内蒙古第一机械集团公司,内蒙古包头014032

出　　处：《计算机工程与应用》2014年第2期75-80,共6页Computer Engineering and Applications

基　　金：中国博士后科学基金资助项目(No.20090460864);黑龙江省教育厅科学技术研究资助项目(No.11551015)

摘　　要：针对现有个性化隐私匿名技术不能同时满足面向个体需求的个性化和面向敏感属性值的个性化两方面的要求,引入了粒计算思想。建立隐私保护决策度集合,以刻画不同个体对敏感属性同一敏感值的不同保护要求;基于决策度集合的不同取值建立顶层粒度空间;对每个顶层粒度空间中敏感值赋予不同的出现频率约束,以满足面向敏感值的个性化匿名需求。算法分析及仿真实验结果表明,粒化(α,k)-匿名模型和算法以较小的信息损失和执行时间获得更综合、更合理的个性化隐私保护的实现。As for that existing personalized privacy anonymous technology can not meet the need for both individual need-oriented personalization and sensitive property-oriented personalization, the granular computing thinking is used. It establishes a privacy protection decision-making degree set to depict different individual requirements of different protec- tion to the same sensitive value of sensitive properties, establishes top-level granularity space based on different values of decision-making degree collection, gives different frequency constraints for sensitive values in each top-level granularity space, to meet the personalized anonymous request of sensitive-oriented value. Algorithm analysis and simulation results show that granulating（a, k）-anonymous model and algorithm obtain more comprehensive and more reasonable personal privacy implementation of smaller loss of information and executing time.

关 键 词：隐私保护 个性化隐私匿名 粒计算 粒化(a k)-匿名模型 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]