首站-论文投稿智能助手
典型文献
PUMTD:Privacy-Preserving User-Profile Matching Protocol in Social Networks
文献摘要:
User profile matching can establish social relationships between different users in the social net-work.If the user profile is matched in plaintext,the user's privacy might face a security challenge.Al-though there exist some schemes realizing privacy-preserving user profile matching,the resource-limited users or social service providers in these schemes need to take higher computational complexity to en-sure the privacy or matching of the data.To overcome the problems,a novel privacy-preserving user profile matching protocol in social networks is proposed by using t-out-of n servers and the bloom filter technique,in which the computational complexity of a user is re-duced by applying the Chinese Remainder Theorem,the matching users can be found with the help of any t matching servers,and the privacy of the user pro-file is not compromised.Furthermore,if at most t-1 servers are allowed to collude,our scheme can still ful-fill user profile privacy and user query privacy.Finally,the performance of the proposed scheme is compared with the other two schemes,and the results show that our scheme is superior to them.
文献关键词:
作者姓名:
Jianhong Zhang;Haoting Han;Hongwei Su;Zhengtao Jiang;Changgen Peng
作者机构:
School of Information Sciences and Technology,North China University of Technology,Beijing 100043,China;Key Laboratory of Cryptography of Zhejiang Province,Hangzhou Normal University,Hangzhou 311121,China;Guizhou Provincial Key Laboratory of Public Big Data,Guizhou University,Guiyang 550025,China;School of Computer and Cyber Sciences,Communication University of China,Beijing 100025,China
引用格式:
[1]Jianhong Zhang;Haoting Han;Hongwei Su;Zhengtao Jiang;Changgen Peng-.PUMTD:Privacy-Preserving User-Profile Matching Protocol in Social Networks)[J].中国通信(英文版),2022(06):77-90
A类:
PUMTD,collude
B类:
Privacy,Preserving,User,Profile,Matching,Protocol,Social,Networks,profile,matching,can,establish,social,relationships,between,different,users,If,matched,plaintext,privacy,might,face,security,challenge,though,there,exist,some,schemes,realizing,preserving,resource,limited,service,providers,these,need,take,higher,computational,complexity,sure,data,To,overcome,problems,novel,protocol,networks,proposed,by,using,out,servers,bloom,filter,technique,which,duced,applying,Chinese,Remainder,Theorem,found,help,any,not,compromised,Furthermore,most,allowed,still,ful,fill,query,Finally,performance,compared,other,results,show,that,superior,them
AB值:
0.503848
相似文献
Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks
Hao Liao;Qi-Xin Liu;Ze-Cheng Huang;Ke-Zhong Lu;Chi Ho Yeung;Yi-Cheng Zhang-National Engineering Laboratory on Big Data System Computing Technology,College of Computer Science and Software Engineering,Shenzhen University,Shenzhen 518060,China;Guangdong Province Key Laboratory of Popular High Performance Computers,Shenzhen University Shenzhen 518060,China;Guangdong Province Engineering Center of China-Made High Performance Data Computing System,College of Computer Science and Software Engineering,Shenzhen University,Shenzhen 518060,China;Institute of Big Data Intelligent Management and Decision,Shenzhen University,Shenzhen 518060,China;Department of Science and Environmental Studies,The Education University of Hong Kong,Hong Kong 999077,China;Department of Physics,University of Fribourg,Fribourg 1700,Switzerland
机标中图分类号,由域田数据科技根据网络公开资料自动分析生成,仅供学习研究参考。