摘要
根据资料属性选择性匹配问题,设计了一个基于欧氏距离的匹配度量函数,利用Paillier公钥加密算法提出了可以实现选择性匹配的隐私安全协议.针对不同的隐私性与时效性要求,分别设计了时效优先选择性匹配(EPSM)和隐私优先选择性匹配(PPSM)协议.EPSM协议具有较高的匹配效率,但是其隐私安全性较PPSM协议低;PPSM通过混淆用户数据,实现高隐私安全性的匹配,但是匹配效率较EPSM低.此外,还对协议进行了安全性分析与效率分析.分析结果表明:所设计的协议可以在不泄露用户资料信息的前提下,满足不同需求的选择性匹配.
To handle the selective profile matching problem,a similarity metric function was designed at first,and the privacy-preserving protocols were proposed on the basis of Paillier cryptosystem.Then,both efficiency preferred selective matching(EPSM)and privacy preferred selective matching(PPSM)protocols were designed,with consideration of different privacy requirements and time limits.EPSM protocol is efficient in finding the matching users but less secure than the PPSM protocol,while PPSM protocol needs participants to confuse their responses resulting in higher secure level but less efficiency than the EPSM.In addition,security and efficiency analyses were conducted.The results suggest that the proposed protocols,which make sense in different privacy requirements and time limits,are privacy-preserving and correct.
出处
《华中科技大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2015年第5期89-94,共6页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
国家重点基础研究发展计划资助项目(2011CB302306)
国家自然科学基金资助项目(41371402)
关键词
移动社交网络
隐私安全
资料匹配
选择性匹配
协议
mobile social network
privacy-preserving
profile matching
selectively matching
protocol