Results 1 - 10 of 100

The EigenTrust Algorithm for Reputation Management in P2P Networks

by Sepandar D. Kamvar, Mario T. Schlosser, Hector Garcia-molina - in Proceedings of the 12th International World Wide Web Conference (WWW 2003 , 2003
"... Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, as recent experience with P2P networks such as Gnutella shows, the anonymous, open nature of these networks offers an almost ideal environment for the spread of self ..."
Abstract - Cited by 997 (23 self) - Add to MetaCart
Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, as recent experience with P2P networks such as Gnutella shows, the anonymous, open nature of these networks offers an almost ideal environment for the spread of self-replicating inauthentic files.

Spreading Activation Models for Trust Propagation

by Cai-Nicolas Ziegler, Georg Lausen - In Proceedings of the IEEE International Conference on e-Technology, e-Commerce, and e-Service , 2004
"... Semantic Web endeavors have mainly focused on issues pertaining to knowledge representation and ontology design. However, besides understanding information metadata stated by subjects, knowing about their credibility becomes equally crucial. Hence, trust and trust metrics, conceived as computational ..."
Abstract - Cited by 111 (4 self) - Add to MetaCart
Semantic Web endeavors have mainly focused on issues pertaining to knowledge representation and ontology design. However, besides understanding information metadata stated by subjects, knowing about their credibility becomes equally crucial. Hence, trust and trust metrics, conceived as computational means to evaluate trust relationships between individuals, come into play. Our major contributions to Semantic Web trust management through this paper are twofold. First, we introduce our classification scheme for trust metrics along various axes and discuss advantages and drawbacks of existing approaches for Semantic Web scenarios. Hereby, we will devise our advocacy for local group trust metrics, guiding us to the second part which presents Appleseed, our novel proposal for local group trust computation. Compelling in its simplicity, Appleseed borrows many ideas from spreading activation models in psychology and relates their concepts to trust evaluation in an intuitive fashion.
(Show Context)

On trust models and trust evaluation metrics for ad hoc networks

by George Theodorakopoulos, John S. Baras - IEEE Journal on Selected Areas in Communications , 2006
"... Abstract—Within the realm of network security, we interpret the concept of trust as a relation among entities that participate in various protocols. Trust relations are based on evidence created by the previous interactions of entities within a protocol. In this work, we are focusing on the evaluati ..."
Abstract - Cited by 87 (8 self) - Add to MetaCart
Abstract—Within the realm of network security, we interpret the concept of trust as a relation among entities that participate in various protocols. Trust relations are based on evidence created by the previous interactions of entities within a protocol. In this work, we are focusing on the evaluation of trust evidence in ad hoc networks. Because of the dynamic nature of ad hoc networks, trust evidence may be uncertain and incomplete. Also, no preestablished infrastructure can be assumed. The evaluation process is modeled as a path problem on a directed graph, where nodes represent entities, and edges represent trust relations. We give intuitive requirements and discuss design issues for any trust evaluation algorithm. Using the theory of semirings, we show how two nodes can establish an indirect trust relation without previous direct interaction. We show that our semiring framework is flexible enough to express other trust models, most notably PGP’s Web of Trust. Our scheme is shown to be robust in the presence of attackers. Index Terms—Trust evaluation, trust metric, trust model, semiring. I.
(Show Context)

Propagation Models for Trust and Distrust in Social Networks

by Cai-Nicolas Ziegler, Georg Lausen , 2005
"... Semantic Web endeavors have mainly focused on issues pertaining to knowledge representation and ontology design. However, besides understanding information metadata stated by subjects, knowing about their credibility becomes equally crucial. Hence, trust and trust metrics, conceived as computationa ..."
Abstract - Cited by 73 (0 self) - Add to MetaCart
Semantic Web endeavors have mainly focused on issues pertaining to knowledge representation and ontology design. However, besides understanding information metadata stated by subjects, knowing about their credibility becomes equally crucial. Hence, trust and trust metrics, conceived as computational means to evaluate trust relationships between individuals, come into play. Our major contribution to Semantic Web trust management through this work is twofold. First, we introduce a classification scheme for trust metrics along various axes and discuss advantages and drawbacks of existing approaches for Semantic Web scenarios. Hereby, we devise an advocacy for local group trust metrics, guiding us to the second part which presents Appleseed, our novel proposal for local group trust computation. Compelling in its simplicity, Appleseed borrows many ideas from spreading activation models in psychology and relates their concepts to trust evaluation in an intuitive fashion. Moreover, we provide extensions for the Appleseed nucleus that make our trust metric handle distrust statements.

Trust evaluation in ad-hoc networks

by George Theodorakopoulos, John S. Baras - In 3rd ACM workshop on Wireless security , 2004
"... An important concept in network security is trust, interpreted as a relation among entities that participate in various protocols. Trust relations are based on evidence related to the previous interactions of entities within a protocol. In this work, we are focusing on the evaluation process of trus ..."
Abstract - Cited by 72 (4 self) - Add to MetaCart
An important concept in network security is trust, interpreted as a relation among entities that participate in various protocols. Trust relations are based on evidence related to the previous interactions of entities within a protocol. In this work, we are focusing on the evaluation process of trust evidence in Ad Hoc Networks. Because of the dynamic nature of Ad Hoc Networks, trust evidence may be uncertain and incomplete. Also, no pre-established infrastructure can be assumed. The process is formulated as a path problem on a directed graph, where nodes represent entities, and edges represent trust relations. Using the theory of semirings, we show how two nodes can establish an indirect trust relation without previous direct interaction. The results are robust in the presence of attackers. We give intuitive requirements for any trust evaluation algorithm. The performance of the scheme is evaluated on three topologies.
(Show Context)

A probabilistic emergent routing algorithm for mobile ad hoc networks

by John S. Baras, Harsh Mehta - In Proceedings of the Workshop on Modeling and Optimization in Mobile, Ad hoc and Wireless Networks (WiOpt’03
"... Mobile ad hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. In this pap ..."
Abstract - Cited by 60 (1 self) - Add to MetaCart
Mobile ad hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. In this paper we take a novel approach to the routing problem in MANETs by using swarm inteligenceinspired algorithms. The proposed algorithm uses Ant-like agents to discover and maintain paths in a MANET with dynamic topology. We present simulation results that measure the performance of our algorithm with respect to the characteristics of a MANET, the varying parameters of the algorithm itself as well as performance comparison with other well-known routing protocols. 1
(Show Context)

On Data-Centric Trust Establishment in Ephemeral Ad Hoc Networks

by Maxim Raya, Panagiotis Papadimitratos, Virgil D. Gligor, Jean-pierre Hubaux - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS , 2008
"... We argue that the traditional notion of trust as a relation among entities, while useful, becomes insufficient for emerging data-centric mobile ad hoc networks. In these systems, setting the data trust level equal to the trust level of the data- providing entity would ignore system salient features, ..."
Abstract - Cited by 47 (7 self) - Add to MetaCart
We argue that the traditional notion of trust as a relation among entities, while useful, becomes insufficient for emerging data-centric mobile ad hoc networks. In these systems, setting the data trust level equal to the trust level of the data- providing entity would ignore system salient features, rendering applications ineffective and systems inflexible. This would be even more so if their operation is ephemeral, i.e., characterized by short-lived associations in volatile environments. In this paper, we address this challenge by extending the traditional notion of trust to data-centric trust: trustworthiness attributed to node-reported data per se. We propose a framework for data-centric trust establishment: First, trust in each individual piece of data is computed; then multiple, related but possibly contradictory, data are combined; finally, their validity is inferred by a decision component based on one of several evidence evaluation techniques. We consider and evaluate an instantiation of our framework in vehicular networks as a case study. Our simulation results show that our scheme is highly resilient to attackers and converges stably to the correct decision.
(Show Context)

Attacks on Inter Vehicle Communication Systems - an Analysis

by Amer Aijaz, Bernd Bochow, Florian Dötzer, Andreas Festag, Matthias Gerlach, Rainer Kroh, Tim Leinmüller - In Proc. WIT , 2006
"... Abstract—Inter-vehicle communication systems are a new paradigm of networking. Largely related to mobile ad hoc networks and their distributed, self-organizing structure, they also introduce new threats. In order to assess these threats we introduce a model of attacks on an inter-vehicle communicati ..."
Abstract - Cited by 46 (7 self) - Add to MetaCart
Abstract—Inter-vehicle communication systems are a new paradigm of networking. Largely related to mobile ad hoc networks and their distributed, self-organizing structure, they also introduce new threats. In order to assess these threats we introduce a model of attacks on an inter-vehicle communication system in this paper. This model is used to refine the system model of the NoW communication system and to find potential weaknesses during the specification phase of the NoW communication system. Our work shows that there are several interesting new challenges requiring novel solutions, some of which are outlined at the end of this paper. Although this is still work in progress, it is the foundation for analysis and assessment of future work. As one of the main results of this paper, we identified several difficult to detect attacks on the hard- and software, and on the sensor input. We further point out system requirements to thwart such attacks. I.
(Show Context)

A quantitative trust establishment framework for reliable data packet delivery in MANETs

by C. Zouridaki, B. L. Mark, M. Hejmo - Proceedings of the Third ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN , 2005
"... In mobile ad hoc networks (MANETs), a source node must rely on other nodes to forward its packets on multi-hop routes to the destination. Secure and reliable handling of packets by the intermediate nodes is difficult to ensure in an ad hoc environment. We propose a trust establishment scheme for MAN ..."
Abstract - Cited by 35 (2 self) - Add to MetaCart
In mobile ad hoc networks (MANETs), a source node must rely on other nodes to forward its packets on multi-hop routes to the destination. Secure and reliable handling of packets by the intermediate nodes is difficult to ensure in an ad hoc environment. We propose a trust establishment scheme for MANETs which aims to improve the reliability of packet forwarding over multi-hop routes in the presence of potentially malicious nodes. Each node forms an “opinion” about each of the other nodes based on both first and second-hand observation data collected from the network. The opinion metric can be incorporated into ad hoc routing protocols to achieve reliable packet delivery even when a portion of the network exhibits malicious behavior. We present numerical results which demonstrate the effectiveness of the proposed trust establishment scheme.
(Show Context)

Trust evaluation in anarchy: A case study on autonomous networks

by Tao Jiang - In Proceedings of IEEE Infocom’06 , 2006
"... Abstract — With the explosive growth of network techniques, in particular wireless communications, the traditional centralized, fixed networks can no longer satisfy the enormous demands on network connectivity, data storage and information exchanges. New types of networks, such as pervasive computin ..."
Abstract - Cited by 25 (5 self) - Add to MetaCart
Abstract — With the explosive growth of network techniques, in particular wireless communications, the traditional centralized, fixed networks can no longer satisfy the enormous demands on network connectivity, data storage and information exchanges. New types of networks, such as pervasive computing networks, mobile ad hoc networks and P2P networks, emerged in recent years in order to provide solutions for the increasing requirements on networked services. All those networks are autonomous networks, because they are distributed and self-organized. As a case study, we employ a specific application – distributed trust management – to understand and analyze the behavior and properties of these “anarchical ” autonomous networks. We propose a statistical trust evaluation rule, prove its convergence and investigate its characteristics when the system is at the steady state. Our investigation results in several conclusions for the design of trust evaluation rules, some of which are unexpected if we do not have the stationary distribution at hand. Our study shows the importance and necessity of applying theoretical analyses to understand the complex characteristics of distributed, self-organized, autonomous networks. I.
(Show Context)