Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dominik Schatzmann

dblp:26/303 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 1 first-authorSecurity and privacy · 4 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Network measurement and analytics · 70% Network management and operations · 30%
Network and information security
2 papers
Cryptographic protocols and secure computation · 84% Network security · 16%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
secure multiparty computation
0.212013
Federated flow-based approach for privacy preserving connectivity tracking · CoNEXT 2013
Network measurement and analytics › traffic classification
application identification
0.112010
Digging into HTTPS: flow-based classification of webmail traffic · Internet Measurement Conference 2010
Network measurement and analytics › traffic classification
encrypted traffic classification
0.112010
Digging into HTTPS: flow-based classification of webmail traffic · Internet Measurement Conference 2010
Network measurement and analytics
traffic classification
0.112010
Digging into HTTPS: flow-based classification of webmail traffic · Internet Measurement Conference 2010
Network measurement and analytics › traffic measurement
traffic monitoring
0.012013
Federated flow-based approach for privacy preserving connectivity tracking · CoNEXT 2013
Network security
traffic analysis
0.012010
Digging into HTTPS: flow-based classification of webmail traffic · Internet Measurement Conference 2010

Methods — techniques the papers use, named apart from their topics

secure multiparty computation · 0.3counting bloom filter · 0.3flow-based classification · 0.2feature engineering · 0.2
YearPublicationVenuePosition
2014 Network anomaly detection in the cloud: The challenges of virtual service migration
abstract
The use of virtualisation technology in the cloud enables services to migrate within and across geographically diverse data centres, e.g., to enable load balancing and fault tolerance. An important part of securing cloud services is being able to detect anomalous behaviour, caused by attacks, that is evident in network traffic. However, it is not clear whether virtual service migration adversely affects the performance of contemporary network-based anomaly detection approaches. In this paper, we explore this issue, and show that wide-area virtual service migration can adversely affect state of the art approaches to network flow-based anomaly detection techniques, potentially rendering them unusable.
Kirila Adamova, Dominik Schatzmann, Bernhard Plattner, Paul Smith 0001
ICC2
2013 Horizon extender: long-term preservation of data leakage evidence in web traffic
abstract
This paper presents Horizon Extender, a system for long-term preservation of data leakage evidence in enterprise networks. In contrast to classical network intrusion detection systems that keep only packet records of suspicious traffic (black-listing), Horizon Extender reduces the total size of captured network traces by filtering out all records that do not reveal potential evidence about leaked data (white-listing). Horizon Extender has been designed to exploit the inherent redundancy and adherence to protocol specification of general Web traffic. We show in a real-life network including more than 1000 active hosts that Horizon Extender is able to reduce the total HTTP volume by 99.8%, or the outgoing volume by 90.9% to 93.9%, while preserving sufficient evidence to recover retrospectively time, end point identity, and content of information leaked over the HTTP communication channel.
David Gugelmann, Dominik Schatzmann, Vincent Lenders
AsiaCCS2
2013 Federated flow-based approach for privacy preserving connectivity tracking
abstract
Network outages are an important issue for Internet Service Providers (ISPs) and, more generally, online service providers, as they can result in major financial losses and negatively impact relationships with their customers. Troubleshooting network outages is a complex and time-consuming process. Network administrators are overwhelmed with large volumes of monitoring data and are limited to using very basic tools for debugging, e.g., ping and traceroute. Intelligent correlation of measurements from different Internet locations is very useful for analyzing the root cause of outages. However, correlating measurements of user traffic across domains is largely avoided as it raises privacy concerns. A possible solution is secure multi-party computation (MPC), a set of cryptographic methods that enable a number of parties to aggregate data in a privacy-preserving manner. In this work, we describe a novel system that helps diagnose network outages by correlating passive measurements from multiple ISPs in a privacy-preserving manner. We first show how MPC can be used to compute the scope (local, global, or semi-global) and severity (number of affected hosts) of network outages. To meet near-real-time monitoring guarantees, we then present an efficient protocol for MPC multiset union that uses counting Bloom filters (CBF) to drastically accelerate MPC comparison operations. Finally, we demonstrate the utility of our scheme using real-world traffic measurements from a national ISP and we discuss the trade-offs of the CBF-based computation.
Mentari Djatmiko, Dominik Schatzmann, Xenofontas A. Dimitropoulos, Arik Friedman, Roksana Boreli
CoNEXT2
2011 A tale of two outages: A study of the Skype network in distress
abstract
This work applies snack, a flow-based algorithm for detecting connections between clients and supernodes to the Skype network, to the study of two separate outages on the Skype network in August 2007 and December 2010. We examine both outages in detail, comparing them to each other, and to previous work on the first outage. We find that a simple metric derived from connection events per unique client as measured by snack acts as a proxy for the Skype network, and would have provided forewarning of the 2007 outage, and may have applicability as an indicator of general Skype network health. We also examine the faster onset of and recovery from the 2010 outage, discovering that the distribution of clients per supernode is a proxy measurement for network centralization, and detects the apparent present recovery strategy from such outages. These two metrics may be applied by any network operator to monitor the health of the Skype network.
Brian Trammell, Dominik Schatzmann
IWCMC2
2011 FACT: Flow-Based Approach for Connectivity Tracking
Dominik Schatzmann, Simon Leinen, Jochen Kögel, Wolfgang Mühlbauer
PAM1
2011 Peeling Away Timing Error in NetFlow Data
Brian Trammell, Bernhard Tellenbach, Dominik Schatzmann, Martin Burkhart
PAM3
2011 Accurate network anomaly classification with generalized entropy metrics
Bernhard Tellenbach, Martin Burkhart, Dominik Schatzmann, David Gugelmann, Didier Sornette
Comput. Networks3
2010 Digging into HTTPS: flow-based classification of webmail traffic
abstract
Recently, webmail interfaces, e.g., Horde, Outlook Web Access, and webmail platforms such as GMail, Yahoo!, and Hotmail have seen a tremendous boost in popularity. Given the importance of e-mail for personal and business use alike, and its exposure to imminent threats, there exists the need for a comprehensive view of the Internet mail system, including webmail traffic. We, in this paper, propose a novel, passive approach to identify webmail traffic solely based on network-level data in order to obtain a comprehensive view of the mail system. Key to our approach is that we leverage correlations across protocols and time to introduce three novel features for HTTPS webmail classification. Our first feature is based on the finding that webmail servers tend to reside close to legacy mail servers, e.g. IMAP and POP, which can be easily identified. Our second feature leverages that the usage of webmail services results in distinct patterns on sessions' duration and on the diurnal/weekly traffic usage profile. In addition, our third feature exploits the observation that traffic flows to webmail platforms exhibit inherent periodicities due to the fact that AJAX-based clients periodically check for new messages. We use these three features to build a simple classifier and detect webmail traffic on real-world NetFlow traces from a medium-sized backbone network. We believe that the major contribution of this paper -- exploring a set of new features that could classify applications that run over HTTPS ports solely based on NetFlow data -- will stimulate more general advance in the field of traffic classification.
Dominik Schatzmann, Wolfgang Mühlbauer, Thrasyvoulos Spyropoulos, Xenofontas A. Dimitropoulos
Internet Measurement Conference1
2009 Inferring Spammers in the Network Core
Dominik Schatzmann, Martin Burkhart, Thrasyvoulos Spyropoulos
PAM1