The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
On trust models and trust evaluation metrics for ad hoc networks
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 2×
“The formalism of semirings highlights that our algorithm is a member of a larger family of wellstudied algorithms, collectively described under the term Factor Graphs [5], or Generalized Distributive Law [6].”
Mitigating routing misbehavior in mobile ad hoc networks
Marti, S., Giuli, T. J., Lai, K., & Baker, M. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345955 · Cited by 3,415
The EigenTrust algorithm for reputation management in P2P networks
Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775242 · Cited by 3,362
Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations
Corson, S., & Macker, J. (1999) · doi:10.17487/rfc2501 · Cited by 1,946
The Eigentrust algorithm for reputation management in P2P networks
Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775240.775242 · Cited by 1,365
Zimmermann, P. R. (1996) · Cited by 889
The generalized distributive law
Aji, S. M., & McEliece, R. J. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825794 · Cited by 735
The quest for security in mobile ad hoc networks
Hubaux, J., Buttyán, L., & Capkun, S. (2001) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/501436.501437 · Cited by 730
Valuation of trust in open networks
Beth, T., Borcherding, M., & Klein, B. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58618-0_53 · Cited by 652
The quest for security in mobile ad hoc networks
Hubaux, J.-P., Buttyán, L., & Capkun, S. (2001) · Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '01 · doi:10.1145/501416.501437 · Cited by 453
An Algebra for Assessing Trust in Certification Chains.
Jøsang, A. (1999) · Cited by 333
Modelling a public-key infrastructure
Maurer, U. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61770-1_45 · Cited by 324
Mobility helps security in ad hoc networks
Čapkun, S., Hubaux, J.-P., & Buttyán, L. (2003) · Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/778415.778422 · Cited by 257
Semiring Frameworks and Algorithms for Shortest-Distance Problems
Mohri, M. (2002) · doi:10.25596/jalc-2002-321 · Cited by 254
On Trust Establishment in Mobile Ad-Hoc Networks
Eschenauer, L., Gligor, V. D., & Baras, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39871-4_6 · Cited by 234
Self-citationAttack-resistant trust metrics for public key certification
Levien, R., & Aiken, A. (1998) · Cited by 187
Parameter estimation for probabilistic finite-state transducers
Eisner, J. M. (2001) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/1073083.1073085 · Cited by 172
SPROUT: P2P Routing with Social Networks
Marti, S., Ganesan, P., & García-Molina, H. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30192-9_42 · Cited by 119
Distributed Trust Evaluation in Ad-Hoc Networks
Theodorakopoulos, G. (2004) · Cited by 10
Self-citation
Cited by
A Survey on Trust Management for Mobile Ad Hoc Networks
Cho, J.-H., Swami, A., & Chen, I.-R. (2011) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.092110.00088 · Cited by 664
On Data-Centric Trust Establishment in Ephemeral Ad Hoc Networks
Raya, M., Papadimitratos, P., Gligor, V. D., & Hubaux, J.-P. (2008) · IEEE INFOCOM 2008 - The 27th Conference on Computer Communications · doi:10.1109/infocom.2008.180 · Cited by 473
Bao, F., Chen, I.-R., Chang, M., & Cho, J.-H. (2012) · IEEE Transactions on Network and Service Management · doi:10.1109/tcomm.2012.031912.110179 · Cited by 450
Trust Computations and Trust Dynamics in Mobile Adhoc Networks: A Survey
Govindan, K., & Mohapatra, P. (2012) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.042711.00083 · Cited by 367
Group-Based Trust Management Scheme for Clustered Wireless Sensor Networks
Shaikh, R. A., Jameel, H., d'Auriol, B. J., Lee, H., Lee, S., & Song, Y.-J. (2009) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2008.258 · Cited by 340
Metadata
- Authors
- Theodorakopoulos, G., & Baras, J. S.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2006-02
- Volume
- 24
- Issue
- 2
- Pages
- 318-328
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2168205742
- Cited by
- 511
- References
- 20
- FWCI
- 111.82
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.