Prof. Dr. Konrad Rieck
Institute of Computer Science
University of Göttingen
Goldschmidtstraße 7
37077 Göttingen, Germany

About me

I am an Associate Professor of Computer Science at the University of Göttingen, where I am leading the Computer Security Group. Prior to taking this position, I have been working at Technische Universität Berlin and Fraunhofer Institute FIRST. I am a recipient of the CAST/GI Dissertation Award for Computer Security and a Google Faculty Research Award.

My research interests revolve around computer security and machine learning. This includes the detection of computer attacks, the analysis of malicious software, and the discovery of vulnerabilities. I am also interested in efficient algorithms for analyzing structured data, such as sequences, trees and graphs

I am very happy to work with a group of bright and passionate PhD students: Fabian Yamaguchi, Daniel Arp, Christian Wressnegger, and Hugo Gascon.

My Erdős number is 3 (Müller → Jagota → Erdős). My Bacon number is ∞, though. I am an academic relative of David Hilbert. He is my great great great grand-advisor.

Recent Publications

  1. Harry: A Tool for Measuring String Similarity.

    Konrad Rieck and Christian Wressnegger.

    Journal of Machine Learning Research (JMLR), to appear July 2015.
    abstract abstract

    Comparing strings and assessing their similarity is a basic operation in many application domains of machine learning, such as in information retrieval, natural language processing and bioinformatics. The practitioner can choose from a large variety of available similarity measures for this task, each emphasizing different aspects of the string data. In this article, we present Harry, a small tool specifically designed for measuring the similarity of strings. Harry implements over 20 similarity measures, including common string distances and string kernels, such as the Levenshtein distance and the Subsequence kernel. The tool has been designed with efficiency in mind and allows for multi-threaded as well as distributed computing, enabling the analysis of large data sets of strings. Harry supports common data formats and thus can interface with analysis environments, such as Matlab, Pylab and Weka.

  2. Automatic Inference of Search Patterns for Taint-Style Vulnerabilities.

    Fabian Yamaguchi, Alwin Maier, Hugo Gascon, and Konrad Rieck.

    Proc. of 36th IEEE Symposium on Security and Privacy (S&P), May 2015.
    abstract abstractpdf pdf

    Taint-style vulnerabilities are a persistent problem in software development, as the recently discovered “Heartbleed” vulnerability strikingly illustrates. In this class of vulnerabilities, attacker-controlled data is passed unsanitized from an input source to a sensitive sink. While simple instances of this vulnerability class can be detected automatically, more subtle defects involving data flow across several functions or project-specific APIs are mainly discovered by manual auditing. Different techniques have been proposed to accelerate this process by searching for typical patterns of vulnerable code. However, all of these approaches require a security expert to manually model and specify appropriate patterns in practice. In this paper, we propose a method for automatically inferring search patterns for taint-style vulnerabilities in C code. Given a security-sensitive sink, such as a memory function, our method automatically identifies corresponding source-sink systems and constructs patterns that model the data flow and sanitization in these systems. The inferred patterns are expressed as traversals in a code property graph and enable efficiently searching for unsanitized data flows—across several functions as well as with project-specific APIs. We demonstrate the efficacy of this approach in different experiments with 5 open-source projects. The inferred search patterns reduce the amount of code to inspect for finding known vulnerabilities by 94.4% and also enable us to uncover 8 previously unknown vulnerabilities.

  3. Torben: A Practical Side-Channel Attack for Deanonymizing Tor Communication.

    Daniel Arp, Fabian Yamaguchi, and Konrad Rieck.

    Proc. of 10th ACM Symposium on Information, Computer and Communications Security (ASIACCS), April 2015.
    abstract abstractpdf pdf

    The Tor network has established itself as de-facto standard for anonymous communication on the Internet, providing an increased level of privacy to over a million users worldwide. As a result, interest in the security of Tor is steadily growing, attracting researchers from academia as well as industry and even nation-state actors. While various attacks based on traffic analysis have been proposed, low accuracy and high false-positive rates in real-world settings still prohibit their application on a large scale. Instead, the few known cases of deanonymization have been reported to rely on vulnerabilities in browser implementations and cannot be considered weaknesses in Tor itself. In this paper, we present Torben, a novel deanonymization attack against Tor. Our approach is considerably more reliable than existing traffic analysis attacks, simultaneously far less intrusive than browser exploits. The attack is based on an unfortunate interplay of technologies: (a) web pages can be easily manipulated to load content from untrusted origins and (b) despite encryption low-latency anonymization networks cannot effectively hide the size of request-response pairs. We demonstrate that an attacker can abuse this interplay to design a side channel in the communication of Tor, allowing short web page markers to be transmitted and exposing the web page a user visits over Tor. In an empirical evaluation with 60,000 web pages, our attack enables detecting these markers with an accuracy of over 91% and no false positives.

  4. Modeling and Discovering Vulnerabilities with Code Property Graphs.

    Fabian Yamaguchi, Nico Golde, Daniel Arp, and Konrad Rieck.

    Proc. of 35th IEEE Symposium on Security and Privacy (S&P), 590–604, May 2014.
    abstract abstractpdf pdf

    The vast majority of security breaches encountered today are a direct result of insecure code. Consequently, the protection of computer systems critically depends on the rigorous identification of vulnerabilities in software, a tedious and error-prone process requiring significant expertise. Unfortunately, a single flaw suffices to undermine the security of a system and thus the sheer amount of code to audit plays into the attacker's cards. In this paper, we present a method for effectively mining large amounts of source code for vulnerabilities. To this end, we introduce a novel representation of source code called a code property graph that merges concepts of classic program analysis, namely abstract syntax trees, control flow graphs and program dependence graphs, into a joint data structure. This comprehensive representation enables us to elegantly model templates for common vulnerabilities with graph traversals that, for instance, can identify buffer overflows, integer overflows, format string vulnerabilities, or memory disclosures. We implement our approach using a popular graph database and demonstrate its efficacy by identifying 18 previously unknown vulnerabilities in the source code of the Linux kernel.

  5. Drebin: Efficient and Explainable Detection of Android Malware in Your Pocket.

    Daniel Arp, Michael Spreitzenbarth, Malte Hübner, Hugo Gascon, and Konrad Rieck.

    Proc. of 21st Network and Distributed System Security Symposium (NDSS), February 2014.
    abstract abstractpdf pdf

    Malicious applications pose a threat to the security of the Android platform. The growing amount and diversity of these applications render conventional defenses largely ineffective and Android smartphones often remain unprotected from novel malware. In this paper, we propose Drebin, a lightweight method for detection of Android malware that enables identifying malicious applications directly on the smartphone. As the limited resources impede monitoring applications at run-time, Drebin performs a broad static analysis, gathering as many features of an application as possible. These features are embedded in a joint vector space, such that typical patterns indicative for malware can be automatically identified and used for explaining the decisions of our method. In an evaluation with 123,453 applications and 5,560 malware samples Drebin outperforms several related approaches and detects 94% of the malware with few false alarms, where the explanations provided for each detection reveal relevant properties of the detected malware. On five popular smartphones, the method requires 10 seconds for an analysis on average, rendering it suitable for checking downloaded applications directly on the device.

See all publications.

Professional Activities

Editorial board of the Journal of Machine Learning Research (JMLR)
Guest editor of the special issue "Threat Detection, Analysis and Defense" in JISA
Steering committee of the GI SIG Intrusion Detection and Response (SIDAR)
Steering committee of the Conference on Detection of Intrusions and Malware (DIMVA)
Associate Member of the EU Network of Excellence SYSSEC

Conference and Workshop Organization
Program chair of the 10th Conference on Detection of Intrusions and Malware (DIMVA 2013)
General chair of the 6th European Conference on Computer Network Defense (EC2ND 2010)
Local organization of GI Graduate Workshop on Reactive Security (SPRING 2006)

Recent PC Memberships
2016: EUROS&P; SEC;

Reviewing for Journals

Whenever Possible
I am a member of "Verband der krawattenlosen Wissensträger" (VDKW)

See all community services.