PhD thesis defenses are a public affair and open to anyone who is interested. Attending them is a great way to get to know the work going on by your peers in the various research groups. On this page you will find a list of upcoming and past defense talks.

Please go here for electronic access to most of the doctoral dissertations from Saarbrücken Computer Science going back to about 1990.

2025

May

Yiting QU
Mitigating Risks in Real-World and AI-Generated Visual Content
(Advisor: Prof. Michael Backes)
Thursday, 22.05.25 14:00h , building E9 1, room 0.01

Visual content, such as images and point clouds, is a fundamental medium in the digital age. However, visual content includes many unsafe, harmful, and unauthorized materials. The spread of such content has posed significant risks both to web communities and to the real world. For example, the dissemination of hateful memes could incite hatred against an ethnic group and even cause real-world harm. Although the advancement of artificial intelligence (AI) provides technical solutions for detecting this content, these technologies also have the potential to amplify these risks. In this dissertation, we investigate both real-world and AI-generated risks in visual content through four studies. Our studies highlight AI’s dual role: while it can help mitigate unsafe content, it also accelerates its creation at low cost. We call for collaborative efforts to address the risks posed by unsafe and unauthorized visual content, particularly those introduced by AI generative models.

Hendrik LEIDINGER
SCL(EQ): Simple Clause Learning in First-Order Logic with Equality
(Advisor: Prof. Christoph Weidenbach)
Wednesday, 21.05.25 12:00h , building E1 4, room 0.24

I propose the SCL(EQ) calculus that lifts SCL for first-order logic to first-order logic with equality. SCL(EQ) learns non-redundant clauses only. It builds a trail of annotated ground literals, representing the model assumption for non-ground input clauses. The trail includes propagations (inferred literals) and decisions (guessed literals). When a clause is false under the model assumption, SCL(EQ) derives a new non-ground clause via paramodulation. The new clause is nonredundant under a dynamic ordering, which, along with a maximum term, limits ground literals and ensures termination. I prove SCL(EQ) to be sound and refutationally complete.
SCL(EQ) may use congruence closure (CC) to identify propagations and conflicts efficiently. However, exhaustive propagation of unit clauses already causes a worst case exponential blowup in ground instances. To address this, I propose CC(X), a generalization of CC with variables. It creates an explicit representation of constrained congruence classes of the whole ground input space smaller than the maximum term. I prove CC(X) sound and complete, implement it, and evalu-ate its performance against state-of-the-art CC. Joint work with Yasmine Briefs integrates Knuth-Bendix ordering into CC(X).

Simon SPIES
Shaking Up the Foundations of Modern Separation Logic
(Advisor: Prof. Derek Dreyer)
Friday, 16.05.25 11:00h , building E1 5, room 029

The problem of how to scalably verify large, stateful programs is one of the oldest—and still unsolved—challenges of computer science. Over the last two decades, there has been considerable progress toward this goal with the advent of separation logic, a verification technique for modularly reasoning about stateful programs. While originally only devel-oped for imperative, pointer-manipulating programs, separation logic has in its modern form become an essential tool in the toolbox of the working semanticist for modeling programming languages and verifying programs.
With this thesis, I present a line of work that revisits the foundations of modern separa-tion logic in the context of the separation logic framework Iris. It targets two broader areas: step-indexing and automation. Step-indexing is a powerful technique for modeling many of the advanced, cyclic features of modern languages. Here, Transfinite Iris shows how to generalize step-indexing from proving safety properties to proving liveness properties, and Later Credits enable more flexible proof patterns for step-indexing based on separation logic resources. Automation, on the other hand, is important for reducing the overhead of verification to scale to larger code bases. Here, Quiver introduces a new form of guided specification inference to reduce the specification overhead of separation logic verification, and Daenerys develops new resources in Iris that lay the groundwork for automating parts of Iris proofs using SMT solvers.

Alexander RATH
How to Train Your Renderer: Optimized Methods for Learning Path Distributions in Monte Carlo Light Transport
(Advisor: Prof. Philipp Slusallek)
Tuesday, 06.05.25 10:00h , building D3 2, room -1.63

Light transport simulation allows us to preview architectural marvels before they break ground, practice complex surgeries without a living subject, and explore alien worlds from the comfort of our homes. Fueled by the steady advancements in computer hardware, rendering virtual scenes is more accessible than ever, and is met by an unprecedented demand for such content. Light interacts with our world in various intricate ways, hence the challenge in realistic rendering lies in tracing all the possible paths that light could take within a given virtual scene. Contemporary approaches predominantly rely on Monte Carlo integration, for which countless sampling procedures have been proposed to handle certain families of effects robustly. Handling all effects holistically through specialized sampling routines, however, remains an unsolved problem.
A promising alternative is to use learning techniques that automatically adapt to the effects present in the scene. However, such approaches require many complex design choices to be made, which existing works commonly resort to heuristics for. In this work, we investigate what constitutes effective learning algorithms for rendering – from data representation and the quantities to be learned, to the fitting process itself. By strategically optimizing these components for desirable goals, such as overall render efficiency, we demonstrate significant improvements over existing approaches.

Joris NIX
Challenging Traditional Views and Techniques in Relational Query Processing and Indexing
(Advisor: Prof. Jens Dittrich)
Tuesday, 06.05.25 14:00h , building E1 1, room 4.07

Query processing and indexing are fundamental components of every relational database management system. These areas are concerned with core aspects such as performance, design, and maintenance, which have been the subject of extensive, longstanding research. As a result, well-established methods and paradigms have emerged, particularly in query optimization, index construction, and the design and functionality of SQL. In this thesis, we aim to challenge and redefine some of these traditional views and techniques.
In the first part of this thesis, we question the translation of a logical plan to a physical plan on the granularity of complete operators during query optimization. Instead, we propose to deepen this process by breaking up the abstraction of an operator to consider more fine-granular subcomponents, enabling additional optimization potential. Our experimental validation demonstrates the impact of varying physical representations of a logical operator and highlights that a more holistic optimization approach can significantly improve estimated query plan quality.
In the second part of this thesis, we aim to apply this approach specifically to index structures, which are generally considered monolithic and hand-crafted entities tailored to specific use cases. We propose a generic indexing framework that breaks up index structures by separating a logical index from a physical index similar to the split into logical and physical operators. Furthermore, we formulate index construction as an optimization problem that we solve using genetic programming. Our experiments show that our approach successfully rediscovers existing baselines. In addition, an optimized index tailored to a specific dataset and workload not only matches, but in some cases, surpasses the performance of traditional indexes.
In the third part of this thesis, we propose a single keyword extension to SQL that breaks up the single-table result limitation by allowing to return a subdatabase. This subdatabase contains the tables that participate in the query, each reduced to those tuples that contribute to the traditional query result. We present four SQL-based rewrite methods and an efficient native algorithm that we implemented in a database system with a state-of-the-art compiling query execution engine. The experimental evaluation shows that multiple individual result sets significantly reduce the overall result set size, with our methods adding minimal overhead to the query execution time and, in some cases, even outperforming traditional, single-table execution.

April

Tuan-Phong NGUYEN
Large-Scale Acquisition of Refined Commonsense Knowledge
(Advisor: Prof. Gerhard Weikum)
Thursday, 24.04.25 11:30h , building E1 5, room 0.29

Common-sense knowledge (CSK) about properties of concepts and human behaviors (e.g., elephants are big and eat plants, children love visiting zoos, tipping is not a common practice in Japan) is crucial for robust human-centric AI. However, this kind of knowledge is covered by a small number of structured knowledge projects. Most prior CSK resources are restricted in their expressiveness to subject-predicate-object (SPO) triples with simple concepts for S and monolithic strings for P and O. Furthermore, the plausibility of CSK can vary across cul-tures (e.g., „one should tip the waiter“ is generally true in the US, but not in Japan), which is overlooked in existing resources. This dissertation aims to address these limitations by:
(1) introducing advanced commonsense knowledge models with refined subjects, semantic facets, and culture-specific assertions;
(2) proposing methods for acquiring such knowledge from large-scale web contents and large language models (LLMs). Our methods strive for both high precision and wide coverage with salient assertions, which resulted in CSK resources that outperform existing resources in various intrinsic and extrinsic evaluations.

Max LOSCH
Improving Trustworthiness of Deep Learning via Inspectable and Robust Representations
(Advisor: Prof. Bernt Schiele)
Friday, 11.04.25 15:00h , building E1 4, room 0.24

An increasing number of Deep Learning systems are applied in the real world and have poten-tial impact on peoples lives: autonomous cars, assisted medical diagnosis or social scoring. Attributable to training increasingly complex models on increasingly large datasets, these applications have become useful since they are trained to be accurate prediction machines. Typically, this is achieved by optimizing for accuracy only while disregarding two critical weak points of deep learning persisting since its inception. Firstly, the complexity of used models render it difficult to explain and understand causes for incorrect predictions – coined as black box property. Secondly, models are susceptible to adversarial examples – slight input perturbations otherwise imperceptible to humans – that can result in dramatic changes in predictions. While mitigation approaches exist, these are often expensive to train and hence are not deployed by default in practice. Both issues reduce the trustworthiness of deep learning and could dampen further adoption for real world problems. In this thesis defense, I discuss mitigations for both issues in two parts. In the first part, I discuss our proposed Semantic Bottlenecks that explicitly align intermediate representations to human meaningful concepts like feet, leg, wood, etc. while reducing dimensionality to address the black-box issue and show that these bottlenecks can be useful for error analysis. In the second part, I discuss two ways to mitigate the risk to adversarial examples with a focus on reducing the computational over-head of conventionally used adversarial training:
(i) training on data subsets and (ii) utilize Lipschitz bounds to enable certification.

March

Rui WEN
(Un)Trustworthy Data in Adversarial Machine Learning
(Advisor: Prof. Michael Backes)
Wednesday, 26.03.25 12:30h , building E9 1, room 0.01

Machine learning has become indispensable across various industries, driving innovation and enabling data-driven decision-making. At the core of this technology is the critical role of data, which is fundamental to model training and directly impacts performance. However, this reliance on data also exposes machine learning systems to vulnerabilities, particularly around privacy and security.
In this dissertation, we explore the role of data in adversarial machine learning, focusing on two major challenges: data privacy leakage and data poisoning. First, we investigate privacy leakage in state-of-the-art models by proposing a membership inference attack against in-context learning. We show that even in restricted settings, it is possible to infer whether specific data points were used in training, posing significant risks in sensitive domains such as healthcare and finance. Next, we examine how data can be exploited as an attack surface, introducing a robust poisoning technique capable of bypassing current defenses. We also propose the first dynamic backdoor attack, which uses flexible triggers to evade detection, high-lighting the need for stronger defense mechanisms. Finally, we conduct a systematic study on how data characteristics, such as data importance, affect the success of machine learning attacks. Our results suggest that adjusting data importance can either increase or reduce vulnerability, offering new strategies for both attacks and defenses.
This dissertation contributes to a deeper understanding of adversarial dynamics, helping to build more secure and trustworthy machine learning systems.

Felix KOSMALLA
Computer-Supported Assistive Systems for In-Situ Movement Guidance in Sports
(Advisor: Prof. Antonio Krüger)
Tuesday, 25.03.25 15:00h , building D3 2, VisRoom (-1.63)

Sports have evolved from preparing for survival into a key component of modern fitness and recreation. Regardless of the level of professionalism, correct movement techniques are essential to enhance performance and to reduce the risk of injuries. Traditional self-learning methods often fall short due to their reliance on individual interpretation and execution, while personal trainers, though effective, lack broad accessibility. To overcome these challenges, computer-supported assistive systems offer real-time, context-dependent feedback during sports movements. In our research, we focus on the design and evaluation of such systems, particularly in rock climbing and slacklining. We introduce a slackline training assistant providing automatic instructions and real-time feedback, targeted especially at novices. In rock climbing, we investigated notification channels and visualization methods for expert modeling. To support future research, we developed two enabling technologies: a toolkit for rapid prototyping of smart insoles that provide foot-related feedback and a mixed-reality platform that creates interactive climbing experiences. Together, these contributions advance the field of computer-supported real-time feedback in sports.

Junaid ALI
Designing Fair Decision-Making Systems
(Advisor: Prof. Krishna Gummadi)
Tuesday, 25.03.25 10:00h , building E1 5, room 0.29

The impact of algorithmic decision-making systems on individuals has raised significant interest in addressing fairness concerns within such systems. Designing fair systems entails several critical components, which have garnered considerable attention from the research community. However, notable gaps persist in three key components. Specifically, in this thesis, we address gaps in following components: i) evaluating existing approaches and systems for (un)fairness, ii) updating deployed algorithmic systems fairly, and iii) designing new decision-making systems from scratch. Firstly, we evaluate fairness concerns within foundation models. The primary challenge is that fairness definitions are task-specific while foundation models can be used for diverse tasks. To address this problem, we introduce a broad taxonomy to evaluate the fairness of popular foundation models and their popular bias mitigation approaches. Secondly, we tackle the issue of fairly updating already deployed algorithmic decision-making systems. To this end, we propose a novel notion of update-fairness and present measures and efficient mechanisms to incorporate this notion in binary classification. However, in cases where there is no deployed system or updating an existing system is prohibitively complex, we must design new fair decision-making systems from scratch. Lastly, we develop new fair decision-making systems for three key application scenarios. Major challenges in designing these systems include computational complexity, lack of existing approaches to tackle fairness issues and designing human-subject based studies. We develop a computationally efficient mechanism for fair influence maximization to make the spread of information in social graphs fair. Additionally, we address fairness concerns under model uncertainty, i.e., uncertainty arising due lack of data or the knowledge about the best model. We propose a novel approach for training nondiscriminatory systems that differentiate errors based on their uncertainty origin and provide efficient methods to identify and equalize errors occurring due model uncertainty in binary classification. Furthermore, we investigate whether algorithmic decision-aids can mitigate inconsistency among human decision-makers through a large-scale study testing novel ways to provide machine advice.

Rati DEVIDZE
Reward Design for Reinforcement Learning Agents
(Advisor: Prof. Adish Singla)
Thursday, 20.03.25 11:30 h , building E1 5, room 0.29

Reward functions are central in reinforcement learning (RL), guiding agents towards optimal decision-making. The complexity of RL tasks requires meticulously designed reward functions that effectively drive learning while avoiding unintended consequences. Effective reward design aims to provide signals that accelerate the agent’s convergence to optimal behavior. Crafting rewards that align with task objectives, foster desired behaviors, and prevent undesirable actions is inherently challenging. This thesis delves into the critical role of reward signals in RL, highlighting their impact on the agent’s behavior and learning dynamics and addressing challenges such as delayed, ambiguous, or intricate rewards. In this thesis work, we tackle different aspects of reward shaping. First, we address the problem of designing informative and interpretable reward signals from a teacher’s/expert’s perspective (teacher-driven). Here, the expert, equipped with the optimal policy and the corresponding value function, designs reward signals that expedite the agent’s convergence to optimal behavior. Second, we build on this teacher-driven approach by introducing a novel method for adaptive interpretable reward design. In this scenario, the expert tailors the rewards based on the learner’s current policy, ensuring alignment and optimal progression. Third, we propose a meta-learning approach, enabling the agent to self-design its reward signals online without expert input (agent-driven). This self-driven method considers the agent’s learning and exploration to establish a self-improving feedback loop.

Hannaneh AKRAMI
Share-Based and Envy-Based Approaches to Fair Division of Indivisible Goods
(Advisors: Prof. Kurt Mehlhorn and Prof. Karl Bringmann)
Thursday, 13.03.25 15:00 h , building E1 4, room 0.24

The fair allocation of resources among agents with individual preferences is a fundamental problem at the intersection of computer science, social choice theory, and economics. This dissertation examines scenarios where the resources to be allocated are a set of indivisible goods. Two primary categories of fairness concepts are considered: share-based and envy-based criteria. Each category encompasses desirable notions of fairness, each with distinct advantages and limitations.
In the first part of the dissertation, we study a share-based fairness notion known as the maximin share (MMS). Since MMS allocations do not always exist, we study relaxed MMS allocations and establish positive results in various settings. In particular, we establish the existence of (3/4 + 3/3836)-MMS allocations for agents with additive valuations, and (3/13)-MMS allocations for agents with fractionally subadditive (XOS) valuations.
In addition, we consider ordinal approximations of MMS and prove the existence of 1-out-of-d4n/3e MMS allocations in the additive setting.
The second part of the dissertation focuses on envy-based fairness notions. For indivisible items, the most prominent envy-based criterion is envy-freeness up to any item (EFX). Although the existence of EFX allocations remains open in many general settings, we contribute to this area by proving the existence of EFX allocations for three agents under minimal constraints on their valuations. Furthermore, we establish the existence of relaxed forms of EFX, including epistemic EFX, and approximate EFX with charity.
In the third and final part of this thesis, we move beyond single fairness criteria—whether share-based or envy-based—to establish the existence of allocations that satisfy multiple fairness guarantees. Specifically, we prove the existence of (partial) allocations that are 2/3-MMS and EFX simultaneously. This line of research, while less established, represents a promising direction for future research.

Adrián JAVALOY BORNÁS
Meet my Expectations: On the Interplay of Trustworthiness and Deep Learn-ing Optimization
(Advisor: Prof. Isabel Valera)
Tuesday, 11.03.25 14:30 h , building E1 1, room 4.07

