TOAR: Toward Resisting AS-Level Adversary Correlation Attacks Optimal Anonymous Routing

Hui Zhao and Xiangmei Song ()
Additional contact information
Hui Zhao: School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang 212013, China
Xiangmei Song: School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang 212013, China

Mathematics, 2024, vol. 12, issue 23, 1-20

Abstract: The Onion Router (Tor), as the most widely used anonymous network, is vulnerable to traffic correlation attacks by powerful passive adversaries, such as Autonomous Systems (AS). AS-level adversaries increase their chances of executing correlation attacks by manipulating the underlying routing, thereby compromising anonymity. Furthermore, these underlying routing detours in the Tor client’s routing inference introduce extra latency. To address this challenge, we propose Toward Resisting AS-level Adversary Correlation Attacks Optimal Anonymous Routing (TOAR). TOAR is a two-stage routing mechanism based on Bayesian optimization within Software Defined Networks (SDN), comprising route search and route forwarding. Specifically, it searches for routes that conform to established policies, avoiding AS that could connect traffic between clients and destinations while maintaining anonymity in the selection of routes that minimize communication costs. To evaluate the anonymity of TOAR, as well as the effectiveness of route searching and the performance of route forwarding, we conduct a detailed analysis and extensive experiments. The analysis and experimental results show that the probability of routing being compromised by correlation attacks is significantly reduced. Compared to classical enumeration-based methods, the success rate of route searching increased by close to 2.5 times, and the forwarding throughput reached 70% of that of the packet transmission. The results show that TOAR effectively improves anonymity while maintaining communication quality, minimizing anonymity loss from AS-level adversaries and reducing high latency from routing detours.

Keywords: anonymous routing; Bayesian optimization; correlation attacks; Software Defined Network (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/23/3640/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/23/3640/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:23:p:3640-:d:1525993

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().