A Privacy-Preserving Attribute-Based Reputation System in Online Social Networks

被引:9
作者
Guo, Linke [1 ]
Zhang, Chi [2 ]
Fang, Yuguang [3 ]
Lin, Phone [4 ]
机构
[1] SUNY Binghamton, Dept Elect & Comp Engn, Binghamton, NY 13902 USA
[2] Univ Sci & Technol China, CAS Key Lab Electromagnet Space Informat, Hefei 230026, Peoples R China
[3] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA
[4] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10617, Taiwan
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
reputation; privacy; attribute; authentication; ZERO-KNOWLEDGE; TRUST; SIGNATURES; SCHEMES;
D O I
10.1007/s11390-015-1547-9
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Online social networks (OSNs) have revolutionarily changed the way people connect with each other. One of the main factors that help achieve this success is reputation systems that enable OSN users to mutually establish trust relationships based on their past experience. Current approaches for the reputation management cannot achieve the fine granularity and verifiability for each individual user, in the sense that the reputation values on such OSNs are coarse and lack of credibility. In this paper, we propose a fine granularity attribute-based reputation system which enables users to rate each other's attributes instead of identities. Our scheme first verifies each OSN user's attributes, and further allows OSN users to vote on the posted attribute-associated messages to derive the reputation value. The attribute verification process provides the authenticity of the reputation value without revealing the actual value to entities who do not have the vote privilege. To predict a stranger's behavior, we propose a reputation retrieval protocol for querying the reputation value on a specific attribute. To the best of our knowledge, we are the first to define a fine-grained reputation value based on users' verified attributes in OSNs with privacy preservation. We provide the security analysis along with the simulation results to verify the privacy preservation and feasibility. The implementation of the proposed scheme on current OSNs is also discussed.
引用
收藏
页码:578 / 597
页数:20
相关论文
共 42 条
[1]  
Androulaki E, 2008, LECT NOTES COMPUT SC, V5134, P202, DOI 10.1007/978-3-540-70630-4_13
[2]  
[Anonymous], 1988, P 12 ANN ACM S THEOR, DOI [DOI 10.1145/62212.62222, DOI 10.1145/62212]
[3]  
Baric N., 1997, Advances in Cryptology - EUROCRYPT '97. International Conference on the Theory and Application of Cryptographic Techniques Proceedings, P480
[4]  
Barua M., 2011, IEEE INFOCOM 2011 - IEEE Conference on Computer Communications. Workshops, P970, DOI 10.1109/INFCOMW.2011.5928953
[5]  
Belenkiy M, 2007, IACR CRYPTOLOGY EPRI
[6]  
Belenkiy M, 2009, LECT NOTES COMPUT SC, V5677, P108, DOI 10.1007/978-3-642-03356-8_7
[7]  
Bethencourt J., 2010, P 14 INT C FIN CRYPT
[8]   Ciphertext-policy attribute-based encryption [J].
Bethencourt, John ;
Sahai, Amit ;
Waters, Brent .
2007 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2007, :321-+
[9]  
Bethencourt J, 2010, LECT NOTES COMPUT SC, V6052, P400, DOI 10.1007/978-3-642-14577-3_35
[10]   Short group signatures [J].
Boneh, D ;
Boyen, X ;
Shacham, H .
ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS, 2004, 3152 :41-55