Deep learning has achieved remarkable success across a wide range of real-world applications, but as its adoption grows, so does the need for trustworthiness. In this dissertation, we argue that a key aspect of model trustworthiness is our perception of control over the model, i.e. whether the model meets the pre-existing expectations that we place on it. However, current optimization methods often lack mechanisms to prioritize solutions that fulfill these expectations over equally performing but less compliant alternatives. In this thesis, we explore how deep learning optimization can be guided to produce models that better match our expectations. We examine three families of models—multitask learning (MTL), probabilistic generative models (PGMs), and causal generative models (CGMs)—each presenting increasing levels of complexity in the expectations we place on them. We identify fundamental challenges in current approaches, introduce novel theoretical insights, and propose new algorithms and metrics to better integrate existing expectations into the training process.
For MTL, we discuss the limitations of multi-objective optimization frameworks and propose new ranking-based evaluation metrics and gradient manipulation techniques to improve task interactions. For PGMs, we develop preprocessing and in-processing strategies to ensure balanced learning across data modalities, significantly enhancing model performance. Finally, for CGMs, we introduce a new family of causal normalizing flows (Causal NFs) that provide strong theoretical guarantees for causal inference, addressing a long-standing challenge in the field. By carefully designing inductive biases and optimization constraints, we demonstrate how deep learning models can be made more reliable and compliant with human expectations, which is key for their successful deployment.

Martin FEICK
Hand-based Illusions for Haptics in Virtual Reality
(Advisor: Prof. Antonio Krüger)
Monday, 10.03.25 15:00 h , building D3 2, NB room -1.63 (VisRoom)

Virtual Reality (VR) enables us to dive into artificially generated worlds, creating the illusion of being elsewhere. However, this illusion falls apart when using our hands to interact with objects inside VR because nothing can be physically touched. Haptic feedback is crucial to our everyday interactions in reality, so its sudden absence can disrupt the immersive nature of VR. To address this, a single physical proxy object can approximate virtual objects’ proper-ties to form a combined visuohaptic illusion. We introduce four novel proxy-based approaches that render tactile and kinesthetic haptic feedback for object interactions in VR. To alter proxies’ perceived properties, we explore perceptual illusions that visually offset virtual hand interactions from their real-world counterpart. Here, we contribute three novel hand-based illusions that can simulate different haptic effects. However, introducing offsets be-tween what users see and what they feel risks disrupting the VR experience. Therefore, we set out to quantify the undetectable offset for various types of interactions, properties of proxies, and users’ virtual representations to understand the techniques’ application limits. Fnally, we present a method for continuously monitoring and tailoring hand-based illusions to individuals’ sensitivity to offsets. Together, this thesis advances the field of haptics for hand-based object interactions in VR.

February

Osman Ali MIAN
Practically Applicable Causal Discovery
(Advisor: Prof. Jilles Vreeken)
Friday, 28.02.25 15:00 h , building E9 1, room 0.05

This thesis focuses on discovering causal dependencies from observational data, which is one of the most fundamental problems in science. In particular, causal discovery aims to disco-ver directed graphs among a set of observed random variables under specified assumptions. While an active area of research, existing causal discovery approaches are not always applicable to real-world scenarios. This is mainly due to their underlying assumptions, which limit their applicability in practice.
In this dissertation, we aim to develop approaches that can be applied to several real-world scenarios to discover causal dependencies, under mild assumptions. We first focus on a setting where we discover the complete causal DAG and not just the Markov equivalence class from observational data. We do so by using the principle of choosing the simplest explanation, measured in information-theoretic terms, to develop a theoretically sound causal discovery method. Next, we extend causal discovery to data collected across multiple environ-ments, addressing biases from pooling data with different interventional distributions. To this end, we propose an approach that uses a similar information-theoretic score to discover causal networks in distributed settings without requiring prior knowledge of whether the data is observational or interventional. Furthermore, we develop a method for continual causal discovery from episodic data that updates causal hypotheses as new data arrives, without the need to re-learn causal networks from scratch each time. Our proposed approach for this scenario can learn causal networks adaptively over time and distinguish between episodes that do not belong to the same causal mechanism. Lastly, we tackle the important aspect of privacy-preserving federated causal discovery. To do so, we propose a general framework that effectively identifies global causal networks without ever sharing the data or learning parameters, while ensuring differential privacy.

Till SPEICHER
On Fairness, Invariance and Memorization in Machine Decision and Deep Learning Algorithms
(Advisor: Prof. Krishna Gummadi)
Monday, 24.02.25 15:00 h , building E1 5, room 0.29

As learning algorithms become more capable, they are used to tackle an increasingly large spectrum of tasks. Their applications range from understanding images, speech and natural language to making socially impactful decisions, such as about people’s eligibility for loans and jobs. Therefore, it is important to better understand both the consequences of algorithmic decisions and the mechanisms by which algorithms arrive at their outputs. Of particular interest in this regard are fairness when algorithmic decisions impact people’s lives and the behavior of deep learning algorithms, the most powerful but also opaque type of learning algorithm.
To this end, this thesis makes two contributions: First, we study fairness in algorithmic decision-making. At a conceptual level, we introduce a metric for measuring unfairness in algorithmic decisions based on inequality indices from the economics literature. We show that this metric can be used to decompose the overall unfairness for a given set of users into between- and within-subgroup components and highlight potential tradeoffs between them, as well as between fairness and accuracy. At an empirical level, we demonstrate the necessity for studying fairness in algorithmically controlled systems by exposing the potential for discrimination that is enabled by Facebook’s advertising platform. In this context, we demonstrate how advertisers can target ads to exclude users belonging to protected sensitive groups, a practice that is illegal in domains such as housing, employment and finance, and highlight the necessity for better mitigation methods.
The second contribution of this thesis is aimed at better understanding the mechanisms governing the behavior of deep learning algorithms. First, we study the role that invariance plays in learning useful representations. We show that the set of invariances possessed by representations is of critical importance in determining whether they are useful for downstream tasks, more important than many other factors commonly considered to determine transfer performance. Second, we investigate memorization in large language models, which have recently become very popular. By training models to memorize random strings, we uncover a rich and surprising set of dynamics during the memorization process. We find that models undergo two phases during memorization, that strings with lower entropy are harder to memorize, that the memorization dynamics evolve during repeated memorization and that models can recall tokens in random strings with only a very restricted amount of information.

Denis SUMIN
Data-driven methods for high-fidelity material appearance reproduction in additive 3D printing
(Advisor: Prof. Karol Myszkowski)
Tuesday, 18.02.25 9:00 h , building E1 4, room 0.24

This thesis addresses key challenges in high-fidelity material appearance reproduction for multi-material inkjet 3D printing. Despite recent advances in fullcolor 3D printing, accurate reproduction remains difficult due to the translucency and scattering properties of common print materials. We develop a comprehensive preparation system to overcome these limitations. Our approach introduces an iterative optimization method to refine volumetric material arrangements, mitigating color bleeding and blurring. Using Monte Carlo light transport simulation and a calibration procedure to obtain material scattering parameters, we achieve superior detail preservation and color fidelity, even in highly translucent media and thin features. To improve computational efficiency, we propose a deep learning-based approach to predict light scattering in heterogeneous materials. This method accelerates simulations by two orders of magnitude while maintaining high-quality optimization, enabling practical full heterogeneous material optimization within printing times. Additionally, we evaluate existing image quality metrics for light-field images, develop a dense light-field dataset, and conduct perceptual experiments to assess artifacts in light-field processing. Our findings highlight the need for specialized metrics to better predict perceived quality in complex fabrication tasks. The developed dataset will aid future research in spatially and angularly varying appearance reproduction, contributing to the advancement of 3D printing and computational fabrication.

January

Martin DESHARNAIS
Formal Verification of Logical Calculi and Simulations in Isabelle/HOL
(Advisor: Prof. Christoph Weidenbach)
Wednesday, 29.01.25 14:00 h , building E1 4, room 0.24

This thesis defense describes my formalizations of three proof calculi: SCL(FOL), ground ordered resolution, and ground superposition. The main theorems formalized for each calculus are soundness (i.e., every formula derived from valid formulas is valid) and refutational completeness (i.e., if a formula is invalid, then the calculus can be used to derive a refutation). For SCL(FOL), another main theorem is that derived formulas are nonredundant (i.e., they are not “obvious” from the already known formulas). Ground ordered resolution only has this last property when a suitable strategy is used. I
re-proved and formalized a previously known result that a specific strategy for SCL(FOL) can simulate a specific strategy for ground ordered resolution and vice versa. This was carried out with a framework for simulation proofs that I developed. All formalizations were carried out using the Isabelle/HOL proof assistant.

Hossein HAJIPOUR
AI Code Generation Models: Opportunities and Risks
(Advisor: Prof. Mario Fritz)
Wednesday, 08.01.25 13:30 h , building E9 1, room 0.01

The advancements in artificial intelligence (AI) for software engineering have opened up transformative possibilities in software development and automation, enabling developers to leverage AI-driven tools for tasks that traditionally require significant manual effort. However, this progress is accompanied by significant risks, particularly regarding the security and trustworthiness of the generated code.
This thesis investigates both the capabilities and associated risks of AI code generation models in various dimensions. First, we study the capabilities of these models by proposing neu-ral-based code generation models to repair common programming errors and reverse-engineering black-box functions effectively. In the second part, we investigate the risks associated with these models, particularly regarding out-of-distribution (OOD) generalization and software security issues. We propose a systematic approach to study the ability of the models to generalize to unseen code structures and present a novel method to automatically examine the tendency of AI code generation models to generate vulnerable code instances. Our study reveals that these models can generate various vulnerable code instances in dif-ferent security scenarios. Motivated by the prevalence of vulnerable code samples generated by AI models, in the third part, we introduce Hexacoder, a method that automatically synthesizes secure code examples and utilizes this data to fine-tune code generation models, enhancing their ability to generate secure code.

2024

December

Jordan ETHAN
Provable Security of Symmetric-Key Cryptographic Schemes in Classical and Quantum Frameworks
(Advisor: Prof. Antoine Joux)
Thursday, 19.12.24 14:30 h , building E9 1, room 0.02

In symmetric-key cryptography, most well-known algorithms are built as modes of operation on fixed $n$-bit primitives. These primitives are typically based on pseudorandom functions (PRFs) or pseudorandom permutations (PRPs), which are efficiently computable keyed functions or permutations indistinguishable from random ones. In particular, $2n$-bit-to-$n$-bit PRFs are key for constructing secure classical schemes, such as deterministic MACs and authenticated encryption with the SIV construction. While these results do not directly apply to the quantum setting, constructing a quantum-secure compressing PRF from smaller PRFs is a crucial step in developing sophisticated quantum cryptographic algorithms.
In this talk, we study a class of $2n$-bit-to-$n$-bit compression functions, featuring a non-linear „call“ between every two linear layers. We analyze the security of two- and three-call constructions, assessing their vulnerabilities to both classical and quantum attacks. Using a new framework for proving indistinguishability in the quantum setting, we show the quantum PRF (qPRF) security of two three-call constructions, TNT and LRWQ, introduced by Hosoyamada and Iwata. We also identify a flaw in the security proof of the Luby-Rackoff construction, proposed by Hosoyamada and Iwata, and show how it can be fixed by focusing on non-adaptive adversaries.
Additionally, this dissertation includes results in the classical setting, such as the design of efficient tweakable block ciphers with public permutations achieving beyond-birthday-bound security, and the analysis of authenticated encryption schemes through vulnerabilities in protocols like Telegram’s MTProto, as well as leakage resilience and context commitment in single-pass schemes like Triplex.

Sahar ABDELNABI
On the Opportunities and Risks of Machine Learning to Online and Societal Safety
(Advisor: Prof. Mario Fritz)
Thursday, 19.12.24 10:00 h , building E9 1, room 0.01

Machine Learning (ML), with its continuous and ever-growing significant advances, has great potential to accelerate decision-making, alleviate some of our societal problems, and reshape and facilitate our daily lives. However, ML has inherent security vulnerabilities and limitations and can itself be exploited and misused to exacerbate such societal problems, which requires a thorough evaluation of capabilities, attacks, and countermeasures.
In this thesis, we evaluate the interplay between ML, security, and online and societal safety aspects, such as misinformation and risks imposed by the use of Large Language Models (LLMs). To counter risks imposed by LLMs and generative models and help identify the context and provenance of information, we propose watermarking as an active defence against deep-fakes and model abuse. To exemplify ML opportunities to promote online safety, we leverage ML to automate multi-modal fact-checking and identify the underlying context of images that might be used out of context. On the other hand, to evaluate the risk of how ML can exacerbate misinformation and cause information contamination and poisoning, we comprehensively study attacks against fact-checking models and possible ones against real-world deployed LLM-integrated search engines. Besides that, we broadly discuss LLM-integrated applications and their potential security risks induced by the indirect prompt injection vulnerability that we uncover. Finally, to proactively evaluate LLMs in interactive setups that better match real-world use cases, such as customer service chatbots, we propose a new benchmark of complex text-based negotiation games to examine LLMs’ performance and reasoning in multi-agent setups, including adversarial ones that assume attacks between agents.

Immanuel HAFFNER
Optimization and Processing of Relational Database Queries
(Advisor: Prof. Jens Dittrich)
Wednesday, 18.12.24 14:00 h , building E1 1, room 407

The purpose of this Ph.D. thesis is to advance the state of the art of query processing in relational database systems. As first contribution, I present a reduction of the classical, NP-hard join order optimization problem to a shortest path problem. Consequently, I develop a heuristic search algorithm for solving this reduced problem. I provide a strong theoretical foundation for the reduction and the search. A thorough evaluation shows improvements in optimization time of orders of magnitude. My second contribution is a simplified design for query execution by just-in-time compilation to machine code. Architecturally simple solutions such as query compilation with LLVM suffer from unacceptably high compilation times. Modern just-in-time query compilers with significantly reduced compilation times, on the other side, are extravagantly hand-crafted. Rather than reinventing compiler technology in a DBMS, I propose to embed an off-the-shelf just-in-time compiling engine that is designed, built, and tested by compiler experts. I am able to achieve the lowest compilation times and competitive execution performance in all experiments. As my third contribution, I design a relational DBMS as a software system that is composed of individual components, each implementing an isolated logical task. For example, join ordering is one such component of a composable DBMS. I describe the design principles that guide my and my colleagues‘ efforts towards implementing such a DBMS. Most importantly, my thesis is accompanied by the release of our open-source research DBMS mutable, that implements this design of composition.

Björn MATHIS
Strategic Parser Fuzzing: Leveraging Domain Knowledge For Input Generation
(Advisor: Prof. Andreas Zeller)
Monday, 16.12.24 14:30 h , building E9 1, room 0.01

Testing software is one of the most important parts of the development process. Without tests, programs would often crash or contain security vulnerabilities. Since testing is time-consuming and complex, techniques were developed to simplify this process. For instance, fuzzers create mostly random inputs and test how a program reacts to those. Especially software that uses parser for input processing is classified as interesting by us, but it is also hard to automatically test it with general purpose techniques—they cannot generate the syntactically correct inputs to test the program logic. Thus, we present a new approach specifically for analyzing software with recursive descent parsers. A central feature of parsers are the iterative comparisons of parts of the input against terminals of a respective context-free grammar. We show, how those comparisons from a program execution can be combined with other, parser-specific features to infer syntactically valid and diverse inputs. In our evaluation we combine our techniques with the fuzzer AFL. Our generated inputs contain on average 77.7% of all possible lexemes with more than three characters. We obtain on average a 2.9 and in best case up to 17 percentage points higher branch coverage in comparison to running AFL alone.

Max EISELE
Debugger-driven Embedded Fuzzing
(Advisor: Prof. Andreas Zeller)
Thursday, 12.12.24 13:00 h , building E1 1, room 407

Embedded Systems – hidden computers – are all around. Programed by humans or, eventually, artificial intelligences, embedded systems run software to enrich, entertain, and evaluate our lives on all imaginable grounds. Safety-critical systems, such as vehicles or industrial production plants, feature numerous bespoke embedded computers whose software monitors, measures, and manipulates things in their environment. Since programmers and artificial intelligences make mistakes, software contains errors. Software testing is therefore indispensable for finding programming flaws, ideally before deployment.
Automated software testing methods can automatically generate test data for programs to assist test engineers with the task of crafting test cases. However, available techniques are primarily established for testing applications on personal computers and servers. Deploying automated software testing techniques on embedded systems is subject to additional challenges, mainly arising from the low number of shared communalities in terms of interfaces, peripherals, as well as hardware and software architectures. This thesis examines obstacles to fuzzing embedded systems and defects of state-of-the-art approaches. Furthermore, it introduces two new methods for fuzz testing embedded systems, overcoming the distilled defects. Also, both methods leverage only generic and widespread features for analyzing embedded programs during runtime and thus are applicable on a variety of devices in practice.

Rahul Mohideen Kaja MOHIDEEN
Efficient Methods for Inpainting-Based Image Compression
(Advisor: Prof. Joachim Weickert)
Monday, 09.12.24 16:15 h , building E1 7, room 0.02

This thesis is dedicated to image compression methods that optimise and store a small subset of the image pixels, called the mask, and reconstruct the rest of the image through inpainting. However, saving fully optimised pixel positions is expensive and has, till now, received little attention. We propose two new families of codecs specifically addressing this problem that offer better performance or a better trade-off between speed and performance. Inpainting-based image compression methods have long since employed partial differential equations for their inpainting method. However, naive implementations are very slow, requiring significant efforts to be sped up. In this thesis, we explore Shepard inpainting as a simple and efficient alternative. By considering data selection and extensions such as anisotropy, we propose our own Shepard-inpainting-based compression methods that offer a good mix of simplicity, efficiency, and quality. Multi-channel images are encountered more than single-channel images today. However, very few inpainting-based codecs have dedicated colour modes. We propose colour extensions for Shepard inpainting, including a luma-preference mode and a vector quantisation mode that has not yet been proposed. This thesis tries to present efficient and better methods to compress fully optimised masks and to see how far one can go with a simple but efficient operator such as Shepard inpainting.

