Progressive Pruning: Analyzing the Impact of Intersection Attacks

• URL: http://arxiv.org/abs/2410.08700v2
• Date: Mon, 21 Apr 2025 17:06:04 GMT
• Title: Progressive Pruning: Analyzing the Impact of Intersection Attacks
• Authors: Christoph Döpmann, Maximilian Weisenseel, Florian Tschorsch,
• Abstract summary: Stream-based communication poses unique challenges for anonymous communication networks (ACNs)<n>Traditionally designed for independent messages, ACNs struggle to account for the inherent vulnerabilities of streams.<n>We introduce progressive pruning, a novel methodology for quantifying the susceptibility to intersection attacks.
• Score: 1.8434042562191815
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Stream-based communication dominates today's Internet, posing unique challenges for anonymous communication networks (ACNs). Traditionally designed for independent messages, ACNs struggle to account for the inherent vulnerabilities of streams, such as susceptibility to intersection attacks. In this work, we address this gap and introduce progressive pruning, a novel methodology for quantifying the susceptibility to intersection attacks. Progressive pruning quantifies and monitors anonymity sets over time, providing an assessment of an adversary's success in correlating senders and receivers. We leverage this methodology to analyze synthetic scenarios and large-scale simulations of the Tor network using our newly developed TorFS simulator. Our findings reveal that anonymity is significantly influenced by stream length, user population, and stream distribution across the network. These insights highlight critical design challenges for future ACNs seeking to safeguard stream-based communication against traffic analysis attacks.

Related papers

• RevealNet: Distributed Traffic Correlation for Attack Attribution on Programmable Networks [3.351939661661333]
  RevealNet is a decentralized framework for attack attribution. It orchestrates a fleet of P4-programmable switches to perform traffic correlation. Our evaluation suggests that RevealNet achieves comparable accuracy to centralized attack attribution systems.
  arXiv  Detail & Related papers  (2025-05-01T15:48:35Z)
• Early-MFC: Enhanced Flow Correlation Attacks on Tor via Multi-view Triplet Networks with Early Network Traffic [1.7244120238071496]
  We propose flow correlation attack with early network traffic, named Early-MFC, based on multi-view triplet networks. The proposed approach extracts multi-view traffic features from the payload at the transport layer and the Inter-Packet Delay. It then integrates multi-view flow information, converting the extracted features into shared embeddings.
  arXiv  Detail & Related papers  (2025-03-21T04:36:51Z)
• AI Flow at the Network Edge [58.31090055138711]
  AI Flow is a framework that streamlines the inference process by jointly leveraging the heterogeneous resources available across devices, edge nodes, and cloud servers. This article serves as a position paper for identifying the motivation, challenges, and principles of AI Flow.
  arXiv  Detail & Related papers  (2024-11-19T12:51:17Z)
• Robust Utility-Preserving Text Anonymization Based on Large Language Models [80.5266278002083]
  Text anonymization is crucial for sharing sensitive data while maintaining privacy. Existing techniques face the emerging challenges of re-identification attack ability of Large Language Models. This paper proposes a framework composed of three LLM-based components -- a privacy evaluator, a utility evaluator, and an optimization component.
  arXiv  Detail & Related papers  (2024-07-16T14:28:56Z)
• Flash-VStream: Memory-Based Real-Time Understanding for Long Video Streams [78.72965584414368]
  We present Flash-VStream, a video-language model that simulates the memory mechanism of human. Compared to existing models, Flash-VStream achieves significant reductions in latency inference and VRAM consumption. We propose VStream-QA, a novel question answering benchmark specifically designed for online video streaming understanding.
  arXiv  Detail & Related papers  (2024-06-12T11:07:55Z)
• A Survey on Transferability of Adversarial Examples across Deep Neural Networks [53.04734042366312]
  adversarial examples can manipulate machine learning models into making erroneous predictions. The transferability of adversarial examples enables black-box attacks which circumvent the need for detailed knowledge of the target model. This survey explores the landscape of the adversarial transferability of adversarial examples.
  arXiv  Detail & Related papers  (2023-10-26T17:45:26Z)
• A Geometrical Approach to Evaluate the Adversarial Robustness of Deep Neural Networks [52.09243852066406]
  Adversarial Converging Time Score (ACTS) measures the converging time as an adversarial robustness metric. We validate the effectiveness and generalization of the proposed ACTS metric against different adversarial attacks on the large-scale ImageNet dataset.
  arXiv  Detail & Related papers  (2023-10-10T09:39:38Z)
• Breaking On-Chip Communication Anonymity using Flow Correlation Attacks [2.977255700811213]
  We investigate the security strength of existing anonymous routing protocols in Network-on-Chip (NoC) architectures. We show that the existing anonymous routing is vulnerable to machine learning (ML) based flow correlation attacks on NoCs. We propose lightweight anonymous routing with traffic obfuscation techniques to defend against ML-based flow correlation attacks.
  arXiv  Detail & Related papers  (2023-09-27T14:32:39Z)
