Abschlussarbeiten

Auf dieser Seite finden Sie Informationen zu laufenden oder bereits abgeschlossenen Abschlussarbeiten an unserem Institut. Wo möglich ist auch ein entsprechender Downloadlink angegeben.

Laufende Arbeiten


8.
default
Speidel, Philipp
Anonymity in Peer-to-Peer Storage Systems
Masterarbeit
Institut für Verteilte Systeme, Universität Ulm,
Mai 2017
noch nicht publiziert

Marker: AA, MA, DavidMoedinger, networks, p2p

7.
default
Gassner, Manuel
Recording and analysing attacks on Industrial Control Systems
Bachelorarbeit
Institute of Distributed Systems, Ulm University,
März 2017
noch nicht publiziert

Marker: AA, BA, RensVanDerHeijden, StephanKleber, FrankKargl, itsec, networks, tss

Zusammenfassung: Die Arbeit wird in Kooperation mit Daimler TSS durchgeführt.

6.
default
Diebold, Johannes
Angriffe auf Cooperative adaptive cruise control (CACC)
Bachelorarbeit
Institute of Distributed Systems, Ulm Univerisity,
2017
noch nicht publiziert

Marker: AA, BA, RensVanDerHeijden, mobile, networks, itsec

5.
default
Kleber, Stephan und Kargl, Frank
Feature Extraction by Natural Language Processing for Type-based Alignment
Bachelor's thesis
Institut of Distributed Systems, Ulm University,
2017
noch nicht publiziert

Marker: AA, BA, StephanKleber, FrankKargl, itsec, networks

Zusammenfassung: Task of this thesis is to implement and evaluate natural language processing methods, like Latent Dirichlet Allocation and Information Bottleneck as feature extraction and clustering methods for network messages. They are intended to be implemented for use in type-based alignment of message tokens according to the approach Discoverer.

Bemerkung: or Master's thesis or Project MA, P,

4.
default
Lüthi, Christian
Secure Reset: Transforming a Comprised System into a Secure State
Master's thesis or Diploma thesis
Institute of Distributed Systems, Ulm University,
2017
noch nicht publiziert

Marker: AA, MA, DominikLang

Zusammenfassung: Modern vehicles contain up to 100 ECUs (Electronic Control Units). These are interconnected via an on-board network and together form a complex computer system on wheels. Vehicles now also include various wireless communication systems, such as WiFi for infotainment, Bluetooth for TPMS (Tire Pressure Monitoring System), and cellular communication for backend services. It has been shown that it is possible to gain access to the internal network and compromise ECUs, for example by flashing the ECUs to add backdoors. Consequently, it is necessary to create methods for a secure bootstrapping process that resets all ECUs of a vehicle to a secure state after a compromise has been detected. With this scenario in mind, the goal of this Master's thesis is to create an architecture and respective strategies that allow for an over-the-air secure bootstrapping process. This process should be based on a security module, such as can been found in modern ARM processors. In addition, the student should create and evaluate a prototype implementation.

3.
default
Diemer, Florian
Improving position verification in VANETs
Bachelor Thesis
Institute of Distributed Systems, Ulm Univerisity,
2017
noch nicht publiziert

Marker: AA, BA, RensVanDerHeijden, networks, mobile, itsec

Zusammenfassung: One important use case for vehicular ad-hoc networks is to improve safety by giving vehicles communication capabilities, allowing them to respond to dangers earlier than autonomously operating vehicles, which must rely on their sensors alone. However, it is possible that vehicles transmit incorrect positions into the network. In this work, the goal is to detect such incorrect positions. This involves several steps; designing an attacker model, developing or implementing detection approaches, and evaluating the result. The implementation work will be in Java, within the Maat framework, a prototype detection framework under development at the institute of distributed systems.

2.
default
Nieß, Tobias
DoS Attacks on Congestion Control Algorithms
Bachelorarbeit
Institut für Verteilte Systeme, Uni Ulm,
2016
noch nicht publiziert

