Skip to content
Open access

Optimizing multi-objective strategies for enhanced Tor De-anonymization

Jun 2026 · Cybersecurity · Vol 9 · 0 citations · 63 references
Computer Science

TL;DR

This work model joint node–technique selection as a tri-objective problem balancing attack gain (AP), attack impact (AI), and attack cost (AC) and selects a preference-aware compromise with VIKOR to support better de‑anonymization.

Abstract

Tor employs multi-layer encryption and three-hop circuits to provide low-latency anonymity. While indispensable for privacy, these same properties can also be misused to conceal illicit activity. This dual-use nature makes effective de‑anonymization essential under appropriate, policy-bounded oversight, so that harmful behavior can be uncovered without undermining legitimate use. Yet de‑anonymization is not free: taking nodes offline and deploying honeypots consumes significant resources, increases exposure, and risks degrading network availability. Prior work faces two limitations: (i) it decouples the choice of which node to target from which method to apply, overlooking their strong coupling; and (ii) it often evaluates effectiveness with narrow, single-effect proxies, neglecting collateral network impact and operational cost. To support better de‑anonymization, we model joint node–technique selection as a tri-objective problem balancing attack gain (AP), attack impact (AI), and attack cost(AC). For each feasible node–method pair we compute these three metrics, extract the Pareto set, prune with ϵ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\epsilon$$\end{document}-constraints, and select a preference-aware compromise with VIKOR. In a Docker-orchestrated testbed, this Pareto-first pipeline achieves about +50%\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$+50\%$$\end{document} higher attack gain and roughly -29%\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$-29\%$$\end{document} lower attack Impact and attack cost compared with random selection.

Read PDF

Similar papers

Conference Open access Jul 2026

REVS-T: Trust-Tier-Aware Provider Selection for Secure Vehicular Computation Offloading

Vehicular computation offloading (VCOff) enables resource-constrained vehicles to delegate delay-sensitive tasks to nearby providers. However, it remains vulnerable to strategic malicious nodes that withhold results, or behave intermittently to evade detection. Although reputation values evolve across repeated interact...

Sharifah Fayi, Ferheen Ayaz, Zhengguo Sheng · 0 citations
Conference Aug 2026

URP-FL: Robust and Personalized Federated Learning under Heterogeneous and Adversarial Conditions

Federated learning is appealing for privacy-sensitive network systems, yet its practical deployment remains hindered by the following three recurring challenges: (1) client drift under non-IID data, (2) vulnerability to corrupted updates, and (3) the communication cost of repeated model exchange. Most existing approach...

Hua Kun, Wei Wang · 0 citations
Conference Jul 2026

Multi-Objective Privacy-Preserving Function Placement in an Edge-Cloud FaaS Marketplace

The shift toward modular microservices has driven the success of serverless Function-as-a-Service (FaaS) as a way to offload infrastructure management. However, meeting the diverse needs of emerging applications—from ultra-low latency control to budget-constrained processing—requires FaaS to transcend centralized cloud...

Francesco Tusa, D. Griffin, Tamás Kiss et al. · 0 citations
Review 2026

Improving resistance to Sybil attacks in decentralized networks using the RTCT protocol

This paper proposes Random Time Challenge-Tokens (RTCT) as a mechanism to economically enforce honest participation and deter Sybil attacks at the network level, and shows that RTCT can exponentially increase an attacker’s costs with higher challenge difficulty, making networks more resilient.

I. Parkhomenko, Larysa Myrutenko, Roman Ohiievych et al. · 0 citations
Conference Open access Aug 2026

Bypassing Krum: Selection-Aware Backdoor Attacks in Federated Learning

The Krum-Proxy attack is introduced, a selection-aware backdoor injection strategy that consistently bypasses Byzantine-robust aggregation and constructs adversarial updates that are not only similar to benign updates but are also optimized to lie in regions of the update space that are favored during aggregation.

Srinivasan Subramanian, Md Abdullah Al Hafiz Khan, K. A. Islam · 0 citations
Conference Open access 2026

Adversarial Distance Metrics: A Threat to Fairness in Clustering-Based Decision Systems

An insider adversary manipulates the distance function to induce discriminatory clustering outcomes against demographic groups, exposing a gap in current fairness auditing practices and demonstrating the urgent need to expand the scope of the algorithmic audit to include distance-function verification.

Shahzad Ahmad, Stefan Rass, Enes Sovtic · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.