Journal of Computer Applications ›› 2016, Vol. 36 ›› Issue (12): 3322-3327.DOI: 10.11772/j.issn.1001-9081.2016.12.3322

Previous Articles     Next Articles

Privacy preserving interest matching scheme for social network

LUO Xiaoshuang1,2, YANG Xiaoyuan1,2, WANG Xu'an1,2   

  1. 1. Department of Electronic Technology, Engineering University of Chinese People's Armed Police Force, Xi'an Shaanxi 710086, China;
    2. Key Laboratory of Network and Information Security under the Chinese People's Armed Police Force, Xi'an Shaanxi 710086, China
  • Received:2016-05-17 Revised:2016-06-30 Online:2016-12-10 Published:2016-12-08
  • Supported by:
    This work is partially supported by the National Natural Science Foundation of China (61272492,61572521), the Natural Science Foundation of Shaanxi Province (2014JM8300).


罗小双1,2, 杨晓元1,2, 王绪安1,2   

  1. 1. 武警工程大学 电子技术系, 西安 710086;
    2. 网络与信息安全武警部队重点实验室, 西安 710086
  • 通讯作者: 罗小双
  • 作者简介:罗小双(1992-),男,陕西安康人,硕士研究生,CCF会员,主要研究方向:信息安全、密码学;杨晓元(1959-),男,湖南湘潭人,教授,博士生导师,硕士,主要研究方向:信息安全、密码学;王绪安(1981-),男,湖北公安人,副教授,博士,主要研究方向:信息安全、密码学。
  • 基金资助:

Abstract: 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.

Key words: social network, privacy preserving, fuzzy matching, oblivious transfer, secret sharing

摘要: 针对社交网络中用户通过兴趣度匹配进行交友而产生的敏感信息泄露问题,设计了基于隐私属性的隐私保护兴趣度匹配方案。该方案利用Bloom Filters来获取双方兴趣爱好集合元素的交集,确定双方兴趣爱好的匹配程度,满足匹配要求的双方可以根据意愿互相添加为好友;方案基于半诚实模型,采用密码协议来保护数据的安全性,防止恶意用户非法获取用户敏感信息,避免造成信息的滥用和泄露。理论分析及运算结果均表明,该方案运行时间具有线性复杂度,并且可以支持较大规模数据集,可有效应用于信息种类繁杂、数据内容庞大的网络环境,满足用户实时高效的现实需求。

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

CLC Number: