Home » Posts tagged 'social-nets'
Tag Archives: social-nets
Many recent studies of trust and reputation are made in the context of commercial reputation or rating systems for online communities. Most of these systems have been constructed without a formal rating model or much regard for our sociological understanding of these concepts.
This paper “propose[s] a mathematical framework for modeling trust and reputation that is rooted in findings from the social sciences. In particular, our framework makes explicit the importance of social information (i.e., indirect channels of inference) in aiding members of a social network choose whom they want to partner with or to avoid. Rating systems that make use of such indirect channels of inference are necessarily personalized in nature, catering to the individual context of the rater”.
This work covers the research work on decentralization of Online Social Networks (OSNs), issues with centralized design are studied with possible decentralized solutions. Centralized architecture is prone to privacy breach, p2p architecture for data and thus authority decentralization with encryption seems a possible solution. OSNs’ users grow exponentially causing scalability issue, a natural solution is decentralization where users bring resources with them via personal machines or paid services. Also centralized services are not available unremittingly, to this end decentralization proposes replication. Decentralized solutions are also proposed for reliability issues arising in centralized systems and the potential threat of a central authority. Yet key to all problems isn’t found, metadata may be enough for inferences about data and network traffic flow can lead to information on users’ relationships. First issue can be mitigated by data padding or splitting in uniform blocks. Caching, dummy traffic or routing through a mix of nodes can be some possible solutions to the second.
Chapter 3 of “Managing and Processing Big Data in Cloud Computing”.
Users and resources in online social networks (OSNs) are interconnected via various types of relationships. In particular, user-to-user relationships form the basis of the OSN structure, and play a significant role in specifying and enforcing access control. Individual users and the OSN provider should be enabled to specify which access can be granted in terms of existing relationships. In this paper, we propose a novel user-to-user relationship-based access control (UURAC) model for OSN systems that utilizes regular expression notation for such policy specification. Access control policies on users and resources are composed in terms of requested action, multiple relationship types, the starting point of the evaluation, and the number of hops on the path. We present two path checking algorithms to determine whether the required relationship path between users for a given access request exists. We validate the feasibility of our approach by implementing a prototype system and evaluating the performance of these two algorithms.
Online social networks (OSNs) suffer from the creation of fake accounts that introduce fake product reviews, malware and spam. Existing defenses focus on using the social graph structure to isolate fakes. However, our work shows that Sybils could befriend a large number of real users, invalidating the assumption behind social-graph-based detection. In this paper, we present VoteTrust, a scalable defense system that further leverages user-level activities. VoteTrust models the friend invitation interactions among users as a directed, signed graph, and uses two key mechanisms to detect Sybils over the graph: a voting-based Sybil detection to find Sybils that users vote to reject, and a Sybil community detection to find other colluding Sybils around identified Sybils. Through evaluating on Renren social network, we show that VoteTrust is able to prevent Sybils from generating many unsolicited friend requests. We also deploy VoteTrust in Renen, and our real experience demonstrates that VoteTrust can detect large-scale collusion among Sybils.
Human Computer Interaction: Concepts, Methodologies, Tools, and Applications penetrates the human computer interaction (HCI) field with more breadth and depth of comprehensive research than any other publication. The four-volume set contains more than 200 authoritative works from over 250 leading experts in the field of human computer interaction. This groundbreaking collection contains significant chapters in topics such as Web logs, technology influences, and human factors of information systems and technologies.
In this paper, we implement the first comprehensive quantification of the perfect de-anonymizability and partial de-anonymizability of real-world social networks with seed information under general scenarios, which provides the theoretical foundation for the existing structure-based de-anonymization attacks and closes the gap between de-anonymization practice and theory. Based on our quantification, we conduct a large-scale evaluation of the de-anonymizability of 24 real-world social networks by quantitatively showing the conditions for perfectly and partially de-anonymizing a social network, how de-anonymizable a social network is, and how many users of a social network can be successfully de-anonymized. Furthermore, we show that both theoretically and experimentally, the overall structural information-based de-anonymization attack can be more powerful than the seed-based de-anonymization attack, and even without any seed information, a social network can be perfectly or partially de-anonymized. Finally, we discuss the implications of this paper. Our findings are expected to shed on research questions in the areas of structural data anonymization and de-anonymization and to help data owners evaluate their structural data vulnerability before data sharing and publishing.