Finding the optimal social trust path for the selection of trustworthy service providers in complex social networks

Online Social networks have provided the infrastructure for a number of emerging applications in recent years, e.g., for the recommendation of service providers or the recommendation of files as services. In these applications, trust is one of the most important factors in decision making by a service consumer, requiring the evaluation of the trustworthiness of a service provider along the social trust paths from a service consumer to the service provider. However, there are usually many social trust paths between two participants who are unknown to one another. In addition, some social information, such as social relationships between participants and the recommendation roles of participants, has significant influence on trust evaluation but has been neglected in existing studies of online social networks. Furthermore, it is a challenging problem to search the optimal social trust path that can yield the most trustworthy evaluation result and satisfy a service consumer's trust evaluation criteria based on social information. In this paper, we first present a novel complex social network structure incorporating trust, social relationships and recommendation roles, and introduce a new concept, Quality of Trust (QoT), containing the above social information as attributes. We then model the optimal social trust path selection problem with multiple end-to-end QoT constraints as a Multiconstrained Optimal Path (MCOP) selection problem, which is shown to be NP-Complete. To deal with this challenging problem, we propose a novel Multiple Foreseen Path-Based Heuristic algorithm MFPB-HOSTP for the Optimal Social Trust Path selection, where multiple backward local social trust paths (BLPs) are identified and concatenated with one Forward Local Path (FLP), forming multiple foreseen paths. Our strategy could not only help avoid failed feasibility estimation in path selection in certain cases, but also increase the chances of delivering a near-optimal solution with high quality. The results of our experiments conducted on a real data set of online social networks illustrate that MFPB-HOSTP algorithm can efficiently identify the social trust paths with better quality than our previously proposed H-OSTP algorithm that outperforms prior algorithms for the MCOP selection problem.16 page(s

Privacy and trustworthiness management in moving object environments

The use of location-based services (LBS) (e.g., Intel\u27s Thing Finder) is expanding. Besides the traditional centralized location-based services, distributed ones are also emerging due to the development of Vehicular Ad-hoc Networks (VANETs), a dynamic network which allows vehicles to communicate with one another. Due to the nature of the need of tracking users\u27 locations, LBS have raised increasing concerns on users\u27 location privacy. Although many research has been carried out for users to submit their locations anonymously, the collected anonymous location data may still be mapped to individuals when the adversary has related background knowledge. To improve location privacy, in this dissertation, the problem of anonymizing the collected location datasets is addressed so that they can be published for public use without violating any privacy concerns. Specifically, a privacy-preserving trajectory publishing algorithm is proposed that preserves high data utility rate. Moreover, the scalability issue is tackled in the case the location datasets grows gigantically due to continuous data collection as well as increase of LBS users by developing a distributed version of our trajectory publishing algorithm which leveraging the MapReduce technique. As a consequence of users being anonymous, it becomes more challenging to evaluate the trustworthiness of messages disseminated by anonymous users. Existing research efforts are mainly focused on privacy-preserving authentication of users which helps in tracing malicious vehicles only after the damage is done. However, it is still not sufficient to prevent malicious behavior from happening in the case where attackers do not care whether they are caught later on. Therefore, it would be more effective to also evaluate the content of the message. In this dissertation, a novel information-oriented trustworthiness evaluation is presented which enables each individual user to evaluate the message content and make informed decisions --Abstract, page iii

RECOMMENDING SERVICES IN A DIFFERNTIATED TRUST-BASED DECENTRALIZED USER MODELING SYSTEM

Trust and reputation mechanisms are often used in peer-to-peer networks, multi-agent systems and online communities for trust-based interactions among the users. Trust values are used to differentiate among members of the community as well as to recommend service providers. Although different users have different needs and expectations in different aspects of the service providers, traditional trust-based models do not use trust values on neighbors for judging different aspects of service providers. In this thesis, I use multi-faceted trust models for users connected in a network who are looking for suitable service providers according to their preferences. Each user has two sets of trust values: i) trust in different aspects of the quality of service providers, ii) trust in recommendations provided for these aspects. These trust models are used in a decentralized user modeling system where agents (representing users) have different preference weights in different criteria of service providers. My approach helps agents by recommending the best possible service provider for each agent according to its preferences. The approach is evaluated by conducting simulation on both small and large social networks. The results of the experiments illustrate that agents find better matches or more suitable service providers for themselves using my trust-based recommender system without the help of any central server. To the best of my knowledge this is the first system that uses multi-faceted trust values both in the qualities of service-providers and in other users’ ability to evaluate these qualities of service providers in a decentralized user modeling system

