The Local Trust are following uses three properties of trust in social networks:<\/p>\n
- \n
- Transitivity :\u00a0<\/strong>If A trusts B and B trusts J then A will also trust J<\/li>\n<\/ul>\n
- \n
- Asymmetry :\u00a0<\/strong>If A trusts B it does not follow that B trusts A<\/li>\n<\/ul>\n
- \n
- Personalization :<\/strong>Trust is held from the view of a node \u2013 it is therefore\u00a0local trust <\/strong>(Millard & Imran, 2015).<\/li>\n<\/ul>\n
the usage of Online Social Network (OSN) trust methodologies can boost the privacy and security for the user. A user needs to know if they can trust someone to look at there profiles or how much they can trust them. The post discuss two methods: Trust-Online Social Network (T-OSN) and Trust Indexing algorithm (TI).<\/p>\n
The evolution of OSN encouraged people to meet strangers from all over the world and become friends. But this has also, led to some problems such as identity theft and stalking. Methods that calculate trust and help users to make decisions are usually complex or require huge resources. T-OSN<\/strong> is a trust model that has been created specially for OSN that can also be used on other applications such as mobile message forwarding and peer-to peer file sharing network (Li and Bont, 2011)<\/span>.<\/div>\n<\/div>\nthe model is effective, simple and require the least resources possible. the model is based on two things :<\/div>\n1- Number of friends (Degree)<\/div>\n2- Contact frequency (Contact interval)<\/div>\n<\/div>\n![\"Screen](\"http:\/\/blog.soton.ac.uk\/smallworld\/files\/2015\/04\/Screen-Shot-2015-04-13-at-12.16.47.png\")
<\/a><\/div>\nand then a user trustworthiness can be calculated for each user. The theory suggests that if a user has more friends and more frequent communication with friends, then this user is highly secure to interact with. So the user will get a higher trustworthiness.<\/div>\n<\/div>\nAnother method is called \u201cTrust Index\u201d<\/strong> (Tang et al., 2012)<\/span>. It has the same idea as Page Rank that is being used in Google search engine. The algorithm is based on distance that counts hops. How far the user from his\/her peer.<\/div>\n<\/div>\n![\"Screen](\"http:\/\/blog.soton.ac.uk\/smallworld\/files\/2015\/04\/Screen-Shot-2015-04-13-at-12.59.38-1024x157.png\")
<\/a><\/div>\n<\/div>\nEach user will have a TI and a list of the ranking of other users, those who are more trustworthiness will be on the top of the ranking. The paper claims that TI successfully been able to classify trustworthiness users from those who are not (Tang et al., 2012)<\/span>.<\/div>\n<\/div>\nGoogle have introduced Google+ circles where recommendations of people where based on common interests or people that the user might be connected to (Tang et al., 2012)<\/span>. Spam was not an issue. Small.World will follow the same path where trust will come in top of the recommendations that the users will get.<\/div>\n<\/div>\nchoosing a method to evaluate can be tricky where there is no ultimate solution. It depends on the type of the OSN and what factors will be involved in the algorithm.<\/div>\nresearch on this area is highly encouraged to create a more secure environment for OSN.<\/div>\n<\/div>\nReferences<\/b>:\u00a0<\/strong><\/div>\n<\/div>\n\nMillard, D. and Imran, M. (2015).\u00a0Trust: Part I<\/em>.<\/div>\n<\/div>\n\u00a0Li, M. and Bont, A. (2011). T-OSN : a trust evaluation model in online social networks. In: IFIP Ninth International Conference on Embedded and Ubiquitous Computing<\/i>. [online] Melbourne, Australia: IEEE Computer Society, pp.469-472. Available at: http:\/\/ieeexplore.ieee.org\/xpl [Accessed 12 Apr. 2015].<\/div>\n<\/div>\n\u00a0Tang, R., Lu, L., Zhuang, Y. and Fong, S. (2012). Not Every Friend on a Social Network Can be Trusted: An Online Trust Indexing Algorithm. In: IEEE\/WIC\/ACM International Conferences on Web Intelligence and Intelligent Agent Technology<\/i>. [online] Macau SAR, China: IEEE Computer Society, pp.280-285. Available at: http:\/\/ieeexplore.ieee.org [Accessed 12 Apr. 2015].<\/div>\n<\/div>\n<\/div>\nZiegler, C. and Lausen, G. (2004). Spreading activation models for trust propagation.\u00a0IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE ’04. 2004<\/em>.<\/div>\n<\/div>\nThis post is written by : Muna & Awezan<\/div>\n","protected":false},"excerpt":{"rendered":"Trust is involved in human activities in a daily basis. Measuring trust in a digital world can be more complicated than real life. There are various methods that help in calculating trust and evaluating users based on trust value.There are … Continue reading
- Personalization :<\/strong>Trust is held from the view of a node \u2013 it is therefore\u00a0local trust <\/strong>(Millard & Imran, 2015).<\/li>\n<\/ul>\n
- Asymmetry :\u00a0<\/strong>If A trusts B it does not follow that B trusts A<\/li>\n<\/ul>\n