Anapuma CHINGACHAM
Exploring Paraphrasing for Enhancing Speech Perception in Noisy Environments
(Advisor: Prof. Dietrich Klakow)
Monday, 09.12.24 14:00 h , building C7 4, room 1.17

This thesis addresses the challenge of speech perception in noisy environments, where echoes, reverberations and background noise can distort communication. It proposes using paraphrases, instead of acoustic modifications, to improve speech intelligibility in noise without causing signal distortions. The first study investigates the effectiveness of replacing words with synonyms in noisy conditions, finding that it can enhance word recognition by up to 37% in high-noise environments. The second study expands on this by exploring sentential paraphrases, showing that choosing the right paraphrase can improve intelligibility by 33%. It also develops a paraphrase ranking model that outperforms baseline models in identifying the most intelligible paraphrases. The final study examines how Large Language Models (LLMs) can generate both semantically equivalent and acoustically intelligible paraphrases. It reveals that while LLMs struggle to improve acoustic intelligibility in standard setups, a post-processing approach called „prompt-and-select“ yields better results. Overall, the thesis contributes two new datasets and a novel framework for generating noise-robust speech, offering a promising direction for developing spoken dialogue systems that adapt to noisy environments.

Sanjay Kumar SRIKAKULAM
Simulations and data structures to study drug resistance
(Advisor: Prof. Olga Kalinina)
Tuesday, 03.12.24 13:30 h , building E2 1, room 0.01

Drug resistance critically hinders treatment success across diseases, often causing relapse and failure. It poses a significant therapeutic barrier, primarily driven by genetic mutations that alter the structure and function of key proteins. Addressing this challenge requires a comprehensive approach and integrating advanced computational techniques with molecular insights for effective intervention. In this thesis, we address the challenge of drug resistance by exploring the impact of mutations through modern computational techniques. We first use molecular dynamics simulations to study how specific mutations influence protein dynamics, structure, and function, particularly r elevant in diseases like cancer and viral infections. Studies on the receptor tyrosine kinase KIT and the NS3 protease in the hepatitis C virus illustrate mutation-induced stabilization that reduces drug efficacy. To complement these molecular insights, the second project introduces MetaProFi, a novel, state-of-the-art tool for large-scale genomic analysis. It uniquely indexes nucleotide and amino acid sequences, with the added capability of querying amino acid indexes using nucleotide sequences crucial for accurately identifying functionally relevant genetic variants, as protein sequences are more conserved across evolutionary distances. MetaProFi incorporates advanced optimizations, including data chunking, shared memory systems, and compression algorithms, providing a scalable and efficient solution for handling extensive genomic datasets. This thesis provides tools to advance targeted, personalized therapeutic strategies against drug resistance by integrating molecular dynamics with large-scale genomic analysis.

November

Zeyang SHA
Towards Comprehensive Security Assessment in Machine Learning Pipelines
(Advisor: Dr. Yang Zhang)
Tuesday, 26.11.24 13:00 h , building E9 1, room 0.07

Machine learning (ML) has become essential in various critical applications. As ML models are increasingly deployed, they also face a rising number of attacks targeting different stages of the ML pipeline. This pipeline can broadly be divided into three phases: data used for training, model parameters, and the outputs of the trained model.
This thesis introduces the comprehensive security assessment of machine learning pipelines. We begin by addressing data security, focusing particularly on backdoor attacks through data poisoning. We demonstrate that such attacks can be effectively mitigated with simple fine-tuning methods. Next, we explore model security by investigating model stealing attacks. We introduce novel model stealing techniques targeting contrastive learning models and develop adaptive defenses to counteract these threats. Lastly, we turn our attention to the outputs of the model. Here, we delve into detecting and attributing fake images, proposing innovative detection methods that utilize prompts to enhance performance. These multifaceted approaches allow us to tackle machine learning security comprehensively, spanning all the ML pipeline’s critical stages.

David KALTENPOTH
Don’t Confound Yourself: Causality from Biased Data
(Advisor: Prof. Jilles Vreeken)
Monday, 25.11.24 14:00 h , building E1 4, room 0.24

Machine Learning has achieved remarkable success in predictive tasks across diverse domains, from autonomous cars to LLMs, this predictive prowess masks a fundamental limitation: ML systems excel at capturing statistical associations in observational data but fail to uncover the underlying causal mechanisms that generate these patterns. While machine learning models may accurately predict patient outcomes or identify tumors in medical imaging, they cannot answer crucial counterfactual questions regarding how these systems would respond to novel actions or policy changes.
A fundamental problem with understanding causation is due to the pervasive influence of unmeasured confounding and selection bias in observational data. Unmeasured confounding occurs when hidden variables influence both our observed predictors and outcomes, creating spurious correlations that ML models eagerly learn but that don’t represent genuine causal relationships. Selection bias further compounds this problem by systematically distorting our sample in ways that generalization to a broader class of instances may be impossible.
These challenges cannot be overcome by simply collecting more data or building more sophisticated predictive models. They require the use of a formal framework to reason under which conditions we can expect our models to recover the underlying causal graph. In this thesis we provide one such framework allowing us to derive conditions under which accurate causal networks and effects may be discovered, allowing us to deal with partially observed systems under novel conditions.

Marcel MALTRY
From Component to System: Evaluating Recursive Model Indexes and Index Scan Execution Strategies
(Advisor: Prof. Jens Dittrich)
Wednesday, 20.11.24 14:00 h , building E1 1, room 4.07

Indexes are essential for efficient data retrieval and peak query performance in database systems. Traditional indexes are general-purpose data structures, agnostic to data distributions. In contrast, learned indexes, like the recursive model index (RMI), leverage machine-learned models to exploit data-specific patterns, achieving superior lookup performance and space efficiency.
The first part of this thesis focuses on analyzing the hyperparameters of RMIs, providing key insights into their influence on performance and leading to a practical guideline for their configuration. This guideline achieves competitive lookup performance with minimal tuning effort compared to previous approaches. Its effectiveness is validated through comparison against both learned and traditional state-of-the-art indexes.
The second part of the thesis moves beyond the isolated analysis of RMIs and examines their integration into a database system with a compiling query engine. We focus on the index scan operator and develop three strategies for its execution, which differ in the extent to which they precompute parts of the index scan during code generation. While we identify the optimal workload characteristics for each strategy, our experiments show that RMIs do not improve index scan performance compared to a simple baseline.

Jian WANG
Egocentric Human Motion Capture
(Advisor: Prof. Christian Theobalt)
Friday, 15.11.24 12:00 h , building E1 5, room 630

The human motion capture (mocap) technology has wide applications, especially in entertainment, sports analysis, and human-computer interactions. Among the motion capture techniques, egocentric motion capture provides a unique perspective from the individual’s point of view. Being able to capture human motion in an unconstrained environment, egocentric motion capture is crucial for AR/VR applications.
This thesis focuses on the task of egocentric motion capture with a single, head-mounted, downward-facing fisheye camera. This setup can provide a broad field of view, which enables the capture of both body movements and interactions within the environment. Despite the advantages of egocentric cameras, this setup suffers from several challenges, which are discussed in this thesis. These challenges include global motion estimation, self-occlusion, fisheye lens distortion, and the lack of large-scale training datasets. This thesis addresses these challenges by introducing new datasets and technical contributions: To address the lack of large-scale training datasets, the thesis presents new datasets, including EgoPW, EgoGTA, and EgoWholeBody. These datasets cover a wide range of motions and environments, containing detailed annotations for human motion and scene geometry. By proposing new datasets, this thesis also reduces the gap between synthetic and real-world data. To capture global human motion, the thesis employs the SLAM method to obtain the global camera poses. The camera poses and the initial local human motion estimations are simultaneously optimized with the motion prior. The thesis also presents methods to overcome the issue of self-occlusion. These include leveraging temporal information, applying human motion priors, and incorporating scene geometry information. To mitigate the fisheye distortion issue, this thesis introduces FisheyeViT. It rectifies fisheye distortion with image patches and employs a Vision Transformer (ViT) network for feature extraction.
All of the methods in this thesis provide new solutions to some of the main challenges of egocentric motion capture with different technical and dataset contributions. These contributions enhance the capability to capture human motion under unconstrained scenarios, which offers new possibilities for applications in VR, AR, interactive gaming, and more.

Georges P. SCHMARTZ
Addressing Microbial Threats through Genomics, Metagenomics, and Bioinformatics
(Advisor: Prof. Andreas Keller)
Monday, 11.11.24 13:00 h , building E2 1, room 0.01

This thesis begins by highlighting the detrimental impact of multi-resistant bacterial infections through a clinical case study from war-torn Ukraine, where whole genome sequencing was used to explain infection spread. It then presents a whole series of projects demonstrating how metagenomic sequencing at scale can be leveraged to identify biosynthetic gene clusters with the potential to inspire new antibiotic compounds. Finally, the thesis showcases Mibianto, a web-based solution designed for efficient and user-friendly analysis of metagenomic data with a focus on microbial community composition analysis.

Maximilian Alexander KÖHL
Provably Accurate Verdictors: Foundations and Applications
(Advisor: Prof. Holger Hermanns)
Tuesday, 05.11.24 10:00 h , building E1 7, room 0.01

The thesis introduces verdictors and their provable accuracy. Provably accurate verdictors provide answers to critical operational questions, derived from observations of a system’s behavior. They can detect issues like aircraft sensor faults or incorrect configurations in manufacturing equipment, which in turn enables timely and targeted interventions. Using a model-based approach, we develop the foundational basis and the algorithmic machi-nery for synthesizing and implementing verdictors that are not only provably accurate but also robust in the presence of observational imperfections. The approach unifies and ge-neralizes a thus far fragmented research area, it enables entirely novel applications, and it is supported by an efficient software toolbox, upon which the empirical evaluation of our work rests.

October

Uğur Çoğalan
Machine Learning Solutions for High Dynamic Range Video Processing and Image Quality Evaluation
(Advisors: Dr. habil. Karol Myszkowski and Prof. Hans-Peter Seidel)
Monday, 21.10.24 15:30 h , building E1 4, room 0.19

This thesis explores the use of multi-exposure sensors to improve computational imaging tasks like denoising, motion blur removal, and high-dynamic range (HDR) image reconstruction. Unlike conventional sensors, multi-exposure sensors capture neighboring pixels with different exposures, providing reference points that simplify these tasks while preserving image detail. In video, the motion blur from longer-exposed pixels enhances optical flow computation and enables higher-quality video frame interpolation (VFI) for smoother slow-motion playback, even in HDR scenes. Additionally, the thesis proposes improving traditional and learning-based image quality metrics (PSNR, SSIM, LPIPS, DISTS) by incorporating visual masking models that better reflect human visual perception, resulting in more accurate and perceptually aligned evaluations.

Mohamad HOSEINI
Analyzing Information Propagation in Online Messaging Platforms
(Advisor: Prof. Anja Feldmann)
Thursday, 17.10.24 16:00 h , building E1 4, room 0.24

This thesis explores the spread of misinformation and conspiracy theories across online messaging platforms like Telegram, WhatsApp, and Discord. It addresses the lack of research on these platforms by analyzing public groups discovered on Twitter and examining the exposure of personal information. A detailed study of QAnon-related Telegram groups reveals the multilingual spread of conspiracies. Additionally, the research investigates message forwarding patterns and the lifespan of content within fringe communities, offering insights into misinformation dissemination.

Fabian RITTER
Inferring and Analyzing Microarchitectural Performance Models
(Advisor: Prof. Sebastian Hack)
Wednesday, 09.10.24 10:00 h , building E1 1, room 407

Modern processors are complex systems that employ a wide range of techniques to execute programs as fast and efficiently as possible. However, these hardware intricacies make reasoning about the efficiency of code for the processor difficult. Microarchitectural performance models are therefore indispensable for estimating and improving how efficiently software takes advantage of the hardware. This dissertation presents several advancements in the field of microarchitectural performance modeling.
The first part of this thesis proposes techniques to characterize how a processor exploits instruction-level parallelism. Based on a formal model, we explore ways to infer a processor’s port mapping from throughput measurements, i.e., how it splits instructions into micro-operations and how these are executed on the processor’s functional units. Our techniques enable accurate port mapping inference for processors that prior methods could not reason about.
In the second part, we introduce AnICA, a method to analyze inconsistencies between performance models. AnICA takes inspiration from differential testing and abstract interpretation to systematically characterize differences in the outputs of basic block throughput predictors. It can summarize thousands of inconsistencies in a few dozen descriptions that provide high-level insights into the differing behaviors of such predictors. These results have lead to improvements in the scheduling models of the widely used LLVM compiler infrastructure.
The defense talk will mainly focus on the first part of the thesis, the inference of processor port mappings.

September

Shrestha GHOSH
Count Information: Retrieving and Estimating Cardinality of Entity Sets from the Web
(Advisor: Prof. Simon Razniewski, now TU Dresden)
Monday, 30.09.24 10:00 h , building E1 4, room 0.19

Extracting information from the Web remains a critical component in knowledge harvesting systems for building curated knowledge structures, such as Knowledge Bases (KBs), and satisfying evolving user needs, which require operations such as aggregation and reasoning. Estimating the cardinality of a set of entities on the Web to fulfill the information need of questions of the form “how many ..?” is a challenging task. While, intuitively, cardinality can be estimated by explicitly enumerating the constituent entities, this is usually not possible due to the low recall of entities on the Web. In this dissertation we present our contributions towards retrieving and estimating cardinalities of entity sets on the Web.

Alejandro CASSIS
Algorithms for Knapsacks, Paths and Strings
(Advisor: Prof. Karl Bringmann)
Tuesday, 17.09.24 18:00 h , building E1 4, room 0.24

In this thesis we study three problems:
1. Knapsack: The Knapsack problem is a classic combinatorial optimization problem. We give a collection of improved exact and approximation algorithms for Knapsack and some of its variants. Our study is guided by the connection between Knapsack and min-plus convolution, a central problem in fine-grained complexity.
2. Sublinear Edit Distance: The edit distance is a popular and practically motivated measure of similarity between texts. We focus on sublinear-time algorithms, which aim to approximate the edit distance 𝑘 of two texts without reading them entirely. Our main result is a 𝑘𝑜(1)-approximation in time 𝑂(𝑛/𝑘 + 𝑘2+𝑜(1)). This constitutes a quadratic improvement over the previous state of the art, and matches an unconditional lower bound for small k (up to subpolynomial factors in the running time and approximation factor).
3. Negative Weight Single-Source Shortest Paths: Computing shortest paths from a source in a weighted directed graph is a fundamental problem. When all edge weights are non-negative, the classic Dijkstra’s algorithm solves this problem in near-linear time. It has been a long-standing open question to obtain a near-linear time algorithm when the graph contains negative edge weights. This has been solved recently in a breakthrough by Bernstein, Nanongkai and Wulff-Nilsen, who presented an algorithm in time 𝑂(𝑚 log8 𝑛 log𝑊 ). Our contribution is an improvement by nearly 6 log factors.

Hoang-Hai DANG
Scaling Up Relaxed Memory Verification with Separation Logics
(Advisor: Prof. Derek Dreyer)
Tuesday, 10.09.24 15:00 h , building E1 5, room 0.05

Reasoning about concurrency in a realistic, non-toy language like C/C++ or Rust, which encompasses many interweaving complex features, is very hard. Yet, realistic concurrency involves relaxed memory models, which are significantly harder to reason about than the simple, traditional concurrency model that is sequential consistency. To scale up verifications to realistic concurrency, we need a few ingredients:
(1) strong but abstract reasoning principles so that we can avoid the too tedious details of the underlying concurrency model;
(2) modular reasoning so that we can compose smaller verification results into larger ones;
(3) reasoning extensibility so that we can derive new reasoning principles for both complex language features and algorithms without rebuilding our logic from scratch; and
(4) machine-checked proofs so that we do not miss potential unsoundness in our verifications. With these ingredients in hand, a logic designer can flexibly accommodate the intricacy of relaxed memory features and the ingenuity of programmers who exploit those features.
In this dissertation, I present how to develop strong, abstract, modular, extensible, and machine-checked separation logics for realistic relaxed memory concurrency in the Iris framework, using multiple layers of abstractions.
I report two main applications of such logics:
(i) the verification of the Rust type system with a relaxed memory model, where relaxed memory effects are encapsulated behind the safe interface of libraries and thus are not visible to clients, and
(ii) the compositional specification and verification of relaxed memory libraries, in which relaxed memory effects are exposed to clients.

Ilkan ESIYOK
Three modest proposals for building trust in social media discourse, in the software that powers it and in the browsers that run the software
(Advisor: Prof. Michael Backes)
Tuesday, 03.09.24 14:00 h , building E9 1, room 0.01

The web has become the primary platform for information exchange, yet the increasing complexity of web applications and interactions has introduced significant trust challenges. This thesis addresses these challenges by propo-sing three modest proposals aimed at enhancing trust in web-based interac-tions. The first proposal, TrollThrottle, strengthens the authenticity of social media discourse by mitigating the impact of trolls using cryptographic techni-ques. The second, Accountable JavaScript, ensures the integrity and accoun-tability of web application software by verifying that users receive unaltered code. The third proposal, introduces a formal framework for model-based browser testing, enabling the detection of vulnerabilities in browser compo-nents and their interactions. Collectively, these proposals provide an end-to-end approach for improving the trust on the web, offering practical solutions for mitigating security risks and ensuring reliable web experiences.

August

Soheil KHODAYARI
Security Testing at Scale: Studying Emerging Client-side Vulnerabilities in the Modern Web
(Advisor: Dr. Giancarlo Pellegrino)
Wednesday, 28.08.24 14:00 h , building E9 1, room 0.05

