Match-MORE: An efficient private matching scheme using friends-of-friends' recommendation

Fenghua Li, Yuanyuan He, Ben Niu, Hui Li, Hanyi Wang
{"title":"Match-MORE: An efficient private matching scheme using friends-of-friends' recommendation","authors":"Fenghua Li, Yuanyuan He, Ben Niu, Hui Li, Hanyi Wang","doi":"10.1109/ICCNC.2016.7440630","DOIUrl":null,"url":null,"abstract":"Although Proximity-based Mobile Social Networks (PMSNs) bring mobile users novel ways to discover their similarities, they enjoy this kind of conveniences at the cost of user privacy and system overhead etc. To address these problems, we propose Match-MORE, which employs the concept of friends-of-friends to find some ones in common from friends and thus design a private matching scheme. Specifically, Match-MORE exploits a novel similarity function with considering social strength between users and similarity coefficient of the corresponding profiles, simultaneously. It provides users more opportunities to know other potential friends based on the recommendations from existing friends with tunable accuracy, and without disclosing too much private information to each other. The Bloom filter-based common-attributes estimation reduces the system overhead significantly. The security and performance are thoroughly analyzed and evaluated via detailed simulations.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2016.7440630","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Although Proximity-based Mobile Social Networks (PMSNs) bring mobile users novel ways to discover their similarities, they enjoy this kind of conveniences at the cost of user privacy and system overhead etc. To address these problems, we propose Match-MORE, which employs the concept of friends-of-friends to find some ones in common from friends and thus design a private matching scheme. Specifically, Match-MORE exploits a novel similarity function with considering social strength between users and similarity coefficient of the corresponding profiles, simultaneously. It provides users more opportunities to know other potential friends based on the recommendations from existing friends with tunable accuracy, and without disclosing too much private information to each other. The Bloom filter-based common-attributes estimation reduces the system overhead significantly. The security and performance are thoroughly analyzed and evaluated via detailed simulations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Match-MORE:利用好友推荐的高效私人匹配方案
虽然基于邻近度的移动社交网络(pmsn)为移动用户提供了发现彼此相似性的新颖方式,但这种便利是以用户隐私和系统开销等为代价的。为了解决这些问题,我们提出了Match-MORE,它采用朋友的朋友的概念,从朋友中找到一些共同点,从而设计一个私人匹配方案。具体来说,Match-MORE利用了一种新颖的相似度函数,同时考虑了用户之间的社会强度和相应档案的相似系数。它为用户提供了更多的机会,可以根据现有朋友的推荐认识其他潜在的朋友,而且准确度可调,而且不会向彼此透露太多的私人信息。基于Bloom过滤器的公共属性估计显著降低了系统开销。通过详细的仿真,对其安全性和性能进行了全面的分析和评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Public scene recognition using mobile phone sensors Mixed signal detection and carrier frequency estimation based on spectral coherent features A queue-length based distributed scheduling for CSMA-driven Wireless Mesh Networks GreenTCAM: A memory- and energy-efficient TCAM-based packet classification Hierarchical traffic engineering based on model predictive control
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1