TY - GEN A1 - Mitseva, Asya A1 - Panchenko, Andriy A1 - Lanze, Fabian A1 - Henze, Martin A1 - Engel, Thomas A1 - Wehrle, Klaus T1 - POSTER: Fingerprinting Tor Hidden Services T2 - In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (CCS '16). Association for Computing Machinery, New York, NY, USA Y1 - 2016 SN - 978-1-4503-4139-4 U6 - https://doi.org/10.1145/2976749.2989054 SP - 1766 EP - 1768 PB - ACM CY - New York ER - TY - CHAP A1 - Panchenko, Andriy A1 - Mitseva, Asya A1 - Henze, Martin A1 - Lanze, Fabian A1 - Engel, Thomas A1 - Wehrle, Klaus T1 - Analysis of Fingerprinting Techniques for Tor Hidden Services T2 - WPES '17 Proceedings of the 2017 on Workshop on Privacy in the Electronic Society, Dallas, Texas, USA, October 2017 Y1 - 2017 SN - 978-1-4503-5175-1 U6 - https://doi.org/10.1145/3139550.3139564 SP - 165 EP - 175 PB - ACM CY - New York, NY ER - TY - GEN A1 - Mitseva, Asya A1 - Panchenko, Andriy A1 - Engel, Thomas T1 - The state of affairs in BGP security: A survey of attacks and defenses T2 - Computer Communications Y1 - 2018 U6 - https://doi.org/10.1016/j.comcom.2018.04.013 SN - 0140-3664 VL - 124 SP - 45 EP - 60 ER - TY - GEN A1 - Pennekamp, Jan A1 - Hiller, Jens A1 - Reuter, Sebastian A1 - De la Cadena, Wladimir A1 - Mitseva, Asya A1 - Henze, Martin A1 - Engel, Thomas A1 - Wehrle, Klaus A1 - Panchenko, Andriy T1 - Multipathing Traffic to Reduce Entry Node Exposure in Onion Routing T2 - Proceedings of the 27th annual IEEE International Conference on Network Protocols (Poster) (IEEE ICNP 2019), Chicago, Illinois, USA, October 2019 N2 - Users of an onion routing network, such as Tor, depend on its anonymity properties. However, especially malicious entry nodes, which know the client’s identity, can also observe the whole communication on their link to the client and, thus, conduct several de-anonymization attacks. To limit this exposure and to impede corresponding attacks, we propose to multipath traffic between the client and the middle node to reduce the information an attacker can obtain at a single vantage point. To facilitate the deployment, only clients and selected middle nodes need to implement our approach, which works transparently for the remaining legacy nodes. Furthermore, we let clients control the splitting strategy to prevent any external manipulation. Y1 - 2019 UR - https://ieeexplore.ieee.org/document/8888029 SN - 978-1-7281-2700-2 SN - 978-1-7281-2701-9 U6 - https://doi.org/10.1109/ICNP.2019.8888029 SN - 2643-3303 SN - 1092-1648 PB - IEEE Press ER - TY - GEN A1 - De La Cadena, Wladimir A1 - Mitseva, Asya A1 - Pennekamp, Jan A1 - Hiller, Jens A1 - Lanze, Fabian A1 - Engel, Thomas A1 - Wehrle, Klaus A1 - Panchenko, Andriy T1 - POSTER: Traffic Splitting to Counter Website Fingerprinting T2 - CCS '19 Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security , London, UK, November 11 - 15, 2019. N2 - Website fingerprinting (WFP) is a special type of traffic analysis, which aims to infer the websites visited by a user. Recent studies have shown that WFP targeting Tor users is notably more effective than previously expected. Concurrently, state-of-the-art defenses have been proven to be less effective. In response, we present a novel WFP defense that splits traffic over multiple entry nodes to limit the data a single malicious entry can use. Here, we explore several traffic-splitting strategies to distribute user traffic. We establish that our weighted random strategy dramatically reduces the accuracy from nearly 95% to less than 35% for four state-of-the-art WFP attacks without adding any artificial delays or dummy traffic. Y1 - 2019 UR - https://dl.acm.org/citation.cfm?doid=3319535.3363249 SN - 978-1-4503-6747-9 U6 - https://doi.org/10.1145/3319535.3363249 SP - 2533 EP - 2535 PB - ACM Press CY - New York ER - TY - GEN A1 - De la Cadena, Wladimir A1 - Kaiser, Daniel A1 - Mitseva, Asya A1 - Panchenko, Andriy A1 - Engel, Thomas ED - Foley, Simon N. T1 - Analysis of Multi-path Onion Routing-based Anonymization Networks T2 - Data and Applications Security and Privacy XXXIII : 33rd Annual IFIP WG 11.3 Conference, DBSec 2019, Charleston, SC, USA, July 15–17, 2019, Proceedings Y1 - 2019 UR - https://link.springer.com/book/10.1007%2F978-3-030-22479-0 SN - 978-3-030-22478-3 SN - 978-3-030-22479-0 U6 - https://doi.org/10.1007/978-3-030-22479-0_13 SN - 0302-9743 SN - 1611-3349 SP - 240 EP - 258 PB - Springer CY - Frankfurt am Main ER - TY - GEN A1 - Mitseva, Asya A1 - Engel, Thomas A1 - Panchenko, Andriy ED - Reinhardt, Delphine ED - Langweg, Hanno ED - Witt, Bernhard C. ED - Fischer, Mathias T1 - Analyzing PeerFlow - A Bandwidth Estimation System for Untrustworthy Environments T2 - Sicherheit 2020 : Sicherheit, Schutz und Zuverlässigkeit ; Konferenzband der 10. Jahrestagung des Fachbereichs Sicherheit der Gesellschaft für Informatik e.V. (GI) ; 17.- 20. März 2020 in Göttingen Y1 - 2020 SN - 978-3-88579-695-4 U6 - https://doi.org/10.18420/sicherheit2020_02 SP - 29 EP - 40 PB - Gesellschaft für Informatik CY - Bonn ER - TY - GEN A1 - Mitseva, Asya A1 - Aleksandrova, Marharyta A1 - Engel, Thomas A1 - Panchenko, Andriy T1 - Security and Performance Implications of BGP Rerouting-resistant Guard Selection Algorithms for Tor T2 - ICT Systems Security and Privacy Protection : 35th IFIP TC 11 International Conference, SEC 2020, Maribor, Slovenia, September 21–23, 2020 Y1 - 2020 SN - 978-3-030-58201-2 SN - 978-3-030-58200-5 U6 - https://doi.org/10.1007/978-3-030-58201-2_15 SN - 1868-4238 SN - 1868-422X SP - 219 EP - 233 PB - Springer CY - Cham ER - TY - GEN A1 - De la Cadena, Wladimir A1 - Mitseva, Asya A1 - Hiller, Jens A1 - Pennekamp, Jan A1 - Reuter, Sebastian A1 - Filter, Julian A1 - Engel, Thomas A1 - Wehrle, Klaus A1 - Panchenko, Andriy T1 - TrafficSliver: Fighting Website Fingerprinting Attacks with Traffic Splitting T2 - CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, October 2020 N2 - Website fingerprinting (WFP) aims to infer information about the content of encrypted and anonymized connections by observing patterns of data flows based on the size and direction of packets. By collecting traffic traces at a malicious Tor entry node — one of the weakest adversaries in the attacker model of Tor — a passive eavesdropper can leverage the captured meta-data to reveal the websites visited by a Tor user. As recently shown, WFP is significantly more effective and realistic than assumed. Concurrently, former WFP defenses are either infeasible for deployment in real-world settings or defend against specific WFP attacks only. To limit the exposure of Tor users to WFP, we propose novel lightweight WFP defenses, TrafficSliver, which successfully counter today’s WFP classifiers with reasonable bandwidth and latency overheads and, thus, make them attractive candidates for adoption in Tor. Through user-controlled splitting of traffic over multiple Tor entry nodes, TrafficSliver limits the data a single entry node can observe and distorts repeatable traffic patterns exploited by WFP attacks.We first propose a network-layer defense, in which we apply the concept of multipathing entirely within the Tor network. We show that our network-layer defense reduces the accuracy from more than 98% to less than 16% for all state-of-the-art WFP attacks without adding any artificial delays or dummy traffic. We further suggest an elegant client-side application-layer defense, which is independent of the underlying anonymization network. By sending single HTTP requests for different web objects over distinct Tor entry nodes, our application-layer defense reduces the detection rate of WFP classifiers by almost 50 percentage points. Although it offers lower protection than our network-layer defense, it provides a security boost at the cost of a very low implementation overhead and is fully compatible with today's Tor network. KW - Traffic Analysis KW - Website Fingerprinting KW - Privacy KW - Anonymous Communication KW - Onion Routing KW - Web Privacy Y1 - 2020 SN - 978-1-4503-7089-9 U6 - https://doi.org/10.1145/3372297.3423351 SP - 1971 EP - 1985 PB - Association for Computing Machinery CY - New York ER - TY - GEN A1 - Mitseva, Asya A1 - Pennekamp, Jan A1 - Lohmöller, Johannes A1 - Ziemann, Torsten A1 - Hoerchner, Carl A1 - Wehrle, Klaus A1 - Panchenko, Andriy T1 - POSTER: How Dangerous is My Click? Boosting Website Fingerprinting By Considering Sequences of Webpages T2 - Proceedings of the 28th ACM Conference on Computer and Communications Security (ACM CCS 2021), Seoul, Virtual Event, South Korea, November 2021 Y1 - 2021 SN - 978-1-4503-8454-4 U6 - https://doi.org/10.1145/3460120.3485347 SP - 2411 EP - 2413 PB - ACM Press CY - New York ER - TY - GEN A1 - Panchenko, Andriy A1 - Mitseva, Asya A1 - Knabe, Sara T1 - WhisperChord: Scalable and Secure Node Discovery for Overlay Networks T2 - IEEE 46th Conference on Local Computer Networks (LCN), Edmonton, AB, Canada , 4-7 Oct. 2021 N2 - Node discovery is a fundamental service for any overlay network, including anonymization networks. Although anonymization and node discovery are two disjoint services, the node discovery has a direct impact on the anonymization. Centralized methods require a trusted third party, limit the network scalability, and are vulnerable to intersection (statistical disclosure) attacks. Therefore, several distributed node discovery methods were proposed to meet the security requirements of anonymization networks through additional structures within Distributed Hash Tables (DHTs). However, they require a high management overhead, a strict cooperation between nodes, and are susceptible to active and passive attacks.We propose WhisperChord—an alternative distributed node discovery approach, which incorporates gossiping into structured overlays. WhisperChord is based on a Chord DHT and neither creates any additional structures within the DHT nor requires any trusted third party. Via simulations, we show that our method provides superior protection against active attacks than prior methods and can effectively thwart information leakages. Y1 - 2021 SN - 978-1-6654-1886-7 SN - 978-1-6654-4800-0 U6 - https://doi.org/10.1109/LCN52139.2021.9525008 SN - 0742-1303 SP - 170 EP - 177 PB - IEEE ER - TY - GEN A1 - Panchenko, Andriy A1 - Mitseva, Asya A1 - Ziemann, Torsten A1 - Hering, Till T1 - GuardedGossip: Secure and Anonymous Node Discovery in Untrustworthy Networks T2 - Security and Privacy in Communication Networks : 17th EAI International Conference, SecureComm 2021, Virtual Event, September 6–9, 2021, Proceedings, Part I N2 - Node discovery is a fundamental service for any overlay network. It is a particular challenge to provide unbiased discovery in untrustworthy environments, e.g., anonymization networks. Although a major line of research focused on solving this problem, proposed methods have been shown to be vulnerable either to active attacks or to leak routing information, both threatening the anonymity of users. In response, we propose GuardedGossip—a novel gossip-based node discovery protocol—that achieves an unbiased random node discovery in a fully-decentralized and highly-scalable fashion. It is built on top of a Chord distributed hash table (DHT) and relies on witness nodes and bound checks to resist active attacks. To limit routing information leakages, GuardedGossip uses gossiping to create uncertainty in the process of node discovery. By incorporating the principles of DHTs with the unstructured nature of gossiping in a subtle way, we profit from the strengths of both techniques while carefully mitigating their shortcomings. We show that GuardedGossip provides a sufficient level of security for users even if 20% of the participating nodes are malicious. Concurrently, our system scales gracefully and provides an adequate overhead for its security and privacy benefits. KW - Node lookup KW - DHT KW - Tor KW - Onion routing KW - Anonymity Y1 - 2021 SN - 978-3-030-90018-2 U6 - https://doi.org/10.1007/978-3-030-90019-9_7 SN - 1867-8211 SP - 123 EP - 143 PB - Springer CY - Cham ER - TY - GEN A1 - Mitseva, Asya A1 - Panchenko, Andriy T1 - Stop, don't click here anymore: boosting website fingerprinting by considering sets of subpages T2 - Proceedings of the 33rd USENIX Security Symposium (USENIX Sec 2024), Philadelphia, PA, USA, August 14-16, 2024 N2 - A type of traffic analysis, website fingerprinting (WFP), aims to reveal the website a user visits over an encrypted and anonymized connection by observing and analyzing data flow patterns. Its efficiency against anonymization networks such as Tor has been widely studied, resulting in methods that have steadily increased in both complexity and power. While modern WFP attacks have proven to be highly accurate in laboratory settings, their real-world feasibility is highly debated. These attacks also exclude valuable information by ignoring typical user browsing behavior: users often visit multiple pages of a single website sequentially, e.g., by following links. In this paper, we aim to provide a more realistic assessment of the degree to which Tor users are exposed to WFP. We propose both a novel WFP attack and efficient strategies for adapting existing methods to account for sequential visits of pages within a website. While existing WFP attacks fail to detect almost any website in real-world settings, our novel methods achieve F1-scores of 1.0 for more than half of the target websites. Our attacks remain robust against state-of- the-art WFP defenses, achieving 2.5 to 5 times the accuracy of prior work, and in some cases even rendering the defenses useless. Our methods enable to estimate and to communicate to the user the risk of successive page visits within a website (even in the presence of noise pages) to stop before the WFP attack reaches a critical level of confidence. Y1 - 2024 UR - https://www.usenix.org/system/files/usenixsecurity24-mitseva.pdf UR - https://dblp.org/rec/conf/uss/Mitseva024.html SN - 978-1-939133-44-1 SP - 4139 EP - 4156 ER - TY - GEN A1 - Mitseva, Asya A1 - Alexandrova, Marharyta A1 - Panchenko, Andriy T1 - Security and Performance Implications of BGP Rerouting-resistant Guard Selection Algorithms for Tor T2 - Computers and Security N2 - Tor is the most popular anonymization network with millions of daily users. This makes it an attractive target for attacks, e.g., by malicious autonomous systems (ASs) performing active routing attacks to become man in the middle and deanonymize users. It was shown that the number of such malicious ASs is significantly larger than previously expected due to the lack of security guarantees in the Border Gateway Protocol (BGP). In response, recent works suggest alternative Tor path selection methods preferring Tor nodes with higher resilience to active BGP attacks. In this work, we analyze the implications of such proposals and demonstrate that two state-of-the-art path selection methods, namely Counter-RAPTOR and DPSelect, are not as secure as thought before. First, we show that DPSelect achieves only one third of its originally claimed resilience and, thus, is not as resilient as widely accepted. Second, we reveal that the resilience to active BGP attacks on the way back, i.e., from the first anonymization node to a given Tor user, provided by both methods is significantly lower than on the forward path. Beside their lower resilience in specific cases, we show that for particular users the usage of Counter-RAPTOR and DPSelect also leads to leakage of user’s location. Furthermore, we uncover the performance implications of both methods and identify scenarios where their usage leads to significant performance bottlenecks. Finally, we propose a new metric to quantify the user’s location leakage by path selection. Using this metric and performing large-scale analysis, we show to which extent a malicious Tor middle node can fingerprint the user’s location and the confidence it can achieve. Our findings shed light on the implications of path selection methods on the users’ anonymity and the need for further research. KW - BGP routing attacks KW - Tor KW - Onion routing KW - Privacy KW - Traffic analysis Y1 - 2023 U6 - https://doi.org/10.1016/j.cose.2023.103374 SN - 1872-6208 SN - 0167-4048 VL - 132 ER - TY - GEN A1 - Mitseva, Asya A1 - Thierse, Paul A1 - Hoffmann, Harald A1 - Er, Devran A1 - Panchenko, Andriy ED - Katsikas, Sokratis T1 - Challenges and Pitfalls in Generating Representative ICS Datasets in Cyber Security Research T2 - Computer Security, ESORICS 2022 International Workshops CyberICPS 2022, SECPRE 2022, SPOSE 2022, CPS4CIP 2022, CDT&SECOMANE 2022, EIS 2022, and SecAssure 2022 Copenhagen, Denmark, September 26–30, 2022, Revised Selected Papers Y1 - 2023 SN - 978-3-031-25459-8 SN - 978-3-031-25460-4 U6 - https://doi.org/10.1007/978-3-031-25460-4_22 SP - 379 EP - 397 PB - Springer International Publishing CY - Cham ER - TY - THES A1 - Mitseva, Asya T1 - State of affairs in online user privacy : assessing real-world user information leakages and designing effective and practical countermeasures T1 - Aktueller Stand der Privatsphäre von Internetnutzern : Bewertung realer Datenlecks und Entwicklung wirksamer und praktischer Gegenmaßnahmen N2 - The Tor network ensures confidentiality of user data over the Internet and hides the IP addresses and relationships between communication partners to avoid user profiling and censorship. However, Tor cannot hide the number, direction, and timing of transmitted packets. Two types of attackers – autonomous systems (AS) and malicious Tor nodes – can exploit this for sophisticated attacks, such as website fingerprinting (WFP) and end-to-end traffic correlation, or fingerprinting attacks revealing the Tor users’ location. On the other hand, in case of a malicious first Tor node or a malicious AS on the path between the user and the Tor network, the scalability of prior WFP attacks remains questionable due to impractical assumptions. This dissertation aims to provide a more realistic assessment of the exposure of Tor users to passive deanonymization attacks from different perspectives. First, we conduct a comprehensive review of fundamental Border Gateway Protocol (BGP) threats. We present a methodology for evaluating existing BGP security proposals and provide an extensive and up-to-date survey of proposals intended to make BGP secure and methods for detecting and mitigating routing instabilities. Based on the identified research gaps and unresolved challenges, we analyze the current level of resilience of Tor and two alternative Tor path selection methods against malicious ASs. While we detect a notable increase in the Tor’s resilience to BGP attacks over the years, when measured from a Tor user to its first Tor node, the resilience provided by the alternative path selection methods on the way back, i.e., from the first Tor node to a Tor user, has decreased notably compared to the resilience measured on the forward path for these methods. Moreover, these methods tend to select first Tor nodes in a predictable manner, resulting in the exposure of users’ locations to Tor middle nodes. We also show novel attacks against a state-of-the-art method for measuring bandwidth capabilities of Tor nodes, allowing a low-bandwidth attacker to gain notably higher bandwidth estimates than theoretically defined. We propose a novel lightweight defense against malicious Tor nodes, performing WFP or end-to-end traffic correlation, that splits user traffic over multiple Tor paths. Our defense is fully implemented on the user side, reducing deployment costs and making it independent of the underlying anonymization network. We also propose a metric that is capable of quantifying the user’s location leakage considering a malicious Tor middle node. This metric enables Tor users to avoid specific first Tor nodes by strategically selecting those from which their location cannot be revealed. Finally, we examine the real-world scalability of WFP, especially against Tor users who visit several pages of a single website consecutively. We propose both a novel WFP attack and efficient strategies for adapting existing methods to account for sequential visits of pages within a website. KW - Anonyme Kommunikation KW - Border Gateway Protocol (BGP KW - Datenschutz im Internet KW - Datenverkehrsanalyse KW - Onion routing; Tor network KW - Traffic analysis KW - Website fingerprinting KW - Website fingerprinting defenses Y1 - 2025 U6 - https://doi.org/10.26127/BTUOpen-7214 PB - Brandenburgische Technische Universität CY - Cottbus-Senftenberg ER - TY - GEN A1 - Mitseva, Asya A1 - Lewandowsky, Marco A1 - Panchenko, Andriy T1 - Poster: characterization of dominant and specific network patterns in industrial control systems T2 - 2025 23rd International Symposium on Network Computing and Applications (NCA) N2 - The increasing digitization and interconnection of Industrial Control Systems (ICS) to the Internet render them susceptible to cyber attacks. Thus, a major line of research focuses on the design of reactive security solutions in the form of industrial intrusion detection systems, which aim to detect anomalies in a normal system operation. However, a crucial prerequisite for the accurate detection and localization of anomalies is the identification of typical traffic patterns that are exclusive to characterize the normal ICS behavior. Unlike previous work focusing on complex and protocol-dependent models, for characterizing ICS network traffic, in this work we propose simple, easy deployable, and effective rules for determining whether ICS network traffic, unlike traditional IT networks, remains stable over time. The main advantage of our rules is that they can be used to estimate the time required to identify the most dominant ICS traffic patterns in a given ICS. We show the efficacy of our rules by analyzing multiple ICS datasets with different industrial network protocols. KW - Industrial Control Systems KW - Traffic Patterns Y1 - 2025 SN - 979-8-3315-7842-8 U6 - https://doi.org/10.1109/NCA67271.2025.00059 SP - 314 EP - 315 PB - IEEE CY - Piscataway, NJ ER - TY - GEN A1 - Mitseva, Asya A1 - Lewandowsky, Marco A1 - Panchenko, Andriy ED - Skwarek, Volker ED - Wöhnert, Kai Hendrik ED - Kaven, Sascha ED - Wendzel, Steffen T1 - Whitelisting als Allheilmittel : über die Grenzen der Anomalieerkennung in industriellen Steuerungssystemen T2 - Sicherheit 2026 : Sicherheit, Schutz und Zuverlässigkeit, 17.-19. März 2026, Hamburg : proceedings N2 - Die zunehmende Digitalisierung und Vernetzung industrieller Steuerungssysteme mit dem Internet macht diese anfällig für Cyberangriffe. Ein zentraler Forschungsbereich konzentriert sich daher auf die Entwicklung reaktiver Sicherheitsmechanismen in Form industrieller Intrusion-Detection-Systeme (IIDS), die darauf ausgelegt sind, Anomalien im normalen Systembetrieb zu erkennen. Eine entscheidende Voraussetzung hierfür ist die Identifizierung typischer Verkehrsmuster, die ausschließlich für das normale Verhalten industrieller Steuerungssysteme charakteristisch sind. Im Gegensatz zu früheren Arbeiten, die sich auf komplexe und protokollabhängige Modelle zur Charakterisierung des Netzwerkverkehrs industrieller Steuerungssysteme konzentrierten, schlagen wir in dieser Arbeit einfache, leicht umsetzbare und effektive Regeln vor, um zu ermitteln, ob der Netzwerkverkehr in Industrieanlagen – im Gegensatz zu herkömmlichen IT-Netzwerken – über einen längeren Zeitraum stabil bleibt. Anhand der Analyse mehrerer Datensätze aus nachgebildeten und realen industriellen Steuerungssystemen mit unterschiedlichen industriellen Netzwerkprotokollen zeigen wir, dass aufbauend auf diesen Regeln bereits nach kurzer Beobachtungszeit hinreichend prägnante Muster extrahiert werden können, mit deren Hilfe es möglich ist, gängige Verkehrsveränderungen durch Netzverkehrsangriffe zu erkennen. Dieser Ansatz steht im Gegensatz zu herkömmlichen Machine-Learning-IIDS, die häufig einen beträchtlichen zeitlichen Aufwand für den Trainingsprozess erfordern. Somit stellen wir auch die Frage auf, inwieweit komplexe IIDS für den praktischen Betrieb tatsächlich unabdingbar sind. KW - Steuerungssysteme KW - Datenverkehrsmuster KW - Datensätze KW - Intrusion-Detection-Systeme Y1 - 2026 UR - https://dl.gi.de/items/7b5e1e96-dad3-4843-aca7-77593cd8ddde U6 - https://doi.org/10.18420/sicherheit2026_09 SN - 2944-7682 SP - 103 EP - 114 PB - Gesellschaft für Informatik CY - Bonn ER -