The recent rapid evolution of client-side technologies have introduced new variants of traditional security issues that now manifest exclusively on client-side JavaScript programs. We have little-to-no knowledge of these new emerging threats, and exploratory security evaluations of JavaScript-based web applications are impeded by the scarcity of reliable and scalable testing techniques. In this thesis, we address these challenges by presenting JAW, an open-source, static-dynamic framework to study client-side vulnerabilities at scale, focusing particularly on client-side request hijacking and DOM Clobbering vulnerabilities where we investigate their patterns, prevalence, and impact in the wild. We instantiate JAW on over half a million pages of top 10K sites, processing over 56B lines of code in total, showing that these new variants are ubiquitous on the Web. We demonstrate the impact of these vulnerabilities by constructing proof-of-concept exploits, making it possible to mount arbitrary code execution, information leakage, open redirections and CSRF also against popular websites that were not reachable through the traditional attack vectors. Finally, we review and evaluate the adoption and efficacy of existing countermeasures against these attacks, including input validation and browser-based solutions like SameSite cookies and Content Security Policy.

Fabian F. SCHWARZ
TEE-based Designs for Network Gateways, Web Authentication, and VM Introspection
(Advisor: Prof. Christian Rossow)
Wednesday, 28.08.24 11:00 h , building E9 1, room 0.01

The complexity of client, server, and network devices has drastically increased — and so has the number of sophisticated attacks against them, including system-level exploits un-dermining their software defenses. As a potential solution, architectural extensions for trusted execution environments (TEEs) have been designed that enable a strong hardware-based isolation of critical software components from a compromised system. However, the benefits of TEEs have still not been considered for many security-critical network and web authentication services.
Therefore, this dissertation explores how such services can benefit from TEEs. In particular, we propose three TEE-based designs for network firewalls and web authentication. First, we show how client-side TEEs can enable gateway firewalls to enforce trusted per-application network policies. Second, we enhance the TEE protection to the gateway by designing a TEE-based router architecture with isolated network paths and policy enforcement. Third, we combine electronic IDs with TEE-protected cloud services to solve the recovery and cost issues of FIDO2 web authentication. Finally, we design secure remote forensics of services protected by TEE virtual machines while preserving their strong hardware protection.

Ahmed ABBAS
Efficient and differentiable combinatorial optimization for visual computing
(Advisor: Prof. Paul Swoboda, now Uni Düsseldorf)
Friday, 02.08.24 15:00 h , building E1 4, room 0.24

Many visual computing tasks involve reasoning over structured domains and discrete objects which can be modeled as combinatorial optimization (CO) problems. Tremendous speed-up in general-purpose CO solvers has allowed to tackle these problems in many cases despite being NP-hard. Approaching large-scale structured prediction problems from a combinatorial optimization standpoint however, has been a challenge due to a variety of reasons. These include near real-time performance requirements and lack of differentiability of CO approaches. The latter causes difficulties in harnessing machine learning to specify problem specifications and in developing learnable CO algorithms. We aim to address these short-comings on multiple avenues.
(i) We focus on a specific CO problem for clustering known as the multicut problem with many applications in a variety of visual computing tasks. We aim towards reducing human effort in multicut model specification by utilizing neural networks and address scalability issues by devising parallel algorithms.
(ii) Next we shift our focus to general-purpose CO solvers and tackle challenges related to their scalability. As a first step, we devise parallel algorithms that can harness GPUs gaining up to an order of magnitude speed-up over sequential CPU counterparts. For the second step, we exploit machine learn-ing in solving relaxations of CO problems. Given a few problem instances from a task of interest, our general-purpose solver can be adapted by learning instead of task-specific solver development. Empirically our learned approach achieves significantly better performance than its non-learned version, better solutions than task-specific solvers, and exhibits better anytime performance compared to a commercial solver (Gurobi). In summary, we study methods to make CO for visual computing more practical by devising differentiable, massively parallel, and data-driven methods.

Anna KUKLEVA
Advancing Image and Video Recognition with Less Supervision
(Advisor: Prof. Bernt Schiele)
Thursday, 01.08.24 14:00 h , building E1 4, room 0.24

Deep learning has become an essential component of modern life, transforming various tasks across multiple domains such as entertainment, education, and autonomous driving. However, the increasing demand for data to train models for emerging tasks poses significant challenges. Deep learning models heavily rely on high-quality labeled datasets, yet obtaining comprehensive supervision is resource-intensive and can introduce biases. Therefore, we explore strategies to mitigate the need for full supervision and reduce data acquisition costs. The first part of the discussion focuses on self-supervised and unsupervised learning methods, which enable learning without explicit labels by leveraging inherent data structures and injecting prior knowledge for robust data representations. The second part of the presentation discusses strategies such as minimizing precise annotations in multimodal learning, allowing for effective utilization of correlated information across different modalities. Moreover, we discuss open-world scenarios, proposing novel setup and method to adapt vision-language models to the new domains. Overall, this research contributes to understanding learning dynamics and biases present in data, advancing training methods that require less supervision.

July

Kerstin LENHOF
Machine learning-based anti-cancer drug treatment optimization
(Advisor: Prof. Hans-Peter Lenhof)
Monday, 22.07.24 14:30 h , building E2 1, room 001

Machine learning (ML) systems are about to expand into every area of our lives, including human healthcare. Thus, ensuring their trustworthiness represents one of today’s most pressuring scientific and societal issues.
In this thesis, we present novel ML-based decision support tools for one of the most complex, prevalent, and mortal diseases of our time: cancer. In particular, we focus on developing trustworthy ML methods for predicting anti-cancer drug responses from personalized multi-omics data. Our methods encompass strategies to minimize the effect of data-related issues such as class or regression imbalance, to achieve the interpretability of the models, and to increase the reliability of the models.
Our first approach, MERIDA, is dedicated to interpretability: it delivers Boolean rules as output and considers a priori pharmacogenomic knowledge to a previously unconsidered extent. With SAURON-RF, we devised a simultaneous classification and regression method that improved the statistical performance for the under-represented yet essential group of drug-sensitive samples, whose performance has mainly been neglected in the scientific literature. Its successor, reliable SAURON-RF, provides a conformal prediction frame-work, which, for the first time, ensures the reliability of classification and regression with certainty guarantees. Moreover, we propose a novel drug sensitivity measure that addresses the shortcomings of the commonly used measures.

Matthias FASSL
Averting Security Theater: Methods to Investigate and Integrate Secure Experience in a User-Centered Security Design Process
(Advisor: Dr. Katharina Krombholz)
Monday, 15.07.24 14:00 h , building E9 1, room 0.01

End users‘ interaction with computer security mechanisms can make them feel protected — resulting in a so-called secure experience. However, these secure experiences can be deceiving. First, the lack of secure experience reduces end users‘ ability to make informed decisions about their security practices. Second, unjustified secure experiences — that make end users feel protected while they are not — are dangerous. Such a security theater may result in users forgoing effective security practices or engaging in riskier behavior.
This thesis tackles both types of deceptive secure experiences by adapting existing methods from Human-Computer Interaction to Security and proposing new design methods. The presentation will give an overview of the thesis work before presenting a case study on secure experience and an adapted design method.

Boris WEIGAND
Understanding, Predicting, Optimizing Business Processes Using Data
(Advisors: Prof. Dietrich Klakow and Prof. Jilles Vreeken)
Thursday, 11.07.24 14:15 h , building C9 3, conference room

Companies face a disruptive digital transformation, which forces them to adapt their business model and innovate faster than ever before. Companies that do not transform rapidly enough risk to fall behind and fail in competition. On the other hand, changing existing business processes with complex behavior is highly risky. Analyzing process event logs promises to facilitate understanding, predicting and optimizing processes, and thus sup-ports a successful transformation. As wrong transformation decisions impose an existential threat, understandable models in each of these steps are non-negotiable.
In this thesis, we propose novel approaches to discover inherently interpretable models from process event data. First, we explore how to summarize the actual behavior of complex processes in terms of control-flow and how event data changes throughout a process. Second, we study accurate yet interpretable event sequence prediction and learning queuing behavior. Third, we alleviate the effort of modelling optimization and AI planning problems by learning constraints from exemplary solutions.

June

Pablo Gil PEREIRA
Predictable Data Transport: A Delay and Energy Perspective
(Advisor: Prof. Thorsten Herfet)
Monday, 24.06.24 14:00 h , building C6 3, room 9.05

Cyber-physical systems extend the digital revolution to almost every aspect of our lives by bridging the gap between the digital and physical worlds. These systems demand unprecedented timeliness and reliability guarantees that the current operating and network systems do not provide. Transport layer protocols are the direct communication interface for the application layer and, hence, are key to providing end-to-end guarantees to the application. This thesis addresses how transport layer protocols should be designed to support cyber-physical systems. A clear candidate is the Predictably Reliable Real-time Transport (PRRT) protocol, which provides the application with a predictably reliable service within the specified time budget. This thesis makes original contributions to PRRT’s error control function, which decides when and how much redundancy must be transmitted to meet the reliability and delay requirements of the application. The main contributions of this thesis are threefold: i) the SHARQ algorithm, which obtains the optimal error control configuration meeting the application constraints, and has been optimized to achieve predictably quick reactions to channel changes, ii) the DeepSHARQ algorithm, which leverages neural networks and a novel output regularization method to bring this predictability to resource-constrained devices, and iii) a systematic analysis of binary codes as an energy-efficient alternative for error coding at the transport layer, questioning the long-held belief that Vandermonde codes are a more suitable alternative due to their better error correction capabilities.

Thomas BOCK
Emerging Organizational Patterns in Evolving Open-Source Software Projects: An Analysis of Developer Activity and Coordination
(Advisor: Prof. Sven Apel)
Tuesday, 04.06.24 14:00 h , building E1 1, room 206

Many popular and widely-used software projects are organized and developed as open-source software (OSS) projects, which are able to attract a high number of contributors who develop source code or participate in public communication channels. When multiple developers contribute to the source code of a project simultaneously, proper coordination among them is necessary to avoid unexpected interactions and to reduce the risk of introducing bugs, which are often caused by a lack of coordination or by problems in the organizational structure of the project. Consequently, to improve developer coordination in OSS projects, it is essential to understand the organizational structure of these projects, which sometimes are seen as self-organizing communities. For that reason, we analyze the organizational structure of OSS projects and how it evolves over time, by means of five different empirical studies on widely-used and well-known OSS projects. With our studies, we address three different aspects: the evolution of developer collaboration and communication, the identification of developer roles, and the relation between organizational events and developer-network characteristics. We devise multiple methods to comprehensively analyze developers‘ programming and communication activities in OSS projects and demonstrate the applicability of the proposed methods. In summary, we obtain insights into the organizational structure of OSS projects that shall serve as a foundation for future improvement of coordination processes.

Daniel WAGNER
Improving Reactive Capabilities of Internet Peering Infrastructure in Stressful Situations
(Advisor: Prof. Anja Feldmann)
Monday, 03.06.24 16:00 h , building E1 4, room 0.24

The Internet has revolutionized communication, entertainment, and access to information since its inception. All of this depends on a resilient Internet infrastructure. Resilience is threatened both by analog and digital stress situations. Analog stress situations include, e.g., a global pandemic, and digital stress situations include, e.g., attacks in the Internet.
In this thesis, we investigate how the Internet can handle both analog and digital stress situations. We use a diverse set of Internet vantage points to measure the stress situations and propose conceptual, reactive, and proactive solutions to improve the overall resilience of the Internet.

May

Min CHEN
Understanding and Assessment of Privacy Risks in Machine Learning Systems
(Advisor: Prof. Michael Backes)
Wednesday, 22.05.24 14:00 h , building E9 1, room 0.07

Data is one of the major factors driving the rapid development of machine learning systems. While achieving state-of-the-art performance in many tasks, they are often trained on sensitive data, which may compromise privacy. In this talk, Min will first briefly introduce her research on machine unlearning techniques, which aim to understand the privacy implications of machine learning systems through the lens of privacy laws. She will then discuss her recent findings regarding privacy risks inherent in different machine learning models and explain how to mitigate these privacy risks. Finally, she will conclude the talk by discussing emerging and future research directions for designing privacy-preserving machine learning systems.

 

Tahleen A. RAHMAN
An analysis of Privacy and Group Fairness issues of Online Social Network and Fitness Tracker users
(Advisor: Prof. Michael Backes)
Tuesday, 14.05.24 14:00 h , building E9 1, room 2.22

The advent of smart handheld and wearable device technologies along with advances in the field of Artificial Intelligence and Machine Learning have progressively changed people’s lifestyle immensely over the last decade. Among them, Online Social Networks (OSNs) and fitness trackers have become integral parts of daily lives of millions of people around the world. In addition to offering a wide range of functionalities, these tools allow people to share huge amounts of data everyday, which becomes a serious concern from the privacy point of view. Moreover, the machine learning algorithms which are at the core of many features offered by OSNs and fitness trackers are quite sensitive to bias that is prevalent in the training data.
This dissertation presents an analysis of privacy and fairness issues that arise out of downstream processing of such user generated data. We first present an analysis of privacy for multiple scenarios namely: inference of user location, social relationships, sensitive user attributes namely gender, age and education as well as user linkability along the temporal dimension. We demonstrate the severity of the privacy attacks by an extensive evaluation on real life datasets and derive key insights. We introduce a
system called Tagvisor, that uses various obfuscation techniques for thwarting one of the attacks, namely location inference from hashtags. Secondly, we analyze the fairness of node2vec, a popular graph embedding method, which we use in our analysis of OSNs.
Our experiments demonstrate the existence of bias in node2vec when used for friendship recommendation. We propose a fairness-aware embedding method, namely Fairwalk, which extends node2vec and demonstrate that Fairwalk reduces bias under multiple fairness metrics while still preserving the utility.

Moritz BÖHLE
Towards Designing Inherently Interpretable Deep Neural Networks for Image Classification
(Advisor: Prof. Bernt Schiele)
Friday, 03.05.24 14:15 h , building E1 4, room 0.24

Over the last decade, Deep Neural Networks (DNNs) have proven successful in a wide range of applications and hold the promise to have a positive impact on our lives. However, especially in high-stakes situations in which a wrong decision can be disastrous, it is imperative that we can understand and obtain an explanation for a model’s ‘decision’. This thesis studies this problem for image classification models from three directions. First, we evaluate methods that explain DNNs in a post-hoc fashion and highlight promises and shortcomings of existing approaches. Second, we study how to design inherently interpretable DNNs. In contrast to explaining the models post hoc, this approach not only takes the training procedure and the DNN architecture into account, but also modifies them to ensure that the decision process becomes inherently more transparent. In particular, two novel DNN architectures are introduced: the CoDA and the B-cos Networks. For every prediction, the computations of those models can be expressed by an equivalent linear transformation. As the corresponding linear matrix is optimised during training to align with task-relevant input patterns, it is shown to localise relevant input features well and thus lends itself to be used as an explanation for humans. Finally, we investigate how to leverage explanations to guide models during training, e.g., to suppress reliance on spuriously correlated features or to increase the fidelity of knowledge distillation approaches.

Benedikt WAGNER
Techniques for Highly Efficient and Secure Interactive Signatures
(Advisor: Dr. Julian Loss)
Thursday, 02.05.24 16:00 h , building E9 1, room 0.05

In this dissertation, we develop new techniques to construct variants of digital signatures, specifically blind signatures, multi-signatures, and threshold signatures. Our constructions are efficient and achieve strong security notions based on well-studied non-interactive assumptions. To mention one example, existing constructions of blind signatures are inefficient, insecure for many concurrent signing interactions, or rely on non-standard assumptions. This is true even in the random oracle model. In our work, we design the first blind signature schemes based on conservative assumptions that are fully secure and concretely efficient. Other results include tightly-secure two-round multi-signatures in pairing-free groups, and threshold signatures with full security against an adaptive adversary. In the talk, I will give an overview of these results, with a special focus on the results on threshold signatures, and conclude with open problems for future work.

April

Alessandro ERBA
Security Aspects of Anomaly Detection for Cyber-Physical Systems
(Advisor: Dr. Nils Ole Tippenhauer)
Tuesday, 29.04.24 14:00 h , building E9 1, room 0.01

Cyber-Physical Systems (CPS) autonomously accomplish tasks in the physical environment. CPS employs computational resources, sensor, actuators, and communication protocols. Examples of such systems are Industrial Control Systems (ICS) and Unmanned Aerial Vehicles (UAV). Their security is of primary importance in our society. Attacks on such systems occurred in the past, harming humans, and causing environmental pollution, and economic losses. To mitigate the risk of attacks on CPS, anomaly detection (AD) techniques have been proposed. In this thesis, we systematically assess the security of CPS and the security aspects of anomaly detection. First, we explore the security of modern ICS protocols and show how deploying secure systems is often impossible. Second, we investigate the security of UAVs, we propose Sensor Deprivation Attacks, a novel attack vector that enables adversarial control of the victim vehicle, the proposed attacks are stealthy from state-of-the-art UAVs AD. Third we investigate the security aspects of anomaly detection for CPS when targeted with concealment attacks for classifier evasion. We evaluate the robustness of process-based AD proposed in the literature against attacks that aim to conceal process anomalies. We propose three frameworks to assess the security of AD by exploring attacker constraints, detection properties, and minimal perturbation boundaries. Our proposed frameworks enable the first systematic security analysis of CPS anomaly detectors.

Johnnatan Messias Peixoto AFONSO
On Fairness Concerns in the Blockchain Ecosystem
(Advisor: Prof. Krishna Gummadi)
Thursday, 25.04.24 13:00 h , building E1 5, room 0.29

