Aggregating Local Metrics for Global Trust Calculations in the TOR Network

Nada M. Abdel Aziem, S. Fahmy, Attallah I. Hashad
{"title":"Aggregating Local Metrics for Global Trust Calculations in the TOR Network","authors":"Nada M. Abdel Aziem, S. Fahmy, Attallah I. Hashad","doi":"10.1109/ICCTA35431.2014.9521619","DOIUrl":null,"url":null,"abstract":"This paper discusses the design and implementation of a distributed trust calculation mechanism that allows users in the peer-to-peer TOR anonymity network to determine whether or not the nodes that comprise the TOR network are malicious. This is done through a cooperative algorithm that allows individual nodes to measure the trust of the TOR nodes they communicate with. The paper measures the performance of this algorithm and shows that the algorithm can accurately identify several kinds of malicious nodes in the TOR network. This paper will focus on the following security issues: the problem of self reported bandwidth and uptime that can lead to low resource attack, geographical location and Denial of service (DoS) attack and how to aggregate all these criteria in one value that indicate whether or not the onion router is malicious. The aggregation is performed using two different techniques, each of which uses the exact same aggregation methods except for geographical location. The first method, which excludes entire geographical locations, produced slightly worse results than the second method, which assigned a scale between 0 and 0.99 for each geographical location to signify its trust","PeriodicalId":162170,"journal":{"name":"2014 24th International Conference on Computer Theory and Applications (ICCTA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 24th International Conference on Computer Theory and Applications (ICCTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTA35431.2014.9521619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper discusses the design and implementation of a distributed trust calculation mechanism that allows users in the peer-to-peer TOR anonymity network to determine whether or not the nodes that comprise the TOR network are malicious. This is done through a cooperative algorithm that allows individual nodes to measure the trust of the TOR nodes they communicate with. The paper measures the performance of this algorithm and shows that the algorithm can accurately identify several kinds of malicious nodes in the TOR network. This paper will focus on the following security issues: the problem of self reported bandwidth and uptime that can lead to low resource attack, geographical location and Denial of service (DoS) attack and how to aggregate all these criteria in one value that indicate whether or not the onion router is malicious. The aggregation is performed using two different techniques, each of which uses the exact same aggregation methods except for geographical location. The first method, which excludes entire geographical locations, produced slightly worse results than the second method, which assigned a scale between 0 and 0.99 for each geographical location to signify its trust
基于聚合局部度量的TOR网络全局信任计算
本文讨论了一种分布式信任计算机制的设计和实现,该机制允许点对点TOR匿名网络中的用户确定组成TOR网络的节点是否恶意。这是通过一种协作算法完成的,该算法允许单个节点衡量与它们通信的TOR节点的信任。本文对该算法的性能进行了测试,结果表明该算法能够准确地识别出TOR网络中的几种恶意节点。本文将重点关注以下安全问题:可能导致低资源攻击的自我报告带宽和正常运行时间问题,地理位置和拒绝服务(DoS)攻击,以及如何将所有这些标准聚合在一个值中,以指示洋葱路由器是否恶意。聚合是使用两种不同的技术执行的,除了地理位置不同,每种技术都使用完全相同的聚合方法。第一种方法排除了整个地理位置,其结果比第二种方法略差。第二种方法为每个地理位置分配了0到0.99之间的刻度,以表示其信任度
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信