Trustworthy-based efficient data broadcast model for P2P interaction in resource-constrained wireless environments

AbstractIn a decentralised system like P2P where each individual peers are considerably autonomous, the notion of mutual trust between peers is critical. In addition, when the environment is subject to inherent resource constraints, any efficiency efforts are essentially needed. In light of these two issues, we propose a novel trustworthy-based efficient broadcast scheme in a resource-constrained P2P environment. The trustworthiness is associated with the peerʼs reputation. A peer holds a personalised view of reputation towards other peers in four categories namely SpEed, Correctness, qUality, and Risk-freE (SeCuRE). The value of each category constitutes a fraction of the reliability of individual peer. Another factor that contributes to the reliability of a peer is the peerʼs credibility concerning trustworthiness in providing recommendation about other peers. Our trust management scheme is applied in conjunction with our trust model in order to detect malicious and collaborative-based malicious peers. Knowledge of trustworthiness among peers is used in our proposed broadcast model named trustworthy-based estafet multi-point relays (TEMPR). This model is designed to minimise the communication overhead between peers while considering the trustworthiness of the peers such that only trustworthy peer may relay messages to other peers. With our approach, each peer is able to disseminate messages in the most efficient and reliable manner

Advanced languages and techniques for trust negotiation.

The Web is quickly shifting from a document browsing and delivery system to a hugely complex ecosystem of interconnected online applications. A relevant portion of these applications dramatically increase the number of users required to dynamically authenticate themselves and to, on the other hand, to identify the service they want to use. In order to manage interactions among such users/services is required a flexible but powerful mechanism. Trust management, and in particular trust negotiation techniques, is a reasonable solution. In this work we present the formalization of the well known trust negotiation framework Trust-X, of a rule-based policy definition language, called X-RNL. Moreover, we present the extension of both the framework and of the language to provide advanced trust negotiation architectures, namely negotiations among groups. We also provide protocols to adapt trust negotiations to mobile environments, specifically, we present protocols allowing a trust negotiation to be executed among several, distinct, sessions while still preserving its security properties. Such protocols have also been extended to provides the capability to migrate a ongoing trust negotiation among a set of known, reliable, subjects. Finally, we present the application of the previously introduced trust negotiation techniques into real world scenarios: online social networks, critical infrastructures and cognitive radio networks

Group-Based Negotiations in P2P Systems

In P2P systems, groups are typically formed to share resources and/or to carry on joint tasks. In distributed environments formed by a large number of peers conventional authentication techniques are inadequate for the group joining process, and more advanced ones are needed. Complex transactions among peers may require more elaborate interactions based on what peers can do or possess instead of peers\u27 identity. In this work, we propose a novel peer group joining protocol. We introduce a highly expressive resource negotiation language, able to support the specification of a large variety of conditions applying to single peers or groups of peers. Moreover, we define protocols to test such resource availability customized to the level of assurance required by the peers. Our approach has been tested and evaluated on an extension of the JXTA P2P platform. Our results show the robustness of our approach in detecting malicious peers, detected both during the negotiation and during the peer group lifetime. Regardless of the peer group cardinality and interaction frequency, the peers always detect possible free riders within a small time frame