Blockchains revolutionized centralized sectors like banking and finance by promoting de-centralization and transparency. In a blockchain, information is transmitted through transactions issued by participants or applications. Miners crucially select, order, and validate pending transactions for block inclusion, prioritizing those with higher incentives or fees. The order in which transactions are included can impact the blockchain final state.
Moreover, applications running on top of a blockchain often rely on governance protocols to decentralize the decision-making power to make changes to their core functionality. These changes can affect how participants interact with these applications. Since one token equals one vote, participants holding multiple tokens have a higher voting power to support or reject the proposed changes. The extent to which this voting power is distributed is questionable and if highly concentrated among a few holders can lead to governance attacks.
In this thesis, we audit the Bitcoin and Ethereum blockchains to investigate the norms followed by miners in determining the transaction prioritization. We also audit decentralized governance protocols such as Compound to evaluate whether the voting power is fairly distributed among the participants. Our findings have significant implications for future developments of blockchains and decentralized applications.

Clayton M. GREENBERG
Evaluating Humanness in Language Models
(Advisor: Prof. Dietrich Klakow)
Wednesday, 24.04.24 16:15 h , building E1 7, room 008

Advances with language models, systems that predict upcoming words in context, have enabled an era in which people sometimes cannot distinguish between human-written and artificially created text. Perplexity, the simplest and most popular way to evaluate the quality of a language model, rewards any pattern captured by the system as long as it robustly constrains the upcoming possibilities. By capturing patterns that humans do not use, optimizing a language model for minimal perplexity could trigger a divergence between the most probable text and the most human-like text.
In this thesis, I argue that this divergence has happened for state-of-the-art language models. Part I characterizes the kinds of knowledge captured by language models. First, I present three novel language model architectures whose neural connections were inspired by human behavior. Then, I discuss novel morphology- and sentiment-based paradigms that capture human knowledge quantitatively. Part II establishes several methods for evaluating language models by comparison against human behavior measures. I consider the suitability and potential confounds for offline ratings and two paradigms of online reading times: eye-tracking and G-Maze. Then, I use a novel dataset of G-Maze response times to show computational and linguistic evidence of the divergence.

Dingfan CHEN
Towards Privacy-preserving Machine Learning: Generative Modeling and Discriminative Analysis
(Advisor: Prof. Mario Fritz)
Tuesday, 23.04.24 11:00 h , building E9 1, room 0.05

The digital era is characterized by the widespread availability of rich data, which has fueled the growth of machine learning applications across diverse fields. Nevertheless, data sharing is often at odds with serious privacy and ethical issues. The sensitive nature of personal information necessitates careful handling and adherence to stringent regulations like GDPR and HIPAA. Addressing such privacy challenges is pivotal for maintaining public trust and ensuring sustainable technological progress.
This talk presents several projects on data privacy in machine learning completed during the speaker’s Ph.D. studies, including exploration of privacy-preserving generative modeling, privacy attack and defense mechanisms, and practical applications for responsible data sharing within real-world sensitive domains.

Florian SATTLER
Understanding Variability in Space and Time – Analyzing Features and Revisions in Concert
(Advisor: Prof. Sven Apel)
Monday, 15.04.24 14:00 h , building E1 1, room 2.06

The static or dynamic analysis of configurable software systems imposes significant challenges regarding complexity and computation time due to the software systems’ large configuration spaces. These are aggravated further by the evolution of software systems: developers frequently produce new revisions, adapting and modifying the system. Thereby, analysis results can quickly become out of date or are difficult to interpret. The key problem is that current analyses, even when already specialized for configurable software systems, cannot contextualize their findings within the development context of the software project in question.
We address this problem by empowering existing program analyses through a unified abstraction of code regions that incorporates information about the configurability of the system as well as the evolutionary context into the analysis. This way, we enable existing program analyses to relate and interpret their results in the context of variability. In this thesis, we demonstrate the applicability of a uniform abstraction of code regions by addressing two novel research problems:
First, we combine evolutionary information, mined from software repositories, with an inter-procedural data-flow analysis to determine how evolutionary changes interact within a software project, revealing new and interesting connections between changes and developers.
Second, we combine different automated localization approaches that detect configuration-specific code with state-of-the-art performance profilers to enable configuration-aware performance profiling.
Our results show that this enables performance profilers to attribute performance regressions directly to configuration options without introducing unnecessary overhead. In summary, this thesis bridges the gap between variability information and precise program analysis.

Soshi SHIMADA
Physically plausible 3D human motion capture and synthesis with interactions
(Advisor: Prof. Christian Theobalt)
Thursday, 04.04.24 10:30 h , building E1 4, room 0.24

Capturing 3D human motion realistically from a minimal setup, such as a single RGB camera, is challenging and important for downstream applications like AR/VR, avatar communications, and character animations. The problem becomes more challenging when the person in the scene interacts with a complex environment or when interactions lead to non-rigid deformations. This thesis addresses these challenges by explicitly introducing 1) physics-based equations and/or 2) modeling of rigid/non-rigid interactions with the environment, thereby enhancing the realism of the reconstructed 3D motions. Moreover, the thesis expands its focus to include the synthesis of 3D hand-object interaction motions, which are conditioned by the physical properties of the objects for improved realism and greater control over the generated motions.

March

Debasmita LOHAR
Expanding the Horizons of Finite-Precision Analysis
(Advisor: Prof. Eva Darulova, now Uppsala Univ.)
Wednesday, 27.03.24 15:00 h , building E1 5, room 0.29

Finite-precision programs, prevalent in embedded systems, scientific computing, and machine learning, inherently introduce numerical uncertainties stemming from noises in the inputs and finite-precision errors. Furthermore, implementing these programs on hardware necessitates a trade-off between accuracy and efficiency. Therefore, it is crucial to ensure that numerical uncertainties remain acceptably small and to optimize implementations for accurate results tailored to specific applications. Existing analysis and optimization techniques for finite-precision programs face challenges in scalability and applicability to real-world scenarios. In this work, we expand the individual capabilities of these techniques by capturing the impact of uncertain inputs on discrete decisions and roundoff errors, by scaling floating-point verification for larger programs, and by specializing optimization for feed-forward deep neural networks.

Mang ZHAO
Provable Security and Real-World Protocols: Theory and Practice
(Advisor: Prof. Cas Cremers)
Monday, 18.03.24 13:00 h , building E9 1, room 0.05

In our modern life, network communication has become one of the primary mediums for information transmission, e.g., instant messaging, online shopping, and video conferencing. In order to protect the security of information transmitted over networks, real-world applications are often equipped with cryptographic communication protocols, the provable security analyses of which are however often missing. A natural question arises: whether these protocols really secure?
This talk presents five projects that the speaker have completed during his Ph.D studies, with more focus on two of them: the theoretical analysis of authenticated encryption with associated data and the provable security analysis of real-world video-conferencing Zoom protocol. Moreover, this talk addresses common obstacles to (large-scale) protocol designs and provable security analyses, provides intuition on the feasibility, and presents his future plan.

Gustavo ANDRADE DO VALE
Investigating the Merge Conflict Life-Cycle Taking the Social Dimension into Account
(Advisor: Prof. Sven Apel)
Monday, 11.03.24 16:00 h , building E1 1, room 206

Merge conflicts arise when developers integrate concurrent code changes and whereas merge conflicts are common to introduce, they bring several issues to software projects. For instance, merge conflicts distract developers from their workflow and resolving them is a difficult, time-consuming, and often error-prone task. Despite a substantial number of studies investigating merge conflicts, the social dimension of the problem is often ignored. In this thesis, we seek out to understand the role the social dimension plays in the merge conflict life-cycle. To reach our goals, we conducted a series of empirical studies investigating the merge conflict life-cycle. In one of these studies we found that active GitHub communication is not associated with the emergence or avoidance of merge conflicts even though developers communicate with each other. In another study, we moved to the end of the merge conflict life-cycle investigating the challenges and factors related to the merge conflict resolution. Our results show that measures indirectly related to mer-ge conflicts (i.e., measures related to the merge scenario changes) are more strongly correlated with merge conflict resolution time than measures directly related to merge conflicts (i.e., merge conflict characteristics). In this thesis, we call the attention of researchers, tool builders, and practitioners to the importance of including the social dimension when investigating merge conflicts. Our findings also provide evidence that they should also look at the technical dimension more closely.

Mohamed ALZAYAT
Efficient Request Isolation in Function-as-a-Service
(Advisors: Prof. Peter Druschel & Prof. Deepak Garg)
Friday, 08.03.24 14:00 h , building E1 5, room 0.02

As cloud applications become increasingly event-driven, Function-as-a-Service (FaaS) is emerging as an important abstraction. FaaS allows tenants to state their application logic as stateless functions without managing the underlying infrastructure that runs and scales their applications. FaaS providers ensure the confidentiality of tenants’ data, to a limited extent, by isolating function instances from one another. However, for performance considerations, the same degree of isolation does not apply to sequential requests activating the same function instance. This compromise can lead to confidentiality breaches since bugs in a function implementation or its dependencies may retain state and leak data across activations. Moreover, platform optimizations that assume function statelessness may introduce unexpected behavior if the function retains state, jeopardizing correctness.
This dissertation presents two complementary systems: Groundhog and CtxTainter. Groundhog is a black-box and programming-language-agnostic solution that enforces confidentiality by efficiently rolling back changes to a function’s state after each function activation, effectively enforcing statelessness by breaking all data flows at the request boundary. CtxTainter is a development-phase dynamic data flow analysis tool that detects data flows that violate the statelessness assumption and reports them to the developer for reviewing and fixing.

February

Toghrul KARIMOV
Algorithmic Verification of Linear Dynamical Systems
(Advisor: Prof. Joël Ouaknine)
Thursday, 08.02.24 15:00 h , building E1 5, room 0.29

Linear dynamical systems (LDS) are mathematical models widely used in engineering and science to describe systems that evolve over time. In this thesis, we study algorithms for various decision problems of discrete-time linear dynamical systems. Our main focus is the Model-Checking Problem, which is to decide, given a linear dynamical system and an omega-regular specification, whether the trajectory of the LDS satisfies the specification. Using tools from various mathematical disciplines, most notably algebraic number theory, Dio-phantine approximation, automata theory, and combinatorics on words, we prove decidability of the Model-Checking Problem for large classes of linear dynamical systems and omega-regular properties. We further exploit deep connections between linear dynamical systems and contemporary number theory to show that improving any of our decidability results would amount to major mathematical breakthroughs. Our results delineate the boundaries of decision problems of linear dynamical systems that, at the present time, can be solved algorithmically.

Pascal GRITTMANN
Rethinking multiple importance sampling for general and efficient Monte Carlo rendering
(Advisor: Prof. Philipp Slusallek)
Tuesday, 06.02.24 9:00 h , building D3 2, room -1.63 (VisCenter)

Computer generated images are essential for many applications from art to engineering. Unfortunately, rendering such images is costly, with render times easily in the hours, days, or even weeks. On top of that, the demands regarding complexity and visual fidelity are ever rising. Consequently, there is an insatiable need for faster rendering. Efficient render times are often achieved through user intervention. For example, modifying the scene and removing difficult lighting effects can keep render times below an acceptable threshold. Also, algorithm parameters can be tuned manually. For instance, diffuse outdoor scenes are best rendered by unidirectional path tracing, while interiors featuring caustics benefit greatly from bidirectional sampling. Such manual tuning, however, is unfortunate as it puts much burden on the user and poses a hurdle for novices. In this thesis, we pave the way for more universal rendering algorithms with less need of user intervention. For that, we revisit multiple importance sampling (MIS), an essential tool to universalize rendering algorithms by combining diverse sampling techniques. We identify hitherto unknown shortcomings of MIS and propose practical solutions and improvements. As a tangible result, we achieve adaptive bidirectional rendering with performance never worse than unidirectional path tracing.

Sanem GHORBANI LYASTANI
Studying User Experience and Acceptance of Web Authentication Solutions
(Advisor: Prof. Michael Backes)
Monday, 05.02.24 14:00 h , building E9 1, room 0.01

To improve the security of their web authentication, users can employ password managers, set up two-factor authentication, or replace passwords with FIDO2 authenticator devices. However, for those solutions to be accepted by the user, their user experience must match the users‘ mental models. This thesis contributes the novel methodologies and results of three studies that measured the user experience and acceptance of three web authentication solutions. Our results show that a) whether password managers are beneficial for security or aggravate existing problems depends on the users’ strategies and how well the manager supports the users’ individual password management right from the time of password creation; b) users consider FIDO2 passwordless authentication as more usable and more acceptable than password-based authentication, but also that impeding concerns remain that are rooted in a gap between the user’s personal perspective onto this new technology and the global view of the FIDO2 designers; c) there is a lack of consistency be-tween the two-factor authentication user journeys of top websites and that the more con-sistent design patterns are problematic for usability, which could increase users‘ cognitive friction and lead to rejection. Based on those results, we make suggestions for further re-search into understanding and improving the users‘ experience of web authentication

January

Marcel KÖSTER
Improving Performance of Simulations and Heuristic Optimization on GPUs
(Advisor: Prof. Antonio Krüger)
Tuesday, 30.01.24 13:00 h , building D3 2, Reuse meeting room

Parallelization is a ubiquitous technique for improving runtime performance of algorithms. Although parallelization is generally challenging and often leads to programming bugs, it is a leading method for processing growing amounts of data today. Due to the ongoing trend of exploring the unexplored, known methods are reaching their limits in terms of scalability and thus applicability. Particularly challenging is the use of graphics processing units (GPUs) that require specially optimized algorithms but feature impressive compute power. Unfortunately, the term „optimized“ usually refers to newly developed algorithms that exploit the peculiarities of the underlying GPUs or at least follow their specific programming method-ologies. The list of tweaked algorithms available for GPUs is already quite long and touch a wide range of domains. These include the well-known fields of massively parallel simulations and solving of optimization problems. Prominent examples in this context include particle simulations of physical processes (like molecular-dynamics simulations) and machine-learning based optimizers. However, existing approaches from these two domains often suffer from severe runtime, memory consumption, and applicability limitations. In this thesis, we present new approaches for both domains. Our methods considerably outperform current state of the art in terms of runtime and memory consumption. We were able to achieve runtime speedups of up to several orders of magnitude while reducing the amount of memory required compared to existing methods. Regarding applicability, our algorithms are designed to fit seamlessly into existing simulation programs and optimizers. This makes them a particularly valuable contribution to real-world applications as well.

Edith TRETSCHK
Representing and Reconstructing General Non-Rigid Objects with Neural Models
(Advisor: Prof. Christian Theobalt)
Monday, 29.01.24 15:00 h , building E1 4, room 0.23

Despite a lot of effort, creating virtual clones of real-world objects remains an unsolved scientific challenge. While human-centered approaches are already advanced, the handling of general deformable objects is far less explored and the topic of this thesis. To digitize an object, it first needs to be reconstructed from sensor observations and then re-presented in a suitable manner for downstream tasks. Over the past decade, neural techniques have led to great advancement in both areas.
This thesis contributes to both areas. In the first part, it focuses on representing deformations and geometry. In particular, it introduces a low-dimensional deformation model. Unlike prior work that hand-crafts these for specific categories, it can be trained for any general non-rigid object category via mesh auto-encoding using graph convolutions. Next, coordinate-based networks model geometry at infinite resolution but they do not generalize due to their global representation. This thesis makes them generalizable, thereby making these new models much easier to apply to general objects where training data is lacking.
In the second part, this thesis advances the reconstruction side. It extends neural radiance fields, which were previously restricted to static scenes, to deformable objects. Finally, this thesis extends the previous method to handle large motions, a non-trivial endeavor due to backwards deformation modeling.

Christian KALTENECKER
Black-Box Performance Modeling of Configurable Software Systems
(Advisor: Prof. Sven Apel)
Monday, 29.01.24 13:00 h , building E1 1, room 2.06

Configurable software systems provide a multitude of configuration options to adjust and optimize the performance of the software. However, it is often unclear which configuration options influence the performance of the system. To achieve clarity, measuring every configuration of a system is intractable for many configurable systems due to the sheer number of configurations. In a first step, we propose a sampling strategy used in combination with statistical machine learning to identify the influence of configuration options on the performance. This way, our approach overcomes multiple disadvantages of existing approaches.
Furthermore, the performance influence of configuration options can change over time, for instance, by introducing performance regressions, and these performance regressions can, in some cases, be detected only in certain workloads.
However, it is often unclear which configuration options are affected by performance changes. In a second step, to address this gap, we propose an approach to pinpoint such performance changes over time and workloads. Among other findings, we found that developers mentioned the configuration options that are affected by performance changes, although performance regressions are only rarely directly reported.

Marius MOSBACH
Analyzing Pre-trained and Fine-tuned Language Models
(Advisor: Prof. Dietrich Klakow)
Thursday, 18.01.24 17:30 h , building C9 3 (Graduate Center)

Since the introduction of transformer-based language models in 2018, the current generation of natural language processing (NLP) models continues to demonstrate impressive capabilities on a variety of academic benchmarks and real-world applications. This progress is based on a simple but general pipeline which consists of pre-training neural language models on large quantities of text, followed by an adaptation step that fine-tunes the pre-trained model to perform a specific NLP task of interest. However, despite the impressive progress on academic benchmarks and the widespread deployment of pre-trained and fine-tuned language models in industry we still lack a fundamental under-standing of how and why pre-trained and fine-tuned language models work, as well as they do. My PhD thesis makes several contributions towards improving our understanding of pre-trained and fine-tuned language models ranging ranging from analyzing the lingu-istic knowledge of pre-trained language models and how it is affected by fine-tuning, to a rigorous analysis of the fine-tuning process itself and how the choice of adaptation technique affects the generalization of models. We thereby provide new insights about previ-ously unexplained phenomena and the capabilities of pre-trained and fine-tuned language models.

Markus BAUER
Compiler-based Defenses against Code Execution Attacks
(Advisor: Prof. Christian Rossow)
Thursday, 11.01.24 13:00 h , building E9 1, room 0.01

