IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i23p3640-d1525993.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Hui Zhao & Xiangmei Song, 2024. "TOAR: Toward Resisting AS-Level Adversary Correlation Attacks Optimal Anonymous Routing," Mathematics, MDPI, vol. 12(23), pages 1-20, November.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:23:p:3640-:d:1525993
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/23/3640/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/23/3640/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:23:p:3640-:d:1525993. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.