As people go about their lives, they form a variety of social relationships, such as family, friends, colleagues, and acquaintances, and these relationships differ in their strength, indicating the level of trust among these people. The trend in these relationships is for people to trust those who they have met in real life more than unfamiliar people whom they have only met online. In online social network sites the objective is to make it possible for users to post information and share albums, diaries, videos, and experiences with a list of contacts who are real-world friends and/or like-minded online friends. However, with the growth of online social services, the need for identifying trustworthy people has become a primary focus in order to protect users' vast amounts of information from being misused by unreliable users. In this thesis, we introduce the Capacity- first algorithm for identifying a local group of trusted people within a network. In order to achieve the outlined goals, the algorithm adapts the Advogato trust metric by incorporating weighted social relationships. The Capacity-first algorithm determines all possible reliable users within the network of a targeted user and prevents malicious users from accessing their personal network. In order to evaluate our algorithm, we conduct experiments to measure its performance against other well-known baseline algorithms. The experimental results show that our algorithm's performance is better than existing alternatives in finding all possible trustworthy users and blocking unreliable ones from violating users' privacy.
展开▼