Memory corruption attacks have haunted computer systems for decades. Attackers abuse subtle bugs in an application’s memory management, corrupting data and executing arbitrary code and, consequently, taking over systems. In particular, C and C++ applications are at risk, while developers often fail or lack time to identify or rewrite risky parts of their software.
In this thesis, we approach this problem with compilers that protect applications without requiring code changes or developer effort. We cover the most treated aspects in legacy applications: indirect forward jumps in both C and C++ and immutable libraries. First, we protect virtual dispatch in C++ applications from hijacking. We employ a type analysis and a compiler transformation that implements virtual dispatch efficiently without hijackable pointers. Second, we protect indirect calls to function pointers in C applications. We use a new type-based analysis to find indirect call targets and transform indirect calls into a secure and fast version with limited targets. Finally, we propose a method to isolate potentially vulnerable code, particularly unprotected closed-source libraries, into compartments with restricted access to its environment.

2023

December

Charilaos ZISOPOULOS
On the expected number of zeros of polynomials and the real tau-conjecture
(Advisor: Prof. Markus Bläser)
Tuesday, 19.12.23 14:00 h , building E1 7, room 0.01

The central open problem in Algebraic Complexity Theory is the VP versus VNP question, which can be thought of as the algebraic analogue of the classical P versus NP question. In fact, settling the former question is considered as a first step towards the latter. One approach towards resolving the VP versus VNP question is the real tau-conjecture, which states that if every sum of products of k-sparse univariate polynomials has a number of real roots bounded polynomially by the number of summands, factors, and the sparsity k, then VP is not equal to VNP. Unsurprisingly, solving the real tau-conjecture has proven difficult, thus research has shifted towards randomized versions of the conjecture. Our contribution is studying the expected number of real zeros of random k-sparse polynomials. In particular, we show that for k-sparse univariate polynomials whose coefficients are standard normal random variables, the expected number of real roots is upper bounded asymptotically by the square root of the sparsity k. This result is complemented by an asymptotically matching lower bound, that completely settles this question in the univariate setting, as well as observations about the distribution of zeros of such polynomials. In ad-dition, we show that previous work can be adapted to the sparse case, thus providing an upper bound for the case where the coefficients of the polynomial follow the Rademacher distribution. This work also surveys previously known results on the number of real zeros of fixed and random polynomials, while also presenting a detailed analysis of results due to Descartes and Laguerre.
We also generalize the techniques used to random k-sparse polynomials following absolutely continuous distributions, as well as propose research questions and goals that we believe both merit further investigation, both with the aim to identify the next steps to-wards resolving the conjecture.

Aniss MAGHSOUDLOU
Towards Uncovering Hidden Internet Traffic Characteristics
(Advisor: Prof. Anja Feldmann)
Thursday, 14.12.23 14:00 h , building E1 5, room 0.02

With the growing digitization of human life, the Internet has become an inevitable utility. Since the Internet is designed in a non-centralized manner with a best-effort mindset, it is essential to measure different aspects of the Internet including security, performance, and scalability. The rise of remote work has emphasized the need for measuring security of the Internet traffic.In this thesis, we first address the need for measuring large-scale Internet traffic to gain useful insights into the security and traffic trends in large Internet Service Providers (ISPs) and Internet eXchange Points (IXPs) by designing a system called Flowyager for querying network-wide flow data in a near real-time manner. Next, we propose FlowDNS to augment flow data with domain names to infer the actual service/domain to which the traffic belongs. This system lays the foundation for monitoring the services that are being used and gives network operators the chance to predict their bandwidth demands. To gain a more comprehensive picture, we need to combine the results from the above-mentioned systems with active measurement techniques. This gives us the chance to discover the existence and origin of hidden characteristics of the Internet traffic. For instance, in a large European ISP, we detect a large amount of Internet traffic using port number 0 when querying Flowyager. Complementing passive measurement results with active measurement techniques, we find that this traffic is mostly caused by fragmentation, scanning, and misconfigured devices.
Finally, given the widespread usage of Virtual Private Networks (VPNs) during the COVID-19 pandemic for remote work, we strive to characterize VPN traffic in the Internet. We use active measurement techniques to detect VPN servers and analyze their security aspects. Then, with the help of FlowDNS, we detect VPN traffic on the Internet to provide insights about the VPN traffic patterns in the Internet.
This dissertation helps researchers and network operators to gain insights about some hidden characteristics of Internet traffic, and also provides the means to look for specific traffic patterns in the network flow data and investigate its characteristics.

Torsten  SPIELDENNER
Linked Data as Medium for distributed Multi-Agent Systems
(Advisor: Prof. Philipp Slusallek)
Wednesday, 13.12.23 09:15 h , building D3 4, VisRoom (-1.63)

The conceptual design and discussion of multi-agent systems (MAS) typically focuses on agents and their models, and the elements and effects in the environment which they perceive. This view, however, leaves out potential pitfalls in the later implementation of the system that may stem from limitations in data models, interfaces, or protocols by which agents and environments exchange information. By today, the research community agrees that for this, that the environment should be understood as well as abstraction layer by which agents access, interpret, and modify elements within the environment. This, however, blurs the the line of the environment being the sum of interactive elements and phenomena perceivable by agents, and the underlying technology by which this information and interactions are offered to agents.
This thesis proposes as remedy to consider as third component of multi-agent systems, besides agents and environments, the digital medium by which the environment is provided to agents. „Medium“ then refers to exactly this technological component via which environment data is published interactively towards the agents, and via which agents perceive, interpret, and finally, modify the underlying environment data. Furthermore, this thesis will detail how MAS may use capabilities of
a properly chosen medium to achieve coordinating system behaviors. A suitable candidate technology for digital agent media comes from the Semantic Web in form of Linked Data. In addition to conceptual discussions about the notions of digital agent media, this thesis will provide in detail a specification of a Linked Data agent medium, and detail on means to implement MAS around Linked Data media technologies.

Michael  SAMMLER
Automated and Foundational Verification of Low-Level Programs
(Advisors: Prof. Derek Dreyer and Prof. Deepak Garg)
Monday, 04.12.23 17:00 h , building E1 5, room 0.29

Formal verification is a promising technique to ensure the reliability of low-level programs like operating systems and hypervisors, since it can show the absence of whole classes of bugs and prevent critical vulnerabilities.
To realize the full potential of formal verification for real-world low-level programs, however one has to overcome several challenges, including:
(1) dealing with the complexities of realistic models of real-world programming languages;
(2) ensuring the trustworthiness of the verification, ideally by providing foundational proofs (i.e., proofs that can be checked by a general-purpose proof assistant);
and (3) minimizing the manual effort required for verification by providing a high degree of automation.
This dissertation presents multiple projects that advance formal verification along these three axes:
RefinedC provides the first approach for verifying C code that combines foundational proofs with a high degree of automation via a novel refinement and ownership type system.
Islaris shows how to scale verification of assembly code to realistic models of modern instruction set architectures-in particular, Armv8-A and RISC-V.
DimSum develops a decentralized approach for reasoning about programs that consist of components written in multiple different languages (e.g., assembly and C), as is common for low-level programs.
RefinedC and Islaris rest on Lithium, a novel proof engine for separation logic that combines automation with foundational proofs.

Krzysztof WOLSKI
Design and Applications of Perception-Based Mesh, Image, and Display-Related Quality Metrics
(Advisors: Dr.-Ing. habil. Karol Myszkowski and Prof. Hans-Peter Seidel)
Monday, 04.12.23 10:00 h , building E1 4, room 0.19

Computer graphics have become an integral part of our daily lives, enabling immersive experiences in movies, video games, virtual reality, and augmented reality. However, the various stages of the computer graphics pipeline, from content generation to rendering and display, present their own challenges that can reduce visual quality and thus degrade the overall experience.
Perceptual metrics are crucial for evaluating visual quality. However, many existing methods have limitations in reproducing human perception accurately, as they must account for the complexities of the human visual system. This dissertation aims to tackle these issues by proposing innovative advancements across different pipeline stages.
Firstly, it introduces a novel neural-based visibility metric to improve the assessment of near-threshold image distortions. Secondly, it addresses shortcomings of the mesh quality metrics, vital for enhancing the integrity of three-dimensional models. Thirdly, the dissertation focuses on optimizing the visual quality of animated content while considering display characteristics and a limited rendering budget. Finally, the work delves into the challenges specific to stereo vision in a virtual reality setting.
The ultimate objective is to enable the creation of more efficient and automated designs for virtual experiences, benefiting fields like entertainment and education. Through these contributions, this research seeks to elevate the standard of visual quality in computer graphics, enriching the way we interact with virtual worlds.

November

Denise KAHL
Visual-haptic Perception in the Digitally Augmented World
(Advisor: Prof. Antonio Krüger)
Wednesday, 29.11.23 14:30 h , building D3 2 (DFKI), Reuse Room

In everyday life, we are confronted with a growing amount of digital content that is integrated into our surroundings. Visual elements, such as digital advertising or information boards, change our perception of the environment and make it increasingly difficult to perceive personally meaningful information.
In this work, we investigate how visual augmentations of the environment affect our visu-al and haptic perception of reality and explore how visual attention can be directed as subtly as possible toward personally relevant information in real-world environments.
We present a concept to evaluate visual stimuli for gaze guidance in instrumented environments and explore stimuli suitable for gaze guidance in real-world settings using a prototypical implementation of it. Moreover, we explore the potential of using overlays displayed in Optical See-through Augmented Reality glasses to guide visual attention u-sing subtle visual cue stimuli.
Additionally, we introduce a concept to investigate perceptual changes in physical objects interacted with that may result from overlaying them with digital augmentations. We investigate the extent to which the overlying virtual model can differ from the underlying physical object without significantly affecting the feeling of presence, the usability, and the performance. We provide results in terms of shape and size differences and demonst-rate the influence of environmental lighting conditions.

Sebastian DALLEIGER
Characteristics and Commonalities – Differentially Describing Datasets with Insightful Patterns
(Advisor: Prof. Jilles Vreeken)
Thursday, 16.11.23 14:00 h , building E1 4, room 0.24

Empirical science revolves around gaining insights from complex data. With the advent of computational science, increasingly more, larger, and richer datasets are becoming avail-able to expand our scientific knowledge. However, the analysis of these datasets by domain experts is often impaired by a lack of suitable computational tools. In particular, there is a shortage of methods identifying insightful patterns, i.e., sets of strongly associated feature values that are informative, contrasting, probabilistically sound, statistically sound, and discoverable using scalable algorithms. This thesis leverages ideas and concepts from pattern-set mining, maximum-entropy modeling, statistical testing, and matrix factorization to develop methods for discovering insightful patterns.

October

Sihang PU
Towards Compact Bandwidth and Efficient Privacy-Preserving Computation
(Advisor: Dr. Nico Döttling)
Monday, 30.10.23 16:00 h , building E9 1, room 0.01

In traditional cryptographic applications, cryptographic mechanisms are employed to ensure the security and integrity of communication or storage. In these scenarios, the primary threat is usually an external adversary trying to intercept or tamper with the communication between two parties. On the other hand, in the context of privacy-preserving computation or secure computation, the cryptographic techniques are developed with a different goal in mind: to protect the privacy of the participants involved in a computation from each other. Specifically, privacy-preserving computation allows multiple parties to jointly compute a function without revealing their inputs and it has numerous applications in various fields, including finance, healthcare, and data analysis. It allows for collaboration and data sharing without compromising the privacy of sensitive data, which is becoming increasingly important in today’s digital age. While privacy-preserving computation has gained significant attention in recent times due to its strong security and numerous potential applications, its efficiency remains its Achilles’ heel. Privacy-preserving protocols require significantly higher computational overhead and bandwidth when compared to baseline (i.e., insecure) protocols. Therefore, finding ways to minimize the overhead, whether it be in terms of computation or communication, asymptotically or concretely, while maintaining security in a reasonable manner remains an exciting problem to work on.

Hiba ARNAOUT
Enriching Open-world Knowledge Graphs with Expressive Negative Statements
(Advisor: Prof. Gerhhard Weikum)
Friday, 27.10.23 09:00 h , building E1 4, room 0.24

Machine knowledge about entities and their relationships has been a long-standing goal for AI researchers. Over the last 15 years, thousands of public knowledge graphs have been automatically constructed from various web sources. They are crucial for use cases such as search engines. Yet, existing web-scale knowledge graphs focus on collecting positive statements, and store very little to no negatives. Due to their incompleteness, the truth of absent information remains unknown, which compromises the usability of the knowledge graph. In this dissertation: First, I make the case for selective materialization of salient negative statements in open-world knowledge graphs. Second, I present our methods to automatically infer them from encyclopedic and commonsense knowledge graphs, by locally inferring closed-world topics from reference comparable entities. I then discuss our evaluation findings on metrics such as correctness and salience. Finally, I conclude with open challenges and future opportunities.

Corinna COUPETTE
Beyond Flatland: Exploring Graphs in Many Dimensions
(Advisors: Dr. Christoph Lenzen and Dr. Bastian Rieck)
Monday, 23.10.23 09:00 h , Video conference

Societies, technologies, economies, ecosystems, organisms, . . . Our world is composed of complex networks—systems with many elements that interact in nontrivial ways. Graphs are natural models of these systems, and scientists have made tremendous progress in developing tools for their analysis. However, research has long focused on relatively simple graph representations and problem specifications, often discarding valuable real-world information in the process. In recent years, the limitations of this approach have become increasingly apparent, but we are just starting to comprehend how more intricate data representations and problem formulations might benefit our understanding of relational phenomena. Against this background, our thesis sets out to explore graphs in five dimensions:
descriptivity, multiplicity, complexity, expressivity, and responsibility.
Leveraging tools from graph theory, information theory, probability theory, geometry, and topology, we develop methods to (1) descriptively compare individual graphs, (2) characterize similarities and differences between groups of multiple graphs, (3) critically assess the complexity of relational data representations and their associated scientific culture, (4) extract expressive features from and for hypergraphs, and (5) responsibly mitigate the risks induced by graph-structured content recommendations. Thus, our thesis is naturally situated at the intersection of graph mining, graph learning, and network analysis.

Lukas FLOHR
Context-Based Prototyping of Human-Machine Interfaces for Autonomous Vehicles
(Advisor: Prof. Antonio Krüger)
Friday, 13.10.23, 15:00 h, building D3 2, DFKI, VisRoom NB – 1.63

Autonomous vehicles (AVs; SAE levels 4 and 5) face substantial challenges regarding acceptance, human factors, and user experience. Human-machine interfaces (HMIs) offer the potential to account for those and facilitate AV adoption. Since AVs‘ capabilities and availability are still limited, suitable prototyping methods are required to create, evaluate, and optimize novel HMI concepts from early development phases. In all human-centered design activities, physical and social contexts are vital. This thesis argues for applying context-based interface prototyping of human-AV interactions to account for their interrelation with contextual factors. We adopt a ‚research in and through design‘ approach and explore the two intertwined areas: design and prototyping. Regarding the latter, we concentrate on straightforward methods. We demonstrate an immersive video-based approach for lab simulation of AVs and a wizard-of-oz-based method for on-road AV simulation and prototyping of HMIs providing real-time information. We apply these methods in empirical studies to assess their suitability and explore HMI concepts created to counter the aforementioned challenges. Thereby we investigate the potential of (AR-based) object detection visualization and concepts for mobile and in-vehicle interaction with (shared) AVs. Based on the findings, we provide design and prototyping recommendations that will aid researchers and practitioners in creating suitable human-AV interactions.

Zheng LI
On the Privacy Risks of Machine Learning Models
(Advisor: Dr. Yang Zhang)
Thursday, 05.10.23, 15:00 h, building E9 1, Room 0.01

In this dissertation, we investigate the significant privacy risks in the era of advancing machine learning (ML) from two perspectives. Firstly, we explore vulnerabilities within ML models, with a specific focus on membership inference attacks (MIA). Through two studies, we unveil the severity of MIA by introducing a novel label-only attack and assessing the susceptibility of multi-exit networks. Secondly, we examine the misuse of ML models that compromise privacy, particularly in the context of deepfake face manipulation. To counter GAN-based face manipulation effectively, an innovative defense system called UnGANable is proposed to disrupt the crucial GAN inversion process. These findings provide valuable insights into privacy risks associated with ML models and emphasize the necessity for ongoing research vigilance in this rapidly evolving ML landscape.

August

Nick FISCHER
Algorithms for Sparse Convolution and Sublinear Edit Distance
(Advisor: Prof. Karl Bringmann)
Tuesday, 29.08.23, 15:00 h, building E1 4, Room 0.24

In this PhD thesis on fine-grained algorithm design and complexity, we investigate output-sensitive and sublinear-time algorithms for two important problems.
* Sparse Convolution: Computing the convolution of two vectors is a funda-mental algorithmic primitive. In the sparse convolution problem we assume that the input and output vectors have at most $t$ nonzero entries, and the goal is to design algorithms with running times dependent on $t$. For the special case where all entries are nonnegative, which is particularly important for algorithm design, it is known since twenty years that sparse convolutions can be computed in near-linear randomized time $O(t \log^2 n)$. In this thesis we develop a randomized algorithm with running time $O(t \log t)$ which is optimal (under some mild assumptions), and the first near-linear deterministic algorithm for sparse nonnegative convolution. We also present an application of these results, leading to seemingly unrelated fine-grained lower bounds against distance oracles in graphs.
* Sublinear Edit Distance: The edit distance of two strings is a well-studied si-milarity measure with numerous applications in computational biology. While computing the edit distance exactly provably requires quadratic time, a long line of research has lead to a constant-factor approximation algorithm in almost-linear time. Perhaps surprisingly, it is also possible to approximate the edit distance $k$ within a large factor $O(k)$ in sublinear time $\widetilde{O}(\frac nk + k^{O(1)})$. We drastically improve the approximation factor of the known sublinear algorithms from $O(k)$ to $k^{o(1)}$ while pre-serving the $O(\frac nk + k^{O(1)})$ running time.

