A trust-based privacy-preserving friend matching scheme in social Internet of Vehicles

被引:0
作者
Chengzhe Lai
Yangyang Du
Qili Guo
Dong Zheng
机构
[1] Xi’an University of Posts and Telecommunications,National Engineering Laboratory for Wireless Security
[2] Guangxi Key Laboratory of Cryptography and Information Security,undefined
[3] Westone Cryptologic Research Center,undefined
来源
Peer-to-Peer Networking and Applications | 2021年 / 14卷
关键词
Internet of vehicles; Trust management; Anonymity; Friend matching; Privacy preservation;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, to expand the social circle of vehicle users in the non-trusted network environment, a trust-based privacy-preserving friend matching scheme in social Internet of Vehicles is designed, which can prevent the leakage of sensitive information caused by the matching of user attributes, and make the interaction between vehicles faster and more convenient. The proposed scheme can efficiently evaluate the credibility of the vehicles, and eliminate the malicious vehicles to protect the privacy information of the vehicles. Particularly, we use Bloom Filters to convert the attribute matching problem of the vehicles into the number of calculated intersection elements to judge the matching degree of the interests of both parties. The vehicles that fulfill the matching requirements can add each other as friend according to their interests, avoiding the abuse and disclosure of sensitive information by malicious vehicles. The theoretical analysis demonstrates that the proposed scheme is effective and accurate in privacy protection when vehicle attribute information matching. Simulation results illustrate that the proposed scheme can support large-scale data sets, be effectively applied to network environments with complex information types and rich data content, and satisfy the real-time demand in social Internet of Vehicles.
引用
收藏
页码:2011 / 2025
页数:14
相关论文
共 73 条
[1]  
Zeadally S(2012)Vehicular ad hoc networks (vanets): status, results, and challenges Telecommun Syst 50 217-241
[2]  
Hunt R(2019)Spir: a secure and privacy-preserving incentive scheme for reliable real-time map updates IEEE Internet Things J 7 416-428
[3]  
Chen Y-S(2018)A privacy-preserving friend recommendation scheme in online social networks Sustain Cities Soc 38 275-285
[4]  
Irwin A(2016)Netseccc: a scalable and fault-tolerant architecture for cloud computing security Peer-to-Peer Netw Appl 9 67-81
[5]  
Hassan A(2014)Multicloud-based evacuation services for emergency management IEEE Cloud Comput 1 50-59
[6]  
Lai C(2011)A secure handshake scheme with symptoms-matching for mhealthcare social network Mob Netw Appl 16 683-694
[7]  
Zhang M(2016)An efficient quantum scheme for private set intersection Quantum Inf Process 15 363-371
[8]  
Cao J(2016)Spfm: scalable and privacy-preserving friend matching in mobile cloud IEEE Internet Things J 4 583-591
[9]  
Zheng D(2018)Secure computation of two set-relationships with the unencrypted method Ruan Jian Xue Bao/J Softw 29 473-482
[10]  
Zhang S(2013)Web 2.0 recommendation service by multi-collaborative filtering trust network algorithm Inf Syst Front 15 533-551