Marker: AA, BA, ThomasLukaseder, itsec, networks

Zusammenfassung: Current TCP congestion control algorithms have many drawbacks, especially the introduction of new high-speed and low-delay congestion control variants is impaired by the aggressiveness of the existing variants. In context of a research project by the state of Baden-Württemberg, a new system for the coexistence of different congestion control mechanisms is currently in development. As this new system strongly depends on conform/honest behavior of network subscribers, DoS attacks paralyzing the network might be possible. This thesis shall evaluate possible attack vectors and methods to detect and mitigate or prevent successful attacks.

1.
default
Schwerin, Sven
Identifikation optimaler Einsatzbereiche der Einigungsalgorithmen Paxos und Vertical Paxos
Masterarbeit
Institut für Verteilte Systeme, Universität Ulm,
2014
noch nicht publiziert

Schlüsselwörter: Paxos, State Machine Replication, Group Communication, Primary Backup

Marker: DA, MA, AA, ChristianSpann, FranzHauck

Zusammenfassung: Die beiden Einigungsalgorithmen Paxos und dessen Erweiterung Vertical Paxos sind strukturell grundverschieden. Das daraus resultierende, vermutlich sehr unterschiedliche Verhalten soll in dieser Arbeit in geeigneten Evaluationen untersucht und beschrieben werden. Der Unterschied der Verfahren ergibt sich in der Verteilung des Aufwands zur Fehlererholung. In Paxos kann jeder Knoten selbst direkt mit Fehlern umgehen, in Vertical Paxos gibt es einen externen Knoten, der das System überwacht.

Fertiggestellte Abschlussarbeiten


2016

70.
default
Nölscher, Henrik Ferdinand
Automatisiertes PCB Reverse Engineering
Bachelorarbeit
Institut für Verteilte Systeme, Universität Ulm,
November 2016

Marker: AA, BA, StephanKleber, FrankKargl, itsec

Zusammenfassung: Die Arbeit wird in Kooperation mit Code White durchgeführt.

69.
default
Keazor, Christopher
World-Modeling in Cooperative Intelligent Transport Systems
Diplomarbeit
Institute of Distributed Systems, Ulm Univerisity,
November 2016

Marker: AA, DA, RensVanDerHeijden, mobile, distributed

68.
default
Hauser, Lukas
A Persistence Layer for Distributed Event-Sourced Architectures
Masterarbeit VS-M09-2016
Institut für Verteilte Systeme, Universität Ulm,
August 2016

Marker: MA, AA, BenjaminErb, sidgraph

Zusammenfassung: Due to the increasingly large amount of data which is collected and processed each day, enabling fast, reliable, and scalable distributed computing on very large datasets has become more important than ever. Unfortunately, distributed computation on large inhomogeneous datasets is still time-consuming and it is very difficult to make evaluations and predictions. To address these issues, event sourcing and graph computing are relevant topics. While event sourcing provides techniques to save data in a particular way, which enables evaluations and makes predictions possible, graph computing provides a way to distribute the computation on large datasets. Although there is a conceptual idea which addresses these issues, no practical experience how such a concept can be implemented in case of persistence and communication is available. As a result, a prototype system to measure and evaluate different persistence and communication implementations for distributed event-sourced architectures using event sourcing and graph computing needs to be created. Such a system can be used to find a way how to persist and work on large distributed inhomogeneous datasets efficiently.

67.
default
Alev, Celebi
Performance Engineering in verteilten, polyglotten Berechnungsplattformen
Masterarbeit VS-M08-2016
Institut für Verteilte Systeme, Universität Ulm,
Juni 2016

Marker: AA, BA, MA, PROJEKT, BenjaminErb, FrankKargl, sidgraph, distributed

66.
default
Moll, Markus
Survey von Physically-Unclonable-Functions- (PUF) Anwendungsszenarien
Bachelorarbeit
Institut für Verteilte Systeme, Universität Ulm,
Juni 2016

