TY - JOUR
T1 - CP-ABE based privacy-preserving user profile matching in mobile social networks
AU - Cui, Weirong
AU - Du, Chenglie
AU - Chen, Jinchao
N1 - Publisher Copyright:
© 2016 Cui et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
PY - 2016/6
Y1 - 2016/6
N2 - Privacy-preserving profile matching, a challenging task in mobile social networks, is getting more attention in recent years. In this paper, we propose a novel scheme that is based on ciphertext-policy attribute-based encryption to tackle this problem. In our scheme, a user can submit a preference-profile and search for users with matching-profile in decentralized mobile social networks. In this process, no participant's profile and the submitted preference- profile is exposed. Meanwhile, a secure communication channel can be established between the pair of successfully matched users. In contrast to existing related schemes which are mainly based on the secure multi-party computation, our scheme can provide verifiability (both the initiator and any unmatched user cannot cheat each other to pretend to be matched), and requires few interactions among users. We provide thorough security analysis and performance evaluation on our scheme, and show its advantages in terms of security, efficiency and usability over state-of- The- Art schemes.
AB - Privacy-preserving profile matching, a challenging task in mobile social networks, is getting more attention in recent years. In this paper, we propose a novel scheme that is based on ciphertext-policy attribute-based encryption to tackle this problem. In our scheme, a user can submit a preference-profile and search for users with matching-profile in decentralized mobile social networks. In this process, no participant's profile and the submitted preference- profile is exposed. Meanwhile, a secure communication channel can be established between the pair of successfully matched users. In contrast to existing related schemes which are mainly based on the secure multi-party computation, our scheme can provide verifiability (both the initiator and any unmatched user cannot cheat each other to pretend to be matched), and requires few interactions among users. We provide thorough security analysis and performance evaluation on our scheme, and show its advantages in terms of security, efficiency and usability over state-of- The- Art schemes.
UR - http://www.scopus.com/inward/record.url?scp=84976529907&partnerID=8YFLogxK
U2 - 10.1371/journal.pone.0157933
DO - 10.1371/journal.pone.0157933
M3 - 文章
C2 - 27337001
AN - SCOPUS:84976529907
SN - 1932-6203
VL - 11
JO - PLoS ONE
JF - PLoS ONE
IS - 6
M1 - e0157933
ER -