摘要
针对社交网络中关系数据隐私性保护和可用性的需求,根据传统的边随机化算法,提出一种安全、高效的社交网络隐私保护及其权限控制方案.提出的基于群的节点划分和基于群的边随机化算法,利用图特征显著性约束得出该算法不仅提高了社交网络的隐私保护程度也保证了社交网络结构的可用性.结合该算法提出的权限控制方案,以权限传递的方式加快了权限判定的效率.分析结果表明,与现有基于边的随机化保护方案相比,该方案能高效的保护社交网络数据的隐私并能保证社交网络图结构上的可用性,实现了关系数据既保护又共享的要求.
For the requirements of social network relational data privacy protection and availability, based on the traditional randomized algorithms of edge, a kind of safe and efficient social network privacy protection and access control scheme is put forward. It is conclu- ded that the proposed algorithm that is the division of nodes and the randomization algorithm in social network group not only im- proves the degree of social network privacy protection also guarantee the availability of social network structure using map features sig- nificant constraints. The permissions control scheme combining the algorithm, speeds up the efficiency of authority to judge by permis- sion transitivity. Analysis results show that, compared with existing randomization protection scheme based on edge, the scheme can ef- ficiently protect the privacy of social network data and make the demand of protection and sharing of relational data come true.
出处
《小型微型计算机系统》
CSCD
北大核心
2016年第12期2617-2621,共5页
Journal of Chinese Computer Systems
关键词
社交网络
隐私保护
边随机化
权限控制
权限传递
social network
privacy protection
edge randomization
access control
permission transitivity