Marker: AA, BA, StephanKleber, FrankKargl, itsec

Zusammenfassung: Sicherheit in IT-Systemen vor allem im Bereich von verteilten Systemen wird immer wichtiger. Jedoch sind Softwarelösungen für diesen Zweck nicht als Sicher einzustufen. Der relativ leichte Zugang zu der Hardware von solchen Systemen stellt dabei das größte Problem dar, Damit kann die Software umgangen werden. Somit sind Sicherheitslösungen über Hardwarekomponenten nötig. Eine solche Komponente stellt die Physical Unclonabel Functions(PUF) dar. In dieser Arbeit werden mögliche Anwendungsszenarien vorgestellt in denen diese zum Einsatz kommen können. Die Einsatzgebiete sind die Bereiche Authentifizierung und Identifizierung, Verwaltung von geheimen Schlüsseln und Kryptographische Primitive An Hand der vorgestellten Szenarien werden dann Kriterien aufgestellt mit denen beurteilt werden kann wann und ob eine PUF eingesetzt werden kann.

65.
default
van der Heijden, Rens und Kargl, Frank
Subjective Logic Operators for Fusion of Misbehavior Detection Mechanisms
Bachelor Thesis
Institute of Distributed Systems, Ulm Univerisity,
Mai 2016

Marker: BA, AA, RensVanDerHeijden, mobile, itsec

64.
default
Wagner, Denis
Vergleich und Evaluierung von Time Series Databases
Bachelorarbeit VS-B07-2016
Institut für Verteilte Systeme, Universität Ulm,
Mai 2016

Marker: AA, MA, DA, BA, BenjaminErb, sidgraph, distributed, cloud

63.
default
Müller, Michael
Enabling Retroactive Computing Through Event Sourcing
Masterarbeit VS-M01-2016
Institut für Verteilte Systeme, Universität Ulm,
April 2016

Marker: BA, AA, MA, DA, BenjaminErb, FrankKargl, sidgraph, distributed

Zusammenfassung: Event sourcing is a style of software architecture wherein state altering operations to an application are captured as immutable events. Each event is appended to an event log, with the current state of a system derived from this series of events. This thesis addresses the utilization of retroactive capabilities in event-sourced systems: computing alternate application states, post hoc bug fixes, or the support of algorithms which have access to their own history, for example. The possibility of retroactively accessing and modifying this event log is a potential capability of an event-sourced system, but a detailed exploration how these operations can be facilitated and supported has not yet been conducted. We examine how retroaction can be applied to event-sourced systems and discuss conceptual considerations. Furthermore, we demonstrate how different architectures can be used to provide retroaction and describe the prototypical implementation of an appropriate programming model. These findings are applied in the Chronograph research project, in order to utilize potential temporal aspects of this platform.

62.
default
Maile, Lisa
Processes for Network Protocol Analyses
Bachelorarbeit
Institut für Verteilte Systeme, Universität Ulm,
Januar 2016

Marker: AA, BA, StephanKleber, FrankKargl, itsec, networks

Zusammenfassung: For every communication between two or more participants in distributed systems or networks, protocols are needed in order to agree upon the way the communication messages are interpreted. Unfortunately, many protocols are unknown to the public because of missing or unavailable specifications. To understand the functionality of these protocols and, eventually, their message content, these unknown protocols need to be reversed engineered. At present, network protocol reverse engineering is performed mostly manually with the expertise and intuition of the engineer, insofar as there are no completely automated methods yet. If analyzed by hand, the most difficulties are faced when comparing protocols with variable field lengths, since the protocol’s structure is blurred and patterns cannot be detected easily. Furthermore, complex state machines are hardly manageable without the support of automated tools. The value gained from protocol analyses research ranges from general understanding of the protocol to security issues, such as the creation of specific firewall rules or by helping intrusion detection systems to identify the behavior of malware. This bachelor thesis analyzes static protocol analyses and describes every stage passed from capturing unknown protocols to the deduction of protocol message formats and the state machine. It thereby presents currently existing automatic approaches for each stage and the benefits compared to a purely manual task. Finally, it evaluates the current processes, emphasizes limitations and proposes improvement suggestions for the future.