Xinlei HE
Privacy Risk Assessment of Emerging Machine Learning Paradigms
(Advisor: Dr. Yang Zhang)
Wednesday, 16.08.23, 14:00 h, building E9 1, Room 0.01

Machine learning (ML) has progressed tremendously, and data is the key factor to drive such development. However, there are two main challenges regarding collecting the data and handling it with ML models. First, the acquisition of high-quality labeled data can be difficult and expensive due to the need for extensive human annotation. Second, to model the complex relationship between entities, e.g., social networks or molecule structures, graphs have been leveraged. However, conventional ML models may not effectively handle graph data due to the non-linear and complex nature of the relationships between nodes. To address these challenges, recent developments in semi-supervised learning and self-supervised learning have been introduced to leverage unlabeled data for ML tasks. In addition, a new family of ML models known as graph neural networks has been proposed to tackle the challenges associated with graph data. Despite being powerful, the potential privacy risk stemming from these paradigms should also be taken into account. In this dissertation, we perform the privacy risk assessment of the emerging machine learning paradigms. Firstly, we investigate the membership privacy leakage stemming from semi-supervised learning. Concretely, we propose the first data augmentation-based membership inference attack that is tailored to the training paradigm of semi-supervised learning methods. Secondly, we quantify the privacy leakage of self-supervised learning through the lens of membership inference attacks and attribute inference attacks. Thirdly, we study the privacy implications of training GNNs on graphs. In particular, we propose the first attack to steal a graph from the outputs of a GNN model that is trained on the graph. Finally, we also explore potential defense mechanisms to mitigate these attacks.

July

Trung Tin NGUYEN
Understanding and Measuring Privacy Violations in Android Apps
(Advisor: Prof. Michael Backes)
Tuesday, 25.07.23, 13:00 h, building E9 1, Room 0.01

Increasing data collection and tracking of consumers by today’s online services is becoming a major problem for individuals‘ rights. It raises a serious question about whether such data collection can be legally justified under legislation around the globe. Unfortunately, the community lacks insight into such violations in the mobile ecosystem.
In this dissertation, we approach these problems by presenting a line of work that provides a comprehensive understanding of privacy violations in Android apps in the wild and automatically measures such violations at scale. First, we build an automated tool that detects unexpected data access based on user perception when interacting with the apps‘ user interface. Subsequently, we perform a large-scale study on Android apps to understand how prevalent violations of GDPR’s explicit consent requirement are in the wild. Finally, un-til now, no study has systematically analyzed the currently implemented consent notices and whether they conform to GDPR in mobile apps. Therefore, we propose a mostly automated and scalable approach to identify the current practices of implemented consent notices. We then develop an automatic tool that detects data sent out to the Internet with different consent conditions.
Our result shows the urgent need for more transparent user interface designs to better inform users of data access and call for new tools to support app developers in this endeavor.

Mojtaba BEMANA
Efficient Image-Based Rendering
(Advisors: Dr. habil. Karol Myszkowski & Prof. Hans-Peter Seidel)
Wednesday, 12.07.23, 11:00 h, building E1 4, Room 0.19

Despite recent advancements in real-time ray tracing and deep learning for producing photo-realistic computer-generated images (CGI), the creation of CGI remains time-consuming and resource-intensive. Image-based rendering (IBR) provides an alternative by using pre-captured real-world images to generate realistic images in real-time, elimi-nating the need for extensive modeling. However, achieving faithful IBR reconstruction often requires dense scene sampling, leading to storage, capture, and processing challenges. Furthermore, IBR still struggles to offer the same level of control over scene attributes as traditional CG pipelines or accurately reproduce complex scenes and objects with materials like transparent objects. This thesis endeavors to address these issues by harnessing the power of deep learning and incorporating the fundamental principles of graphics and human perception. It offers an efficient solution that enables interactive manipulation of real-world dynamic scenes captured from sparse views, lighting positions, and times, as well as a physically-driven approach that enables accurate novel view synthesis of the refractive objects. Additionally, this thesis develops a visibility metric that can identify artifacts in the reconstructed IBR images without observing the reference image, thereby contributing to the design of an effective IBR acquisition pipeline. Lastly, a perception-driven rendering technique is developed to provide high-fidelity visual content in virtual reality displays while retaining computational efficiency.

Lars PREHN
Routegazing: Analysing the Evolving Internet Routing Ecosystem
(Advisor: Prof. Anja Feldmann)
Thursday, 06.07.23, 13:00 h, building E1 5, Room 002

The Internet’s routing ecosystem constantly evolves to meet the needs of its stakeholders and users. Tracking this evolution is essential, e.g., to identify business opportunities, address security challenges, or inform protocol design. However, most Internet protocols were designed without measurability in mind; hence, many measurements and inference methods rely on exploiting protocol-specific side effects.
This dissertation first assesses the limitations of our deployed observation infrastructures and commonly used inference methods via three orthogonal contributions: a case study on a European Internet Exchange Point to assess our visibility into the Internet’s AS topology; a framework to identify and measure biases in the placement of our vantage points across multiple dimensions; and a systematic analysis of the biases and sensitivity of AS relationship inference algorithms. We found that our view of the Internet’s AS topology diminishes over time, and that our AS relationship models are more biased and sensitive to short-term routing dynamics than previously assumed.
With these limitations in mind, we focused on one of the most critical routing ecosystem changes, IPv4 exhaustion, and two ways network operators can deal with it. First, we explored the IPv4 buying and leasing markets, identified market trends, and discussed the viability of these markets for different network types. Second, we analyzed the benefits, usage patterns, and disadvantages of announcing tiny address blocks—which we call „hyper-specific.“ We argue that a combination of leased IPv4 addresses and hyper-specific prefix announcements likely suffice for many networks to bridge the gap until full IPv6 adoption.
Besides its IPv6 adoption, the routing ecosystem also evolved in other dimensions. We first studied AS path prepending to assess the security implication of these changes. We found a typical configuration with no benefits yet an increase of an AS’s vulnerability to prefix hijacks. Infrastructural changes led to an overall decrease in prepending sizes over time and hence a safer use of the technique. However, we demonstrated that we can exploit the same changes to re-orchestrate prefix de-aggregation attacks to overcome widely deployed prevention mechanisms. We validated our assumptions and attack model using a real-world testbed and proposed updates to existing prevention mechanisms. Our two-stage disclosure campaign contributed to a safer routing ecosystem.

Noemi PASSING
Compositional Synthesis of Reactive Systems
(Advisor: Prof. Bernd Finkbeiner)
Tuesday, 04.07.23, 16:30 h, building E1 7, Room 0.01

Synthesis is the task of automatically deriving correct-by-construction implementations from formal specifications. While it is a promising path toward developing verified programs, it is infamous for being hard to solve. Compositionality is recognized as a key technique for reducing the complexity of synthesis. So far, compositional approaches require extensive manual effort. In this thesis, we introduce algorithms that automate these steps.
In the first part, we develop compositional synthesis techniques for distributed systems. Providing assumptions on other processes‘ behavior is fundamental in this setting due to inter-process dependencies. We establish delay-dominance, a new requirement for im-plementations that allows for implicitly assuming that other processes will not maliciously violate the shared goal. Furthermore, we present an algorithm that computes explicit assumptions on process behavior to address more complex dependencies.
In the second part, we transfer the concept of compositionality from distributed to single-process systems. We present a preprocessing technique for synthesis that identifies independently synthesizable system components. We extend this approach to an incremental synthesis algorithm, resulting in more fine-grained decompositions. Our experimental evaluation shows that our techniques automate the required manual efforts, resulting in fully automated compositional synthesis algorithms for both distributed and single-process systems.

Tobias STARK
Real-Time Execution Management in the ROS 2 Framework
(Advisor: Dr. Björn Brandenburg)
Tuesday, 04.07.23, 10:00 h, building E1 7, Room 0.01

Over the past decade, the ROS ecosystem has emerged as the most popular repository of opensource robotics software. As a result, many robots rely on ROS-based software to make timing-critical decisions in real time. However, there is little evidence that real-time theory is used to analytically bound or control the worst-case response time in ROS components.
This dissertation identifies three main hurdles to adopt real-time theory in the context of ROS 2: first, the complex and non-obvious timing effects introduced by the ROS 2 frame-work; second, the expertise required to use real-time scheduling mechanisms correctly; and third, the inherent unpredictability of typical robotics workloads, which defy static provisioning.
To overcome these hurdles, the dissertation introduces a timing model for ROS 2 application, together with a response-time analysis that allows robotics developers to bound the worst-case response time of individual components and multi-component processing chains.
However, modeling and provisioning ROS 2 systems remains a cumbersome and error-prone task. In a second step, the dissertation hence proposes ROS-Llama, an automatic latency manager for ROS 2. ROS-Llama automatically controls the latency of a ROS 2 system through real-time scheduling, while requiring only little effort and no real-time scheduling expertise by the user. It runs in parallel with the deployed application and can therefore measure all required information without user involvement and adapt to changes at runtime. As part of ROS-Llama’s design, the dissertation discusses the conceptual and practical challenges in developing such an automatic tool, identifying relevant properties of ROS 2 and essential requirements of the robotics domain.

June

David I. ADELANI
Natural Language Processing for African Languages
(Advisor: Prof. Dietrich Klakow)
Tuesday, 27.06.23, 13:00 h, building C7 4, Conference room

Recent advances in pre-training of word embeddings and language models leverage large amounts of unlabelled texts and self-supervised learning to learn distributed representations that have significantly improved the performance of deep learning models on a large variety of natural language processing tasks. Similarly, multilingual variants of these models have been developed from web-crawled multilingual resources like Wikipedia and Common crawl. However, there are some drawbacks to building these multilingual representation models using these web texts. First, the models only include few low-resource languages in the training corpus, and additionally, the texts of these languages are often noisy or of low quality texts. Second, their performance on downstream NLP tasks is difficult to evaluate because of the absence of labelled datasets, therefore, they are typically only evaluated on English and other high-resource languages.
In this dissertation, we focus on languages spoken in Sub-Saharan Africa where all the indigenous languages in this region can be regarded as low-resourced in terms of the availability of labelled data for NLP tasks and unlabelled data found on the web. We analyse the noise in the publicly available corpora, and curate a high-quality corpus, demonstrating that the quality of semantic representations learned in word embeddings does not only depend on the amount of data but on the quality of pre-training data. We demonstrate empirically the limitations of word embeddings, and the opportunities the multilingual pre-trained language model (PLM) offers especially for languages unseen during pre-training and low-resource scenarios. We further study how to adapt and specialize multilingual PLMs to unseen African languages using a small amount of monolingual texts. To address the under-representation of the African languages in multilingual evaluations, we developed large scale human-annotated labelled datasets for 21 African languages in two impactful NLP tasks: named entity recognition and machine translation. We conduct an extensive empirical evaluation using state-of-the-art methods across supervised, weakly-supervised, and transfer learning settings.
In order to advance the progress of NLP for African languages, future work should focus on expanding benchmark datasets for African languages in other important NLP tasks like part of speech tagging, sentiment analysis, hate speech detection, and question answering. Another direction is to focus on development of Africa-centric PLMs. Lastly, research on speech that involves developing corpora and techniques that require zero or few paired speech-text data would be very essential for the survival of many under-resourced African languages.

Elena ARABADZHIYSKA-KOLEVA
Perceptually driven methods for improved gaze-contingent rendering
(Advisor: Prof. Piotr Didyk, now Univ. della Svizzera Italiana)
Wednesday, 21.06.23, 15:00 h, building E1 5, Room 0.29

Computer graphics is responsible for the creation of beautiful and realistic content. However, visually pleasing results often come at an immense computational cost, especially for new display devices such as virtual reality headsets. A promising solution to overcome this problem is to use foveated rendering, which exploits the limitations of the human visual system with the help of eye trackers. In particular, visual acuity is not uniform across the visual field but it is rather focused in its center and it is rapidly declining towards the periphery. Foveated rendering takes advantage of this feature by displaying high-quality content only at the gaze location, gradually decreasing it towards the periphery. While this method is effective, it is subject to some limitations. An example of such limitation is the system latency, which becomes noticeable during rapid eye movements when the central vision is exposed to low-resolution content, reserved only for the peripheral vision. Another example is the prediction of the allowed quality degradation, which is based solely on the visual eccentricity; however, the loss of the peripheral acuity is more complex and it relies on the image content as well.
This thesis addresses these limitations by designing new, perceptually-driven methods for gaze-contingent rendering. The first part introduces a new model for saccade landing position prediction to combat system latency during rapid eye movements. This method extrapolates the gaze information from delayed eye-tracking samples and predicts the saccade’s landing position. The new gaze estimate is then used in the rendering pipeline in order to forestall the system latency. The model is further refined by considering the idiosyncratic characteristics of the saccades. The second part of this thesis introduces a new luminance-contrast-aware foveated rendering technique, which models the allowed peripheral quality degradation as a function of both visual eccentricity and local luminance contrast. The advantage of this model lies in its prediction of the perceived quality loss due to foveated rendering without full-resolution reference. As a consequence, it can be applied to foveated rendering to achieve better computational savings.

Narges POURJAFARIAN
Physical Sketching Tools and Techniques for Customized Sensate Surfaces
(Advisor: Prof. Jürgen Steimle)
Wednesday, 07.06.23, 16:00 h, building E1 1, Room 2.06

Sensate surfaces are a promising avenue for enhancing human interaction with digital systems due to their inherent intuitiveness and natural user interface. Recent technological advancements have enabled sensate surfaces to surpass the constraints of conventional touchscreens by integrating them into everyday objects, creating interactive interfaces that can detect various inputs such as touch, pressure, and gestures. This allows for more natu-ral and intuitive control of digital systems. However, prototyping interactive surfaces that are customized to users‘ requirements using conventional techniques remains technically challenging due to limitations in accommodating complex geometric shapes and varying sizes. Furthermore, it is crucial to consider the context in which customized surfaces are utilized, as relocating them to fabrication labs may lead to the loss of their original design context. Additionally, prototyping high-resolution sensate surfaces presents challenges due to the complex signal processing requirements involved. This work investigates the design and fabrication of customized sensate surfaces that meet the diverse requirements of different users and contexts. The research aims to develop novel tools and techniques that overcome the technical limitations of current methods and enable the creation of sensate surfaces that enhance human interaction with digital systems.

May

Sebastian BIEWER
Software Doping – Theory and Detection
(Advisor: Prof. Holger Hermanns)
Thursday, 25.05.23, 15:15 h, building E1 7, Room 0.01

Software is doped if it contains a hidden functionality that is intentionally included by the manufacturer and is not in the interest of the user or society. This thesis complements this informal definition by a set of formal cleanness definitions that characterise the absence of software doping. These definitions reflect common expectations on clean software behaviour and are applicable to many types of software, from printers to cars to discriminatory AI systems. We use these definitions to propose white-box and black-box analysis techniques to detect software doping. In particular, we present a provably correct, model-based testing algorithm that is intertwined with a probabilistic-falsification-based test input selection technique. We identify and explain how to overcome the challenges that are specific to real-world software doping tests and analyses. We use the Diesel Emissions Scandal to demonstrate the strength of our cleanness definitions and analysis techniques by applying them to emission cleaning systems of diesel cars.

Ikhansul HABIBIE
Leveraging EEG-based Speech Imagery Brain-Computer Interfaces
(Advisor: Prof. Christian Theobalt)
Tuesday, 16.05.23, 10:00 h, building E14, Room 0.24

Realistic virtual human avatar is a crucial element in a wide range of applications, from 3D animated movies to emerging AR/VR technologies. However, producing a believable 3D motion for such avatars is widely known to be a challenging task. A traditional 3D human motion generation pipeline consists of several stages, each requiring expensive equipment and skilled human labor to perform, limiting its usage beyond the entertainment industry despite its massive potential benefits.
This thesis attempts to explore some alternative solutions to reduce the complexity of the traditional 3D animation pipeline. To this end, it presents several novel ways to perform 3D human motion capture, synthesis, and control.
Specifically, it focuses on using learning-based methods to bypass the critical bottlenecks of the classical animation approach. First, a new 3D pose estimation method from in-the-wild monocular images is proposed, eliminating the need for a multi-camera setup in the traditional motion capture system. Second, it explores several data-driven designs to achieve a believable 3D human motion synthesis and control that can potentially reduce the need for manual animation. In particular, the problem of speech-driven 3D gesture synthesis is chosen as the case study due to its uniquely ambiguous nature. The improved motion generation quality is achieved by introducing a novel adversarial objective that rates the difference between real and synthetic data. A novel motion generation strategy is also introduced by combining a classical database search algorithm with a powerful deep learning method, resulting in a greater motion control variation than the purely predictive counterparts.
Furthermore, this thesis also contributes a new way of collecting a large-scale 3D motion dataset through the use of learning-based monocular estimations methods. This result demonstrates the promising capability of learning-based monocular approaches and shows the prospect of combining these learning-based modules into an integrated 3D animation framework.
The presented learning-based solutions open the possibility of democratizing the traditional 3D animation system that can be enabled using low-cost equipment, e.g., a single RGB camera. Finally, this thesis also discusses the potential further integration of these learning-based approaches to enhance 3D animation technology.

Maurice REKRUT
Leveraging EEG-based Speech Imagery Brain-Computer Interfaces
(Advisor: Prof. Antonio Krüger)
Friday, 04.05.23, 15:00 h, building D3 2, Room -2.17 (Reuse)

