Journal ArticleDOI
Resilient authentication using path independence
TLDR
Evidence that there are no efficient algorithms for locating maximum sets of paths with path independence properties is given and several approximation algorithms for these problems are proposed.Abstract:
Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distributed system. In this paper, we explore the use of multiple paths to redundantly authenticate a channel and focus on two notions of path independence-disjoint paths and connective paths-that seem to increase assurance in the authentication. We give evidence that there are no efficient algorithms for locating maximum sets of paths with these independence properties and propose several approximation algorithms for these problems. We also describe a service we have deployed, called PathServer, that makes use of our algorithms to find such sets of paths to support authentication in PGP applications.read more
Citations
More filters
Dissertation
Computing and applying trust in web-based social networks
TL;DR: It is shown that, in the case where the user's opinion is divergent from the average, the trust-based recommended ratings are more accurate than several other common collaborative filtering techniques.
Journal ArticleDOI
Information theoretic framework of trust modeling and evaluation for ad hoc networks
TL;DR: Simulations show that the proposed trust evaluation system can significantly improve the network throughput as well as effectively detect malicious behaviors in ad hoc networks.
Proceedings ArticleDOI
A trust evaluation framework in distributed networks: Vulnerability analysis and defense against attacks
TL;DR: Simulations show that the proposed framework to quantitatively measure trust, model trust propagation, and defend trust evaluation systems against malicious attacks can significantly improve network throughput as well as effectively detect malicious behaviors in ad hoc networks.
Proceedings ArticleDOI
Trust evaluation in ad-hoc networks
TL;DR: This work shows how two nodes can establish an indirect trust relation without previous direct interaction using the theory of semirings, and gives intuitive requirements for any trust evaluation algorithm.
Proceedings ArticleDOI
A dynamic trust model for mobile ad hoc networks
TL;DR: This paper demonstrates important concepts for establishing a collaborative, dynamic trust model and for using this model as an example to enhance the security of message routing in mobile ad hoc networks.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
Implementing fault-tolerant services using the state machine approach: a tutorial
TL;DR: The state machine approach is a general method for implementing fault-tolerant services in distributed systems and protocols for two different failure models—Byzantine and fail stop are described.