• Efficient Network Representation for GNN-based Intrusion Detection [2.321323878201932]
  The last decades have seen a growth in the number of cyber-attacks with severe economic and privacy damages. We propose a novel network representation as a graph of flows that aims to provide relevant topological information for the intrusion detection task. We present a Graph Neural Network (GNN) based framework responsible for exploiting the proposed graph structure.
  arXiv  Detail & Related papers  (2023-09-11T16:10:12Z)
• Decentralized Learning over Wireless Networks: The Effect of Broadcast with Random Access [56.91063444859008]
  We investigate the impact of broadcast transmission and probabilistic random access policy on the convergence performance of D-SGD. Our results demonstrate that optimizing the access probability to maximize the expected number of successful links is a highly effective strategy for accelerating the system convergence.
  arXiv  Detail & Related papers  (2023-05-12T10:32:26Z)
• Message Passing Neural Networks for Traffic Forecasting [32.354251863295424]
  Traffic forecasting is interesting because it is complex as the future speed of a road is dependent on a number of different factors. Existing works fail to capture the inter-node interactions because none are using the message-passing flavor of GNN. Results from real-world data show the superiority of the message-passing flavor for traffic forecasting.
  arXiv  Detail & Related papers  (2023-05-09T19:33:52Z)
• Modelling Direct Messaging Networks with Multiple Recipients for Cyber Deception [13.447335354083666]
  We propose a framework to automate the generation of email and instant messaging-style group communications at scale. We address two key aspects of simulating this type of system: modelling when and with whom participants communicate, and generating topical, multi-party text to populate simulated conversation threads. We demonstrate the use of fine-tuned, pre-trained language models to generate convincing multi-party conversation threads.
  arXiv  Detail & Related papers  (2021-11-21T10:18:48Z)
• Streaming Belief Propagation for Community Detection [16.89299967467454]
  In real-world applications, the network structure is typically dynamic, with nodes that join over time. We introduce a simple model for networks growing over time which we refer to as streaming block model (StSBM) Within this model, we prove that voting algorithms have fundamental limitations. We also develop a streaming-propagation (StreamBP) approach, for which we prove optimality in certain regimes.
  arXiv  Detail & Related papers  (2021-06-09T04:36:09Z)
• Locate Who You Are: Matching Geo-location to Text for Anchor Link Prediction [40.654494490237]
  We propose a novel anchor link prediction framework for matching users across networks. Our approach outperforms existing methods and achieves state-of-the-art results.
  arXiv  Detail & Related papers  (2021-04-19T08:15:28Z)
• Measurement-driven Security Analysis of Imperceptible Impersonation Attacks [54.727945432381716]
  We study the exploitability of Deep Neural Network-based Face Recognition systems. We show that factors such as skin color, gender, and age, impact the ability to carry out an attack on a specific target victim. We also study the feasibility of constructing universal attacks that are robust to different poses or views of the attacker's face.
  arXiv  Detail & Related papers  (2020-08-26T19:27:27Z)
• Bridging Mode Connectivity in Loss Landscapes and Adversarial Robustness [97.67477497115163]
  We use mode connectivity to study the adversarial robustness of deep neural networks. Our experiments cover various types of adversarial attacks applied to different network architectures and datasets. Our results suggest that mode connectivity offers a holistic tool and practical means for evaluating and improving adversarial robustness.
  arXiv  Detail & Related papers  (2020-04-30T19:12:50Z)
• Transferable Perturbations of Deep Feature Distributions [102.94094966908916]
  This work presents a new adversarial attack based on the modeling and exploitation of class-wise and layer-wise deep feature distributions. We achieve state-of-the-art targeted blackbox transfer-based attack results for undefended ImageNet models.
  arXiv  Detail & Related papers  (2020-04-27T00:32:25Z)
• Adversarially Robust Streaming Algorithms via Differential Privacy [68.3608356069755]
  A streaming algorithm is said to be adversarially robust if its accuracy guarantees are maintained even when the data stream is chosen maliciously. We establish a connection between adversarial robustness of streaming algorithms and the notion of differential privacy.
  arXiv  Detail & Related papers  (2020-04-13T14:49:38Z)
• Blind Adversarial Network Perturbations [33.121816204736035]
  We show that an adversary can defeat traffic analysis techniques by applying emphadversarial perturbations on the patterns of emphlive network traffic.
  arXiv  Detail & Related papers  (2020-02-16T02:59:41Z)
• Distributed Learning in the Non-Convex World: From Batch to Streaming Data, and Beyond [73.03743482037378]
  Distributed learning has become a critical direction of the massively connected world envisioned by many. This article discusses four key elements of scalable distributed processing and real-time data computation problems. Practical issues and future research will also be discussed.
  arXiv  Detail & Related papers  (2020-01-14T14:11:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.