61.
default
Cepcik, Stefan
Update Strategie für IoT-Geräte auf Basis der Windows 10 IoT Core Plattform im Kontext von Industrie 4.0
Masterarbeit
Institut für Verteilte Systeme, Universität Ulm,
2016

Marker: AA, MA, DominikLang

60.
default
Schimmele, Benjamin
Implementation of a Pre-Filter for Network Intrusion Detection Systems
Diplomarbeit
Institut für Verteilte Systeme, Uni Ulm,
2016

Marker: AA, DA, ThomasLukaseder

59.
default
Forst, Christian
Erstellung eines dynamischen Testdatensets zur Sicherheitsanalyse
Masterarbeit
Institut für Verteilte Systeme, Uni Ulm,
2016

Marker: AA, MA, ThomasLukaseder

58.
default
Waldenmaier, Tobias
Privacy-Preserving Geofencing
Master's Thesis
Institute of Distributed Systems, Ulm University,
2016

Marker: AA, MA, MatthiasMatousek, privacy

Zusammenfassung: With geofencing, car holders can get notified when their vehicle leaves a predetermined area. This feature can be used by companies to keep tabs on their company vehicles, or by private individuals to gain higher security. However, when the vehicle manufacturer or a third-party provider is hosting the geofencing service, he also needs access to the vehicle location. This also means that the provider can derive movement profiles of the vehicle's drivers. So-called searchable encryption has the potential to enable geofencing without the need for the provider to know the exact vehicle locations. The goal of this thesis is to develop and evaluate a proof-of-concept that provides geofencing while preserving the drivers' privacy. Thus, several searchable encryption schemes should be compared and assessed for their applicability to this task. At least one of the schemes should be implemented and the resulting prototype evaluated regarding its adequacy and efficiency.

57.
default
Kneer, Daniel
Simulation of Backend-Based Misbehaviour Detection for Connected Cars
Master's Thesis
Institute of Distributed Systems, Ulm University,
2016

Marker: AA, MA, MatthiasMatousek, itsec

56.
default
Hunt, Alexander
Erkennung und Abwehr von DoS-Attacken mit Hilfe von Software Defined Networking
Bachelorarbeit
Institut für Verteilte Systeme, Uni Ulm,
2016

Marker: AA, BA, ThomasLukaseder

55.
default
Strobel, Manuel
Untersuchung der Sicherheit von Eduroam (IEEE 802.1X)
Bachelorarbeit
Institut für Verteilte Systeme, Uni Ulm,
2016

Marker: AA, BA, ThomasLukaseder, networks, itsec

Zusammenfassung: Das Absichern von kabellosen Netzwerken stellt die Informatik schon seit langem vor große Herausforderungen. Viele Firmen entscheiden sich noch heute dafür nur kabelgebundene Internetverbindungen in ihren Netzwerken zu erlauben um so Angriffe zu erschweren. Der IEEE Standard 802.1X, der zum Beispiel bei Eduroam Anwendung findet, gilt als einer der sichersten Möglichkeiten kabellose Netzwerke gegen Angriffe abzusichern. Doch auch für Implementierungen dieses Standards sind Attacken bekannt. Smartphones mit dem Android Betriebssystem etwa verwenden in der Standardeinstellung kein Zertifikat zur Überprüfung der Validität des Access Points, was Man-in-the-Middle-Attacken ermöglichen kann. Auch Denial of Service Angriffszenarien sind bekannt. Ziel dieser Arbeit soll sein, eine Übersicht dieser Attacken zu erstellen, Proof of Concept Angriffe zu implementieren und zu testen wie anfällig aktuelle Implementierungen des Standards gegenüber Angriffen sind.

