Trust evaluation in ad-hoc networks

Theodorakopoulos, Georgios ORCID: https://orcid.org/0000-0003-2701-7809 and Baras, John S. 2004. Trust evaluation in ad-hoc networks. Presented at: WiSe '04:3rd ACM workshop on Wireless security, 1 October 2004, Published in: Jakobsson, M. and Perrig, A. eds. WiSe '04 Proceedings of the 3rd ACM workshop on Wireless security. New York, NY: ACM, pp. 1-10. 10.1145/1023646.1023648

Preview

PDF Download (312kB) | Preview

Abstract

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.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	ACM
ISBN:	158113925X
Related URLs:	Organisation
Last Modified:	21 Oct 2022 09:50
URI:	https://orca.cardiff.ac.uk/id/eprint/37913

Citation Data

Cited 208 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item