期刊文献+

MSN中用户属性隐私安全的选择性匹配协议 被引量:1

Privacy-preserving selective profile matching protocols for MSN
原文传递
导出
摘要 根据资料属性选择性匹配问题,设计了一个基于欧氏距离的匹配度量函数,利用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
  • 相关文献

参考文献16

  • 1Beach A,Gartrell M,Han R.Solutions to security and privacy issues in mobile social networking[C]∥Proc of CSE′09.Vancouver:IEEE,2009,4:1036-1042.
  • 2吴小坤,吴冀衍,程渤,陈俊亮.移动自组织网络中服务组合方法[J].华中科技大学学报(自然科学版),2013,41(S2):10-13. 被引量:1
  • 3Li M,Cao N,Yu S,et al.Findu:privacy-preserving personal profile matching in mobile social networks[C]∥Proc of INFOCOM′11.Shanghai:IEEE,2011:2435-2443.
  • 4刘华玲,郑建国,孙辞海.基于贪心扰动的社交网络隐私保护研究[J].电子学报,2013,41(8):1586-1591. 被引量:17
  • 5Du W,Atallah M J.Secure multi-party computation problems and their applications:a review and open problems[C]∥Proceedings of the 2001workshop on New security paradigms.Cloudcroft:ACM,2001:13-22.
  • 6张恩,蔡永泉.理性的安全两方计算协议[J].计算机研究与发展,2013,50(7):1409-1417. 被引量:13
  • 7田有亮,彭长根,马建峰,林辉,杨凯.通用可组合公平安全多方计算协议[J].通信学报,2014,35(2):54-62. 被引量:11
  • 8Zhang R,Zhang J,Zhang Y,et al.Privacy-preserving profile matching for proximity-based mobile social networking[J].IEEE Journal on Selected Areas in Communications,2013,31(9):656-668.
  • 9Liang X,Li X,Zhang K,et al.Fully anonymous profile matching in mobile social networks[J].IEEE Journal on Selected Areas in Communications,2013,31(9):641-655.
  • 10Dong W,Dave V,Qiu L,et al.Secure friend discovery in mobile social networks[C]∥Proc of INFOCOM′11.Shanghai:IEEE,2011:1647-1655.

二级参考文献39

  • 1张锋,常会友.茫然第三方支持的隐私保持离群点探测协议[J].计算机研究与发展,2007,44(z3):226-231. 被引量:2
  • 2李顺东,戴一奇,游启友.姚氏百万富翁问题的高效解决方案[J].电子学报,2005,33(5):769-773. 被引量:43
  • 3ZHANG Fan,MA JianFeng,SangJae MOON.Universally composable anonymous Hash certification model[J].Science in China(Series F),2007,50(3):440-455. 被引量:9
  • 4Yao A C. Protocols for secure computation [C]//Proc of the23rd IEEE Symp on Foundations of Computer Science(FOCS1982). Los Alamitors,CA:IEEE Computer Society,1982:160-164.
  • 5Yao A C. How to generate and exchange secrets [C]//Proc ofthe 27th IEEE Symp on Foundations of Computer Science(FOCS 1986). Los Alamitors* CA:IEEE Computer Society,1986:162-167.
  • 6Goldreich O,Micali S,Wigderson A. How to play anymental game [C] //Proc of the 19th Annual ACM Symp onTheory of Computing ( STOC 1987 ). New York:ACM,1987:218-229.
  • 7Goldreich O. Foundations of Cryptography:BasicApplications [M]. Cambridge:Cambridge University Press,2004.
  • 8Pinkas B. Fair secure two-party computation [G] //LNCS2656:Advances in Cryptology (Eurocrypt 2003). Berlin:Springer,2003:87-105.
  • 9Garay J,MacKenzie P,Prabhakaran M,et al. Resourcefairness and composability of cryptographic protocols [G] //LNCS 3876:Proc of the 3rd Theory of Cryptography Conf(TCC 2006). Berlin:Springer,2006:404-428.
  • 10Gordon D,Hazay C,Katz J,et al. Complete fairness insecure two-party computation [C] //Proc of the 40th AnnualACM Symp on Theory of Computing ( STOC 2008). NewYork:ACM,2008:413-422.

共引文献34

同被引文献9

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部