2015

54.
default
Habiger, Gerhard
Distributed Versioning and Snapshot Mechanisms on Event-Sourced Graphs
Masterarbeit VS-M13-2015
Institut für Verteilte Systeme, Universität Ulm,
Oktober 2015

Marker: BA, AA, MA, DA, BenjaminErb, FrankKargl, sidgraph, distributed

Zusammenfassung: Two interesting approaches to tackle many of today's problems in large scale data processing and live query resolution on big graph datasets have emerged in recent years. Firstly, after Google's presentation of its graph computing platform Pregel in 2010, an influx of more or less similar platforms could be observed. These platforms all share the goal of providing highly performant data mining and analysis capabilities to users, enabling a wide variety of today's technologies like ranking web pages in the the web graph of the WWW or analysing user interactions in social networks. Secondly, the old concept of message logging for failure recovery was rediscovered and combined with event based computing in the early 2000s and is now known as event sourcing. This approach to system design keeps persistent logs of every single change of all entities in a computation, providing highly interesting options like state restoration by replaying old events, retroactive event modifications, phenomenal debugging capabilities and many more. A recently published paper suggests the merging of those two approaches to create a hybrid event-sourced graph computing platform. This platform would show unique characteristics compared to other known solutions. For example, computations on temporal data can yield information about the evolution of a graph and not only its current state. Furthermore, for backups or to enable offline analysis on large compute clusters, snapshot extraction – i.e. reproducing any consistent global state the graph has ever been in – from the event logs produced by event-sourced graph computations is possible. This thesis provides one of the first major works related to this proposed hybrid platform and provides background knowledge related to these aforementioned topics. It presents a thorough overview over the current state-of-the-art in graph computing platforms and causality tracking in distributed systems and finally develops an efficient mechanism for extracting arbitrary, consistent global snapshots from a distributed event log produced by an event-sourced graph computation.

53.
default
Meißner, Dominik
Designing a Disaster Area Network for First Responders in Disastrous and Emergency Scenarios
Bachelorarbeit VS-B18-2015
Institut für Verteilte Systeme, Universität Ulm,
Oktober 2015

Marker: BA, AA, MA, DA, BenjaminErb, RensVanderHeijden, FrankKargl, distributed

Zusammenfassung: Man-made disasters, earthquakes, floods, and other natural disasters come with a great number of casualties, which have to be treated as quickly as possible by emergency services to minimize fatalities. Due to the large number of casualties and aid workers, it is difficult to maintain an accurate overview of the situation. To improve the clarity of the situation, a comprehensive support system can be used for the forces on-site, which supports them in information gathering and distribution to all involved parties. Previous work has failed to implement independency of public infrastructure (e.g. power grid, cellular network) or suffer data loss due to single node failures. To solve this problem, we propose a fault-tolerant design that fully distributes information to all devices in a mobile ad hoc network, while allowing offline work outside of it. We present a proof-of-concept prototype for the proposed design and show that its data distribution component behaves as designed using a series of trials. To the best of our knowledge, there is currently no DAN system that uses multi master replication to fully distribute data, where every node has an individual copy of every piece of information.

52.
default
Koenig, Sonja
An Evaluation of Distributed Approaches to Large-Scale Graph Computing
Bachelorarbeit VS-B09-2015
Institut für Verteilte Systeme, Universität Ulm,
Oktober 2015

Marker: BA, AA, MA, DA, BenjaminErb, FrankKargl, sidgraph, distributed

Zusammenfassung: This thesis takes a look at several considerations for developers and users of distributed graph computing platforms. Two popular computing platforms, Apache Giraph on Hadoop and the GraphX library in Apache Spark, are analyzed and tested through a benchmarking process. We examine a basic PageRank and ConnectedComponents algorithm for a variety of input graphs and cluster sizes. We hereby discover how immensely different parameters of distributed graph computations, such as graph sizes and topology properties, impact the execution time. Concluding, we carve out the application fields, for which both platforms are practical and where trade-offs have to be made.

