|
|
论文:2017,Vol:35,Issue(4):736-742 |
|
|
引用本文： |
|
|
崔炜荣, 杜承烈. 移动社交网络中可保护隐私的可信社交关系相似度检测协议[J]. 西北工业大学学报 |
|
|
Cui Weirong, Du Chenglie. A Privacy-Preserving and Trusted Social Relationship Similarity Detection Protocol in Mobile Social Networks[J]. Northwestern polytechnical university |
|
|
|
|
|
|
|
| 移动社交网络中可保护隐私的可信社交关系相似度检测协议 |
|
| 崔炜荣, 杜承烈 |
|
| 西北工业大学 计算机学院, 陕西 西安 70072 |
| 摘要: |
| 在移动社交网络中，陌生用户之间可通过检测是否具有共同朋友来对彼此的社交相似度进行评估，从而决定是否建立新的社交关系。在此过程中，如何保护用户隐私并防止用户伪造朋友关系，是确保检测可行可信的关键问题。为此，提出了一种使用身份加密技术的共同朋友检测方法。该方法设计了一种新的朋友关系证据，可以建立证据颁发者和证据拥有者的一一对应关系。基于这种朋友关系证据，设计了可保护用户隐私的可信共同朋友关系检测协议。通过理论分析和仿真实验，验证了该方法的安全性和效率。 |
| 关键词:
移动社交网络
社交相似度
共同朋友检测
隐私保护
|
|
| A Privacy-Preserving and Trusted Social Relationship Similarity Detection Protocol in Mobile Social Networks |
|
| Cui Weirong, Du Chenglie |
|
| School of Computer Science and Engineering, Northwestern Polytechnical University, Xi'an 710072, China |
| Abstract: |
| In mobile social networks, unfamiliar users can decide whether to establish new social relationships between each other by examining whether they have common friends. The biggest challenge during this process is how to protect the users' privacy and prevent users from forging friend relationships. In order to address this challenge, a common friends detection method based on identity-based encryption technology is presented in this paper. In our method, a new evidence of friend relationship is designed, which can establishes a one-to-one relationship between the issuer of evidence and the owner of evidence. Based on the evidence, a privacy-preserving and trusted common friends detection protocol is designed. We provide thorough security analysis and performance evaluation on our scheme. |
| Key words:
mobile social networks
social relationship similarity
common friends
privacy preserving
computational efficiency
|
|
| 收稿日期: 2016-10-13
修回日期:
|
| DOI: |
| 通讯作者:
Email： |
| 作者简介: 崔炜荣(1983—),西北工业大学博士研究生,主要从事信息网络安全研究。
|
|
|
|
|
|
|
|
参考文献: |
|
|
[1] Li M, Cao N, Yu S, et al. Findu: Privacy-Preserving Personal Profile Matching in Mobile Social Networks[C]//2011 IEEE International Conference on Computer Commucations, 2011: 2435-2443
[2] Von Arb M, Bader M, Kuhn M, et al. Veneta: Serverless Friend-of-Friend Detection in Mobile Social Networking[C]//2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, 2008: 184-189
[3] Nagy M, De Cristofaro E, Dmitrienko A, et al. Do I Know You?: Efficient and Privacy-Preserving Common Friend-Finder Protocols and Applications[C]//Proceedings of the 29th Annual Computer Security Applications Conference, 2013: 159-168
[4] De Cristofaro E, Manulis M, Poettering B. Private Discovery of Common Social Contacts[C]//International Conference on Applied Cryptography and Network Security, 2011: 147-165
[5] Boneh D, Franklin M. Identity-Based Encryption from the Weil Pairing[C]//Annual International Cryptology Conference, 2001: 213-229
[6] Waters B. Efficient Identity-Based Encryption without Random Oracles[C]//Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2005: 114-127
[7] Naccache D. Secure and Practical Identity-Based Encryption[J]. IETU Information Secutity, 2007, 1(2): 59-64
[8] Akinyele J A, Garman C, Miers I, et al. Charm: A Framework for Rapidly Prototyping Cryptosystems[J]. Journal of Cryptographic Engineering, 2013, 3(2): 111-128 |
|
|
|
|
|
|
|