Partnership Development Among Mental Health Organizations

Mental health organizations can play a key role in enhancing youths\u27 access to care by working together to bridge gaps in service delivery systems. This dissertation study examines partnerships among a network of children\u27s behavioral health organizations. The specific aims are to (1) describe and understand the network of partnerships among members of the Children\u27s Services Coalition, (2) assess the capacity of the system to provide coordinated service delivery, and (3) test how patterns of organizational characteristics influence conditions that facilitate and inhibit partnerships among the Children\u27s Service Coalition organizations. This dissertation is a predominantly quantitative cross-sectional network study of 36 children\u27s mental health organizations in St. Louis County that are members of the newly formed Children\u27s Services Coalition. Network data on relationships and archival data from IRS 990 forms were collected and used to explain how organizational characteristics might lead certain organizations to partner, but create conditions that simultaneously facilitate and hinder the degree to which organizations partner. Overall, the key findings describe partnership behavior at the network, small-group, and dyadic-level. First, children\u27s behavioral health organizations in the CSC maintain a complex set of partnerships, which are expected to grow as new opportunities emerge. Second, although partnerships are very common, the larger network may not be well coordinated as evidenced by the few systematic partnership patterns uncovered using descriptive network analysis techniques including sub-group analysis and blockmodeling. However there is potential for coordination at the sub-group level among small groups of similar organizations. Finally, at the dyadic-level, results of a path analysis demonstrate how similar competing organizations depend on one another for resources and benefit from their collaboration, which drives partnerships. Results suggest that organizational interests drive partnership development in this network, and bring together competing organizations that provide similar resources potentially as a strategy for managing competition, or creating efficiencies. This trend runs counter to system reform goals for bridging organizations with complementary services to facilitate access to quality care

SDSF : social-networking trust based distributed data storage and co-operative information fusion.