Speech Imagery Brain-Computer Interfaces (BCIs) provide an intuitive and flexible way of interaction via brain activity recorded during imagined speech. Imagined speech can be decoded in form of syllables or words and captured even with non-invasive measurement methods as for example the Electroencephalography (EEG). Over the last decade, research in this field has made tremendous progress and prototypical implementations of EEG-based Speech Imagery BCIs are numerous. However, most work is still conducted in controlled laboratory environments with offline classification and does not find its way to real online scenarios.
Within this thesis we identify three main reasons for these circumstances, namely, the mentally and physically exhausting training procedures, insufficient classification accuracies and cumbersome EEG setups with usually high-resolution headsets. We furthermore elaborate on possible solutions to overcome the aforementioned problems and present and evaluate new methods in each of the domains. In detail we introduce two new training concepts for imagined speech BCIs, one based on EEG activity during silently reading and the other recorded during overtly speaking certain words. Insufficient classification accuracies are addressed by introducing the concept of a Semantic Speech Imagery BCI, which classifies the semantic category of an imagined word prior to the word itself to increase the performance of the system. Finally, we investigate on different techniques for electrode reduction in Speech Imagery BCIs and aim at finding a suitable subset of electrodes for EEG-based imagined speech detection, therefore facilitating the cumbersome setups. All of our presented results together with general remarks on experiences and best practice for study setups concerning imagined speech are summarized and supposed to act as guidelines for further research in the field, thereby leveraging Speech Imagery BCIs towards real-world application.

Han DU
Modeling Variation of Human Motion
(Advisor: Prof. Philipp Slusallek)
Thursday, 04.05.23, 08:30 h, building D3 2, Room -2.17 (Reuse)

This thesis presents a series of works that analyze and model the variations of human motion data. The goal is to learn statistical generative models to create any number of new human animations with rich variations and styles. The synthesis of realistic human motion with large variations and different styles has a growing interest in simulation applications such as the game industry, psychological experiments, and ergonomic analysis. The statistical generative models are used by motion controllers in our motion synthesis framework to create new animations for different scenarios.

Jiayi WANG
3D Hand Reconstruction from Monocular Camera with Model-Based Priors
(Advisor: Prof. Christian Theobalt)
Wednesday, 03.05.23, 14:00 h, building E1 4, Room 0.24

As virtual and augmented reality (VR/AR) technology gains popularity, facilitating intuitive digital interactions in 3D is of crucial importance. Tools such as VR controllers exist, but such devices support only a limited range of interactions, mapped onto complex sequences of button presses that can be intimidating to learn. In contrast, users already have an instinctive understanding of manual interactions in the real world, which is readily transferable to the virtual world. For enabling these interactions, hand-tracking systems using monocular images are desirable since they do not constrain articulation, unlike gloves or markers, and suitable input devices are pervasive in everyday life.
However existing learning-based methods have many limitations, such as their requirement for vast amounts of 3D annotations, the assumption only one hand appears in the scene, and their inability to characterize the 3D ambiguities in the input. Existing methods also focused primarily on modeling geometry while neglecting hand appearance. To tackle the aforementioned shortcomings of previous methods, this thesis advances the state-of-the-art through the novel use of model-based priors to incorporate hand-specific knowledge. In particular, this thesis presents a training method that reduces the amount of annotations required and is robust to systemic biases; it presents the first tracking method that addresses the challenging two-hand-interaction scenario using monocular RGB video, and also the first probabilistic method to model image ambiguity for two-hand interactions. Additionally, this thesis also contributes the first parametric hand texture model with example applications in hand personalization.

April

Sebastian ROTH
How to Deploy Security Mechanisms Online (Consistently)
(Advisor: Dr. Ben Stock)
Friday, 28.04.23, 10:00 h, building E9 1, Room 0.01

To mitigate a myriad of Web attacks, modern browsers support client-side security policies shipped through HTTP response headers. To enforce these policies, the operator can set response headers that the server then communicates to the client. We have shown that one of those, namely the Content Security Policy (CSP), requires massive engineering effort to be deployed in a non-trivially bypassable way. Thus, many policies deployed on Web sites are misconfigured. Due to the capability of CSP to also defend against framing-based attacks, it has a functionality-wise overlap with the X-Frame-Options header. We have shown that this overlap leads to inconsistent behavior of browsers, but also inconsistent deployment on real-world Web applications. Not only overloaded defense mechanisms are prone to security inconsistencies. We investigated that due to the structure of the Web itself, misconfigured origin servers or geolocation-based CDN caches can cause unwanted security inconsistencies. To not disregard the high number of misconfigurations of CSP, we also took a closer look at the deployment process of the mechanism. By conducting a semi-structured interview, including a coding task, we were able to shed light on motivations, strategies, and roadblocks of CSP deployment. However, due to the wide usage of CSP, drastic changes are generally considered impractical. Therefore, we also evaluated if one of the newest Web security features, namely Trusted Types, can be improved.

Edgar SCHÖNFELD
Improving Quality and Controllability in GAN-based Image Synthesis
(Advisor: Prof. Bernt Schiele)
Tuesday, 18.04.23, 09:30 h, building E1 4, DFKI, Room 0.24

The goal of the field of deep learning-based image synthesis is to achieve perfect visual realism, and to let users precisely control the content of the synthetic images. Generative adversarial networks (GANs) have been the most popular image synthesis framework until recently, due to their unrivaled image quality. Yet, there is still much room for improve-ment regarding synthesis quality and precisely controlling the image content. For this reason, this thesis introduces methods that improve both the synthesis quality and control-lability of GANs. Specifically, we address the following subproblems. First, we propose the idea of segmentation-based discriminator networks and segmentation-based regularizations for GANs. The new approach improves the quality of conditional and unconditional image synthesis. Second, we show that this approach is naturally well-suited for semantic image synthesis. Centered around the idea of segmentation-based discriminators, this thesis introduces techniques that strongly improve image quality and multi-modality. Additionally, the methods result in better modeling of long-tailed data and new possibilities for global and local image editing. Finally, the improvements in multi-modality and image editing in semantic image synthesis open the door for controlling the image content via the latent space of the GAN generator. Therefore, this thesis introduces a method for finding interpretable directions in the latent space of semantic image synthesis GANs, which enables an additional form of control over the image content next to the semantic layouts.

March

Nicklas LINZ
Automatic Detection of Dementia and related Affective Disorders through Processing of Speech and Language
(Advisor: Prof. Antonio Krüger)
Friday, 24.03.23, 15:00 h, building D3 2, DFKI, ViS Room (SB-1.61)

In 2019, dementia is has become a trillion dollar disorder. Alzheimer’s disease (AD) is a type of dementia in which the main observable symptom is a decline in cognitive functions, notably memory, as well as language and problem-solving. Experts agree that early detection is crucial to effectively develop and apply interventions and treatments, underlining the need for effective and pervasive assessment and screening tools. The goal of this thesis is to explores how computational techniques can be used to process speech and language samples produced by patients suffering from dementia or related affective disorders, to the end of automatically detecting them in large populations using machine learning models. A strong focus is laid on the detection of early stage dementia (MCI), as most clinical trials today focus on intervention at this level. To this end, novel automatic and semi-automatic analysis schemes for a speech-based cognitive task, i.e., verbal fluency, are explored and evaluated to be an appropriate screening task. Due to a lack of available patient data in most languages, world-first multilingual approaches to detecting dementia are introduced in this thesis. Results are encouraging and clear benefits on a small French dataset become visible. Lastly, the task of detecting these people with dementia who also suffer from an affective disorder called apathy is explored. Since they are more likely to convert into later stage of dementia faster, it is crucial to identify them. These are the first experiments that consider this task using solely speech and language as inputs. Results are again encouraging, both using only speech or language data elicited using emotional questions. Overall, strong results encourage further research in establishing speech-based biomarkers for early detection and monitoring of these disorders to better patients’ lives.

Donald DEGRAEN
Designing Tactile Experiences for Immersive Virtual Environments
(Advisor: Prof. Antonio Krüger)
Tuesday, 21.03.23, 14:00 h, building D3 2, Reuse meeting room

Designing for the sense of touch is essential in creating convincing and realistic experiences in Virtual Reality (VR). Currently, a variety of methods exist for simulating touch experiences. However, developing effective and convincing haptic feedback still remains challenging. In this work, we study how real-world touch experiences can inform haptic design processes for VR. Firstly, we investigate the reproduction of haptic features by capturing and fabricating surface microgeometry. We show that haptic reproduction is able to create a wide range of feel aesthetics. Furthermore, we build upon procedural design by generating and fabricating haptically-varying surface structures. We show that digital design processes are able to generate flexible and universal structures that directly influence tactile dimensions, such as roughness and hardness. Lastly, we investigate correspondences between different sensory modalities to enhance the design of tactile experiences. We show that vocal expressions can translate a designer’s intent into effective haptic feedback, while providing a rapid in-situ design process. This thesis advances the fields of VR, haptic design, and fabrication by contributing knowledge to the question of how effective tactile experiences can be designed.

Anna HAKE (née Feldmann)
Predicting and analyzing HIV-1 adaptation to broadly neutralizing antibodies and the host immune system using machine learning
(Advisors: Prof. Nico Pfeifer, now Uni Tübingen)
Monday, 20.03.23, 14:00 h, building E1 4, Rm 0.24

With neither a cure nor a vaccine at hand, infection with the human immunode-ficiency virus type 1 (HIV-1) is still a major global health threat. Viral control is usually gained using lifelong therapy with antiretroviral drugs and rarely by the immune system alone. Without drug exposure, interindividual differences in viral control are partly influenced by host genetic factors like the human leukocyte antigen (HLA) system, and viral genetic factors like the predominant coreceptor usage of the virus. Thanks to its extraordinarily high mutation and replication rate, HIV-1 is however able to rapidly adapt to the selection pressure imposed by the host immune system or antiretroviral drug exposure.
For a successful control of the virus, it is thus vital to have fast and reliable methods in place that assess the viral adaptation to drugs of interest prior to their (further) administration. For a better assessment of our ability to control the virus, it is also important to estimate the viral adaptation to the host immune system.
In this talk, I will present four studies all aiming to further our understanding of HIV-1 adaptation and our ability to reliably predict it. In particular, we present a SVM approach to predict HIV adaptation to broadly neutralizing antibodies (bNAbs), a promising new treatment option. In addition, we use statistical learn-ing to further characterize antibody-mediated therapy with the promising bNAb 3BNC177 by investigating its ability (i) to suppress the virus and (ii) to boost the immune system. Finally, I will introduce a novel way to predict HIV-1 adaptation to the host immune system using Bayesian generalized linear mixed models, which allowed us to investigate the relationship between HIV-1 coreceptor usage and its adaptation to the host HLA system.

Bharat Lal Bhatnagar
Modelling 3D Humans: Pose, Shape, Clothing and Interactions
(Advisors: Prof. Gerard Pons-Moll, now Uni Tübingen)
Thursday, 16.03.23, 18:00 h, building E1 4, Rm 0.24

Digital humans are increasingly becoming a part of our lives with applications like animation, gaming, virtual try-on, Metaverse and much more. In recent years there has been a great push to make our models of digital humans as real as possible. In this thesis we present methodologies to model two key characteristics of real humans, their „appearance“ and „actions“. To this end, we discuss what are the best representations for humans, clothing and their interactions with their surroundings? How can we extract human appearance cues like pose, shape and clothing from scans, point clouds and images? How can we capture and in-turn model human-object interaction? and more

Fajar HAIFANI
On a Notion of Abduction and Relevance for First-Order Logic Clause Sets
(Advisors: Prof. Christoph Weidenbach and Dr. Sophie Tourret)
Thursday, 09.03.23, 14:00 h, building E1 4, Rm 0.24

I propose techniques to help explain entailment and non-entailment in first-order logic. For entailment, I classify clauses necessary for any possible deduction (syntactically relevant), usable for some deduction (syntactically semi-relevant), or unusable (syntactically irrelevant) along with a semantic characterization via conflict literals (contradictory simple facts). This offers a novel insight beyond the existing notion of minimal unsatisfiable set. The need to test if a clause is syntactically semi-relevant leads to a generalization of the completeness result of a well-known resolution strategy: resolution with the set-of-support (SOS) strategy is refutationally complete on a clause set N and SOS M if and only if there is a resolution refutation from N ∪ M using a clause in M. For non-entailment, abductive reasoning helps find extensions of a knowledge base to obtain an entailment of some missing consequence. I focus on EL TBox abduction that is lightweight but prevalent in practice. The solution space can be huge so, to help sort the chaff from the grain, I introduce connection-minimality, a criterion such that accepted hypotheses always immediately relate the observation to the given axioms. I show that such hypotheses are computable using prime implicate-based abduction in first-order logic. I evaluate this notion on ontologies from the medical domain using an implementation with SPASS as a prime implicate generation engine.

Mirko PALMER
Towards Enabling Cross-layer Information Sharing to Improve Today’s Content Delivery Systems
(Advisor: Prof. Anja Feldmann)
Thursday, 02.03.23, 15:00 h, building E1 4, Rm 0.24

Content is omnipresent and without content the Internet would not be what it is today. End users consume content throughout the day, from checking the latest news on Twitter in the morning, to streaming music in the background (while working), to streaming movies or playing online games in the evening, and to using apps (e.g., sleep trackers) even while we sleep in the night. All of these different kinds of content have very specific and different requirements on a transport—on one end, online gaming often requires a low latency connection but needs little throughput, and, on the other, streaming a video requires high throughput, but it performs quite poorly under packet loss. Yet, all content is transferred opaquely over the same transport, adhering to a strict separation of network layers. Even a modern transport protocol such as Multi-Path TCP, which is capable of utilizing multiple paths, cannot take the (above) requirements or needs of that content into account for its path selection. In this work we challenge the layer separation and show that sharing information across the layers is beneficial for consuming web and video content. To this end, we created an event-based simulator for evaluating how applications can make informed decisions about which interfaces to use delivering different content based on a set of pre-defined policies that encode the (performance) requirements or needs of that content. Our policies achieve speedups of a factor of two in 20% of our cases, have benefits in more than 50%, and create no overhead in any of the cases. For video content we created a full streaming system that allows an even finer grained information sharing between the transport and the application. Our streaming system, called VOXEL, enables applications to select dynamically and on a frame granularity which video data to transfer based on the current network conditions. VOXEL drastically reduces video stalls in the 90th-percentile by up to 97% while not sacrificing the stream’s visual fidelity. We confirmed our performance improvements in a real-user study where 84% of the participants clearly preferred watching videos streamed with VOXEL over the state-of-the-art.

February

Johannes BUND
Hazard-Free Clock Synchronization
(Advisor: Dr. Christoph Lenzen)
Tuesday, 28.02.23, 13:00 h, building E1 4, Rm 0.24

The growing complexity of microprocessors makes it infeasible to distribute a single clock source over the whole processor with small clock skew. Hence, chips are split into multiple clock regions, which are each covered by a single clock source. This poses a problem for communication between these clock regions. Clock synchronization algorithms promise an advantage over state-of-the-art solutions, such as GALS systems. When clock regions are synchronous the communication latency improves significantly over handshake-based solutions. We focus on implementation of clock synchronization algorithms.
A major obstacle when implementing circuits on clock domain crossings are hazardous signals. Extending the Boolean logic by a third value ‚u‘ we can formally define hazards. In this thesis we describe a theory for design and analysis of hazard-free circuits. We develop strategies for hazard-free encoding and construction of hazard-free circuits from finite state machines. Furthermore, we discuss clock synchronization algorithms and a possible combination of them.

Said Jawad SAIDI
Characterizing the IoT Ecosystem at Scale
(Advisor: Prof. Anja Feldmann)
Friday, 24.02.23, 15:00 h, building E1 4, Rm 0.24

Internet of Things (IoT) devices are extremely popular with home, business, and industrial users. To provide their services, they typically rely on a backend server infrastructure on the Internet, which collectively form the IoT Ecosystem. This ecosystem is rapidly growing and offers users an increasing number of services. It also has been a source and target of significant security and privacy risks. One notable example is the recent large-scale coordinated global attacks, like Mirai, which disrupted large service providers. Thus, characterizing this ecosystem yields insights that help end-users, network operators, policymakers, and researchers better understand it, obtain a detailed view, and keep track of its evolution. In addition, they can use these insights to inform their decision-making process for mitigating this ecosystem’s security and privacy risks. In this dissertation, we characterize the IoT ecosystem at scale by (i) detecting the IoT devices in the wild, (ii) conducting a case study to measure how deployed IoT devices can affect users’ privacy, and (iii) detecting and measuring the IoT backend infrastructure.
To conduct our studies, we collaborated with a large European Internet Service Provider (ISP) and a major European Internet eXchange Point (IXP). They routinely collect large volumes of passive, sampled data, e.g., NetFlow and IPFIX, for their operational purposes. These data sources help providers obtain insights about their networks, and we used them to characterize the IoT ecosystem at scale.
We start with IoT devices and study how to track and trace their activity in the wild. We developed and evaluated a scalable methodology to accurately detect and monitor IoT devices with limited, sparsely sampled data in the ISP and IXP.
Next, we conduct a case study to measure how a myriad of deployed devices can affect the privacy of ISP subscribers. Unfortunately, we found that the privacy of a substantial fraction of IPv6 end-users is at risk. We noticed that a single device at home that encodes its MAC address into the IPv6 address could be utilized as a tracking identifier for the entire end-user prefix—even if other devices use IPv6 privacy extensions. Our results showed that IoT devices contribute the most to this privacy leakage.
Finally, we focus on the backend server infrastructure and propose a methodology to identify and locate IoT backend servers operated by cloud services and IoT vendors. We analyzed their IoT traffic patterns as observed in the ISP. Our analysis sheds light on their diverse operational and deployment strategies.
The need for issuing a priori unknown network-wide queries against large volumes of network flow capture data, which we used in our studies, motivated us to develop Flowyager. It is a system built on top of existing traffic capture utilities, and it relies on flow summarization techniques to reduce (i) the storage and transfer cost of flow captures and (ii) query response time. We deployed a prototype of Flowyager at both the IXP and ISP.