检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:符精晶 许晓东[1] FU Jingjing;XU Xiaodong(School of Computer Science and Communication Engineering,Jiangsu University,Zhenjiang 212013)
机构地区:[1]江苏大学计算机科学与通信工程学院,镇江212013
出 处:《计算机与数字工程》2021年第8期1619-1624,共6页Computer & Digital Engineering
摘 要:针对当前p-sensitive k-匿名模型未考虑敏感属性的敏感程度,不能抵制对等性攻击的问题,提出一种可抵制对等性攻击的(p,θ)k-匿名模型。同时引入互信息量来度量属性间的关联度,为准标识属性的进一步泛化提供依据。实验结果表明,所提的(p,θ)k-匿名模型相对于p-sensitive k-匿名模型降低了敏感属性泄露的概率,更能有效地保护个体隐私。Aiming at the problem that the current p-sensitive k-anonymous model does not consider the sensitivity of sensitive attributes and can't resist the problem of peer attacks,a(p,θ)k-anonymity model is proposed to resist peer attack.At the same time,mutual information is introduced to measure the degree of association between attributes,which provides a basis for further generalization of quasi-identification attributes.The experimental results show that the proposed algorithm reduces the probability of sensitive attribute leakage compared with the p-sensitive k-anonymous model,and can effectively protect individual privacy.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.21.248.40