As of 2014, about 2.5 quintillion bytes of data are created each day, and 90% of the data in the world was created in the last two years alone. The storage of this data can be on external hard drives, on unused space in peer-to-peer (P2P) networks or using the more currently popular approach of storing in the Cloud. When the users store their data in the Cloud, the entire data is exposed to the administrators of the services who can view and possibly misuse the data. With the growing popularity and usage of Cloud storage services like Google Drive, Dropbox etc., the concerns of privacy and security are increasing. Searching for content or documents, from this distributed stored data, given the rate of data generation, is a big challenge. Information fusion is used to extract information based on the query of the user, and combine the data and learn useful information. This problem is challenging if the data sources are distributed and heterogeneous in nature where the trustworthiness of the documents may be varied. This thesis proposes two innovative solutions to resolve both of these problems. Firstly, to remedy the situation of security and privacy of stored data, we propose an innovative Social-based Distributed Data Storage and Trust based co-operative Information Fusion Framework (SDSF). The main objective is to create a framework that assists in providing a secure storage system while not overloading a single system using a P2P like approach. This framework allows the users to share storage resources among friends and acquaintances without compromising the security or privacy and enjoying all the benefits that the Cloud storage offers. The system fragments the data and encodes it to securely store it on the unused storage capacity of the data owner\u27s friends\u27 resources. The system thus gives a centralized control to the user over the selection of peers to store the data. Secondly, to retrieve the stored distributed data, the proposed system performs the fusion also from distributed sources. The technique uses several algorithms to ensure the correctness of the query that is used to retrieve and combine the data to improve the information fusion accuracy and efficiency for combining the heterogeneous, distributed and massive data on the Cloud for time critical operations. We demonstrate that the retrieved documents are genuine when the trust scores are also used while retrieving the data sources. The thesis makes several research contributions. First, we implement Social Storage using erasure coding. Erasure coding fragments the data, encodes it, and through introduction of redundancy resolves issues resulting from devices failures. Second, we exploit the inherent concept of trust that is embedded in social networks to determine the nodes and build a secure net-work where the fragmented data should be stored since the social network consists of a network of friends, family and acquaintances. The trust between the friends, and availability of the devices allows the user to make an informed choice about where the information should be stored using `k\u27 optimal paths. Thirdly, for the purpose of retrieval of this distributed stored data, we propose information fusion on distributed data using a combination of Enhanced N-grams (to ensure correctness of the query), Semantic Machine Learning (to extract the documents based on the context and not just bag of words and also considering the trust score) and Map Reduce (NSM) Algorithms. Lastly we evaluate the performance of distributed storage of SDSF using era- sure coding and identify the social storage providers based on trust and evaluate their trustworthiness. We also evaluate the performance of our information fusion algorithms in distributed storage systems. Thus, the system using SDSF framework, implements the beneficial features of P2P networks and Cloud storage while avoiding the pitfalls of these systems. The multi-layered encrypting ensures that all other users, including the system administrators cannot decode the stored data. The application of NSM algorithm improves the effectiveness of fusion since large number of genuine documents are retrieved for fusion

A MULTI-FUNCTIONAL PROVENANCE ARCHITECTURE: CHALLENGES AND SOLUTIONS

In service-oriented environments, services are put together in the form of a workflow with the aim of distributed problem solving. Capturing the execution details of the services' transformations is a significant advantage of using workflows. These execution details, referred to as provenance information, are usually traced automatically and stored in provenance stores. Provenance data contains the data recorded by a workflow engine during a workflow execution. It identifies what data is passed between services, which services are involved, and how results are eventually generated for particular sets of input values. Provenance information is of great importance and has found its way through areas in computer science such as: Bioinformatics, database, social, sensor networks, etc. Current exploitation and application of provenance data is very limited as provenance systems started being developed for specific applications. Thus, applying learning and knowledge discovery methods to provenance data can provide rich and useful information on workflows and services. Therefore, in this work, the challenges with workflows and services are studied to discover the possibilities and benefits of providing solutions by using provenance data. A multifunctional architecture is presented which addresses the workflow and service issues by exploiting provenance data. These challenges include workflow composition, abstract workflow selection, refinement, evaluation, and graph model extraction. The specific contribution of the proposed architecture is its novelty in providing a basis for taking advantage of the previous execution details of services and workflows along with artificial intelligence and knowledge management techniques to resolve the major challenges regarding workflows. The presented architecture is application-independent and could be deployed in any area. The requirements for such an architecture along with its building components are discussed. Furthermore, the responsibility of the components, related works and the implementation details of the architecture along with each component are presented

Trust and reputation management in decentralized systems

In large, open and distributed systems, agents are often used to represent users and act on their behalves. Agents can provide good or bad services or act honestly or dishonestly. Trust and reputation mechanisms are used to distinguish good services from bad ones or honest agents from dishonest ones. My research is focused on trust and reputation management in decentralized systems. Compared with centralized systems, decentralized systems are more difficult and inefficient for agents to find and collect information to build trust and reputation. In this thesis, I propose a Bayesian network-based trust model. It provides a flexible way to present differentiated trust and combine different aspects of trust that can meet agents’ different needs. As a complementary element, I propose a super-agent based approach that facilitates reputation management in decentralized networks. The idea of allowing super-agents to form interest-based communities further enables flexible reputation management among groups of agents. A reward mechanism creates incentives for super-agents to contribute their resources and to be honest. As a single package, my work is able to promote effective, efficient and flexible trust and reputation management in decentralized systems

System Modeling and Trust Evaluation of Distributed Systems

International audienceNowadays, digital systems are connected through complex architectures. These systems involve persons, physical and digital resources such that we can consider that a system consists of elements from two worlds, the social world and the digital world, and their relations. Users perform activities like chatting, buying, sharing data, etc. Evaluating and choosing appropriate systems involve aspects like functionality, performance, QoS, ease of use, or price. Recently, trust appeared as another key factor for such an evaluation. In this context, we raise two issues, (i) how to formalize the entities that compose a system and their relations for a particular activity? and (ii) how to evaluate trust in a system for this activity? This work proposes answers to both questions. On the one hand, we propose SOCIOPATH, a metamodel based on first order logic, that allows to model a system considering entities of the social and digital worlds and their relations. On the other hand, we propose two approaches to evaluate trust in systems, namely, SOCIOTRUST and SUBJECTIVETRUST. The former is based on probability the- ory to evaluate users’ trust in systems for a given activity. The latter is based on subjective logic to take into account uncertainty in trust values