适用于社交网络的隐私保护兴趣度匹配方案  

Privacy preserving interest matching scheme for social network

作　　者：罗小双 杨晓元[1,2] 王绪安[1,2] 

机构地区：[1]武警工程大学电子技术系,西安710086 [2]网络与信息安全武警部队重点实验室,西安710086

出　　处：《计算机应用》2016年第12期3322-3327,共6页journal of Computer Applications

基　　金：国家自然科学基金资助项目(61272492;61572521);陕西省自然科学基金资助项目(2014JM8300)~~

摘　　要：针对社交网络中用户通过兴趣度匹配进行交友而产生的敏感信息泄露问题,设计了基于隐私属性的隐私保护兴趣度匹配方案。该方案利用Bloom Filters来获取双方兴趣爱好集合元素的交集,确定双方兴趣爱好的匹配程度,满足匹配要求的双方可以根据意愿互相添加为好友;方案基于半诚实模型,采用密码协议来保护数据的安全性,防止恶意用户非法获取用户敏感信息,避免造成信息的滥用和泄露。理论分析及运算结果均表明,该方案运行时间具有线性复杂度,并且可以支持较大规模数据集,可有效应用于信息种类繁杂、数据内容庞大的网络环境,满足用户实时高效的现实需求。Concerning the sensitive information leakage problem resulted from making friends by interest matching in social network, a privacy preserving interest matching scheme based on private attributes was proposed. Bloom Filters were used to get the intersection of interest set for both sides, and the interest matching level was determined in the proposed scheme. Both sides intended to add each other as a friend according to their will as long as they met the matching requirements. Based on the semi-honest model, the cryptographic protocols were adopted to protect data security for preventing malicious users obtaining sensitive information illegally, which could avoid information abuse and leakage. Theoretical analysis and calculation results show that the proposed scheme has linear complexity about operational time, support large-scale data sets, and can be applied in Internet environments with different kinds of information and great number of data content, meet user＇s demands of real-time and efficiency.

关 键 词：社交网络 隐私保护 模糊匹配 不经意传输 秘密共享 

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