51.
default
Bradatsch, Leonard
Verhalten von TCP-Varianten in Hochgeschwindigkeitsnetzwerken
Bachelorarbeit VS-B08-2015
Institut für Verteilte Systeme, Universität Ulm,
September 2015

Marker: AA, BA, ThomasLukaseder, BenjaminErb, networks

50.
default
Lang, Dominik
Accelerating Network Intrusion Detection Using a NetFPGA Pre-Filter
Masterarbeit
Institut für Verteilte Systeme, Universität Ulm,
September 2015

Marker: AA, DA, MA, BA, ThomasLukaseder, networks, itsec

Zusammenfassung: The ever increasing network bandwidth causes intrusion detection mechanisms to reach the limits of their capacity. Thus, new and improved implementations for security mechanisms such as firewalls and intrusion detection systems are urgently required. To enable intrusion detection systems to reach higher bandwidths, parts of their implementation can be moved to the hardware with the usage of the high-speed NetFPGA platform. A first implementation for byte-oriented protocols already exists and proves that this can be a way to tackle the challenges ahead. In this work the student shall design, implement and evaluate an efficient and reliable string matching system based on the existing byte-oriented filter implementation and might in the end implement a full-scale regular expression parser in the hardware description language Verilog.

49.
default
Matousek, Matthias
Software Support for the Secure Execution PUF-based Processor
Masterarbeit
Institute of Distributed Systems, University of Ulm,
Juli 2015

Marker: MA, AA, StephanKleber, FrankKargl

Zusammenfassung: The Secure Execution PUF-based Processor (SEPP), designed and implemented previously by Florian Unterstein, counters the problem of code injection attacks which are still a major threat for computer security. The ultimate goal of this thesis is to end up with an operating system running on the SEPP. Intermediate goals this thesis will address are solutions for compiler support, deployment scenarios, multi-threading of secure and insecure execution modes and even software dependend hardware optimizations.

48.
default
Al-Momani, Ala'a
Adaptive Detection of Position Falsification in VANETs
Master Thesis
Ulm Univerisity & Princess Sumaya University for Technology,
Juli 2015

Marker: AA, MA, RensVanDerHeijden, networks, mobile, itsec

47.
default
Kraft, Robin
Verwendung von CRDTs in mobilen verteilten Anwendungen
Bachelorarbeit VS-B07-2015
Institut für Verteilte Systeme, Universität Ulm,
Juli 2015

Marker: AA, BA, BenjaminErb, distributed, mobile

Zusammenfassung: Einen Ansatz für asynchrone Datenhaltung in verteilten Systemen bieten Conflict-free Replicated Data Types (CRDT). Sie stellen Verfügbarkeit über strikte Konsistenz, trotzdem konvergieren die Zustände der Datentypen zu einem späteren Zeitpunkt mit Hilfe einfacher mathematischer Annahmen wie Kommutativität oder den Eigenschaften eines Halbverbandes. Diese Arbeit erklärt die Grundsätze, Unterscheidungsmöglichkeiten, Funktionsweisen, Anwendungsfälle und Probleme dieser CRDTs und überträgt deren Konzepte anschließend in den mobilen Kontext. Dabei werden auf theoretischer Basis zunächst geeignete Anwendungsszenarien unter verschiedenen Kriterien untersucht und anschließend ein Framework entwickelt, mit dem Entwickler mobiler Anwendungen CRDT-Instanzen verschiedener Datentypen verwenden können, die automatisiert über mehrere Geräte repliziert werden.

46.
default
Reuter, Max
Passwordless Authentication via Hardware Tokens
Bachelorarbeit
Institut für Verteilte Systeme, Universität Ulm,
Mai 2015

Marker: AA, BA, StephanKleber, FrankKargl, itsec

Export als: BibTeX, XML