Offene Abschlussarbeiten

Auf dieser Seite finden Sie Informationen zu aktuell von uns angebotenen Themen für Abschlussarbeiten. Informationen zu bereits laufenden oder fertiggestellten Arbeiten finden sich auf einer Unterseite. Beachten Sie, dass ausgeschriebene Arbeiten teilweise als Bachelor- und Masterarbeit oder auch als Projektarbeit ausgeschrieben sind. Je nachdem, was Studierende benötigen, wird in der Regel das Thema der gewählten Arbeit in Arbeitsumfang und Schwierigkeitsgrad angepasst.

Hinweis zur Sprache: Im Folgenden werden die verfügbaren Themen hauptsächlich auf Englisch aufgelistet. Bei der Bearbeitung eines Thema steht es Studierenden frei, sich entweder für Deutsch oder Englisch als Sprache für die Ausarbeitung zu entscheiden.

Aktuelle Ausschreibungen

„Confidential Computing via Multiparty Computation and Trusted Computing,“ Projektarbeit oder Masterarbeit, D. Meißner (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2022 – Verfügbar.
Secure multiparty computation and trusted computing are two very different approaches to perform computations on confidential data. MPC relies on provably secure but costly cryptography whereas trusted computing relies on somewhat trustworthy hardware. This difference also affects to the underlying attacker models. Simply put MPC requires non-colluding parties and trusted computer requires uncompromised hardware that was correctly manufactured. The goal of this topic is to explore a combination of both approaches to mitigate each others weaknesses for a specific use case where the computing parties are disjunct from data subjects.
„Extending ISOS by tentative decisions,“ Masterarbeit, F. J. Hauck (Betreuung), F. J. Hauck (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2022 – Verfügbar.
ISOS is a leaderless consensus protocol for state-machine replication. It brings any input to the state machines in a total order so that it can be processed in a deterministic way. Typically requests to the machines are processed after the decision in the consensus protocol. As the consensus takes many message exchanges it needs some time. A first goal of this thesis is to implement a version of ISOS in our own framework called SMRteez. The protocol shall be extended by a to-be-defined interface that delivers preliminary decision to a processing unit earlier than the final decision. The interface needs to be able to deliver not only final decisions but also revokations of preliminary decisions, so that the execution engine can abort processing. The student has to identify the extension points when and where preliminary decisions can be derived. Further the new protocol is to be evaluated in order to verify how many wrong decisions are processed in which situations (high load, faulty nodes, etc.). The execution engine is outside of this work, it just needs to be simulated, e.g. by re-executing aborted requests on definite decisions.
„Graph Machine Learning on Evolving Graphs,“ Masterarbeit, B. Erb (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2021 – Verfügbar.
Event-sourced graphs are a concept to capture graphs that are continuously evolving, e.g. based on a stream of live changes. Goal of this thesis is (a) to provide an overview of existing graph machine learning concepts, (b) to assess the applicability of machine learning mechansims on event-sourced graphs, and (c) to prove the feasibility with a prototype implementation. Basic knowledge of general machine learning concepts is a plus for this thesis.
„Library Isolation in Embedded Systems,“ Bachelorarbeit, Masterarbeit, F. Kargl (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2021 – Verfügbar.
Software vulnerabilities pose critical threats to safety-relevant systems like vehicles. For example, a bug in a library embedded into a control program of a braking electronic-control-unit (ECU) inside a vehicle might be exploited by attackers to infiltrate the ECU and disable the breaks. More and more of today's vehicle allow over-the-air update of their software, but this typically requires updating a full firmware or at least a monolitic binary. So even if the mentioned library is patched, it still takes substantial time to integrate the new library version with the binary, and create and distribute a new firmware. In this work, we want to investigate system-level mechanisms to isolate a faulty library by dissecting it from a binary and executing it in a sandboxed environment. Feasibility of the concepts should be demonstrated in a proof-of-concept implementation.
„Security Mechansims for Multi-Tenancy Event-Sourced Graphs,“ Masterarbeit, B. Erb (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2021 – Verfügbar.
Event-sourced graph computing allows to run computations on the latest state or on historical states of an evolving graph. Such event-sourced graphs capture highly connected application domains that are continuously evolving, e.g. based on streams of live changes. An advanced use case is the application of event-sourced graph computing with mutitple concurrent parties that feed in changes into the system and also run computations. Multi tenancy however requires novel mechanisms to address private computations and data access control. Goal of this thesis is (a) to compile a list of challenges when applying multi-tenancy graph computing, (b) to survey and assess possible security solutions, and (c) to contribute a prototype implementation. Basic knowledge of distributed systems and IT security is recommended for this thesis.
„Test-Case-Generation Strategies for Network-Protocol-Model Refinements,“ Bachelor's oder Masterarbeit, S. Kleber (Betreuung), F. Kargl (Prüfer), Institut of Distributed Systems, Ulm University, 2019 – Verfügbar.
Security assessments of networked systems require knowledge about the utilized communication protocol. For proprietary protocols without known specification and with only limited access to the end-points, the only source of information is the communication itself. To correctly conclude from the captured byte stream to message-formats, -types, and finally a protocol model, structure, message- and field-boundaries, data-type, and semantics need to be inferred. After an initial inference procedure, it is desirable to refine the existing protocol model. Actively probing an entity for the validity of message syntaxes allows to targetedly enhance the knowledge about the protocol. To do this efficiently a smart method of automatically generating test-cases depending on the current protocol model needs to be developed.
Kontakt

Sekretariat

Marion Köhler
Emailaddresse Sekretariat
Telefon: +49 731 50-24140
erreichbar jeweils vormittags
Telefax: +49 731 50-24142

Postanschrift

Institut für Verteilte Systeme
Universität Ulm
Albert-Einstein-Allee 11
89081 Ulm

Besucheranschrift

James-Franck-Ring
Gebäude O27, Raum 349
89081 Ulm
Sekretariat Montag bis Donnerstag Vormittag besetzt

Anfahrt

Themen nach Abschluss

Bachelor-Arbeiten

„Library Isolation in Embedded Systems,“ Bachelorarbeit, Masterarbeit, F. Kargl (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2021 – Verfügbar.
Software vulnerabilities pose critical threats to safety-relevant systems like vehicles. For example, a bug in a library embedded into a control program of a braking electronic-control-unit (ECU) inside a vehicle might be exploited by attackers to infiltrate the ECU and disable the breaks. More and more of today's vehicle allow over-the-air update of their software, but this typically requires updating a full firmware or at least a monolitic binary. So even if the mentioned library is patched, it still takes substantial time to integrate the new library version with the binary, and create and distribute a new firmware. In this work, we want to investigate system-level mechanisms to isolate a faulty library by dissecting it from a binary and executing it in a sandboxed environment. Feasibility of the concepts should be demonstrated in a proof-of-concept implementation.
„Test-Case-Generation Strategies for Network-Protocol-Model Refinements,“ Bachelor's oder Masterarbeit, S. Kleber (Betreuung), F. Kargl (Prüfer), Institut of Distributed Systems, Ulm University, 2019 – Verfügbar.
Security assessments of networked systems require knowledge about the utilized communication protocol. For proprietary protocols without known specification and with only limited access to the end-points, the only source of information is the communication itself. To correctly conclude from the captured byte stream to message-formats, -types, and finally a protocol model, structure, message- and field-boundaries, data-type, and semantics need to be inferred. After an initial inference procedure, it is desirable to refine the existing protocol model. Actively probing an entity for the validity of message syntaxes allows to targetedly enhance the knowledge about the protocol. To do this efficiently a smart method of automatically generating test-cases depending on the current protocol model needs to be developed.

Master-Arbeiten

„Confidential Computing via Multiparty Computation and Trusted Computing,“ Projektarbeit oder Masterarbeit, D. Meißner (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2022 – Verfügbar.
Secure multiparty computation and trusted computing are two very different approaches to perform computations on confidential data. MPC relies on provably secure but costly cryptography whereas trusted computing relies on somewhat trustworthy hardware. This difference also affects to the underlying attacker models. Simply put MPC requires non-colluding parties and trusted computer requires uncompromised hardware that was correctly manufactured. The goal of this topic is to explore a combination of both approaches to mitigate each others weaknesses for a specific use case where the computing parties are disjunct from data subjects.
„Extending ISOS by tentative decisions,“ Masterarbeit, F. J. Hauck (Betreuung), F. J. Hauck (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2022 – Verfügbar.
ISOS is a leaderless consensus protocol for state-machine replication. It brings any input to the state machines in a total order so that it can be processed in a deterministic way. Typically requests to the machines are processed after the decision in the consensus protocol. As the consensus takes many message exchanges it needs some time. A first goal of this thesis is to implement a version of ISOS in our own framework called SMRteez. The protocol shall be extended by a to-be-defined interface that delivers preliminary decision to a processing unit earlier than the final decision. The interface needs to be able to deliver not only final decisions but also revokations of preliminary decisions, so that the execution engine can abort processing. The student has to identify the extension points when and where preliminary decisions can be derived. Further the new protocol is to be evaluated in order to verify how many wrong decisions are processed in which situations (high load, faulty nodes, etc.). The execution engine is outside of this work, it just needs to be simulated, e.g. by re-executing aborted requests on definite decisions.
„Graph Machine Learning on Evolving Graphs,“ Masterarbeit, B. Erb (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2021 – Verfügbar.
Event-sourced graphs are a concept to capture graphs that are continuously evolving, e.g. based on a stream of live changes. Goal of this thesis is (a) to provide an overview of existing graph machine learning concepts, (b) to assess the applicability of machine learning mechansims on event-sourced graphs, and (c) to prove the feasibility with a prototype implementation. Basic knowledge of general machine learning concepts is a plus for this thesis.
„Library Isolation in Embedded Systems,“ Bachelorarbeit, Masterarbeit, F. Kargl (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2021 – Verfügbar.
Software vulnerabilities pose critical threats to safety-relevant systems like vehicles. For example, a bug in a library embedded into a control program of a braking electronic-control-unit (ECU) inside a vehicle might be exploited by attackers to infiltrate the ECU and disable the breaks. More and more of today's vehicle allow over-the-air update of their software, but this typically requires updating a full firmware or at least a monolitic binary. So even if the mentioned library is patched, it still takes substantial time to integrate the new library version with the binary, and create and distribute a new firmware. In this work, we want to investigate system-level mechanisms to isolate a faulty library by dissecting it from a binary and executing it in a sandboxed environment. Feasibility of the concepts should be demonstrated in a proof-of-concept implementation.
„Security Mechansims for Multi-Tenancy Event-Sourced Graphs,“ Masterarbeit, B. Erb (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2021 – Verfügbar.
Event-sourced graph computing allows to run computations on the latest state or on historical states of an evolving graph. Such event-sourced graphs capture highly connected application domains that are continuously evolving, e.g. based on streams of live changes. An advanced use case is the application of event-sourced graph computing with mutitple concurrent parties that feed in changes into the system and also run computations. Multi tenancy however requires novel mechanisms to address private computations and data access control. Goal of this thesis is (a) to compile a list of challenges when applying multi-tenancy graph computing, (b) to survey and assess possible security solutions, and (c) to contribute a prototype implementation. Basic knowledge of distributed systems and IT security is recommended for this thesis.
„Test-Case-Generation Strategies for Network-Protocol-Model Refinements,“ Bachelor's oder Masterarbeit, S. Kleber (Betreuung), F. Kargl (Prüfer), Institut of Distributed Systems, Ulm University, 2019 – Verfügbar.
Security assessments of networked systems require knowledge about the utilized communication protocol. For proprietary protocols without known specification and with only limited access to the end-points, the only source of information is the communication itself. To correctly conclude from the captured byte stream to message-formats, -types, and finally a protocol model, structure, message- and field-boundaries, data-type, and semantics need to be inferred. After an initial inference procedure, it is desirable to refine the existing protocol model. Actively probing an entity for the validity of message syntaxes allows to targetedly enhance the knowledge about the protocol. To do this efficiently a smart method of automatically generating test-cases depending on the current protocol model needs to be developed.

Themen nach Schwerpunkt

Netzwerke

„Test-Case-Generation Strategies for Network-Protocol-Model Refinements,“ Bachelor's oder Masterarbeit, S. Kleber (Betreuung), F. Kargl (Prüfer), Institut of Distributed Systems, Ulm University, 2019 – Verfügbar.
Security assessments of networked systems require knowledge about the utilized communication protocol. For proprietary protocols without known specification and with only limited access to the end-points, the only source of information is the communication itself. To correctly conclude from the captured byte stream to message-formats, -types, and finally a protocol model, structure, message- and field-boundaries, data-type, and semantics need to be inferred. After an initial inference procedure, it is desirable to refine the existing protocol model. Actively probing an entity for the validity of message syntaxes allows to targetedly enhance the knowledge about the protocol. To do this efficiently a smart method of automatically generating test-cases depending on the current protocol model needs to be developed.

Mobile Systeme

Distributed Computing

Privacy

„Confidential Computing via Multiparty Computation and Trusted Computing,“ Projektarbeit oder Masterarbeit, D. Meißner (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2022 – Verfügbar.
Secure multiparty computation and trusted computing are two very different approaches to perform computations on confidential data. MPC relies on provably secure but costly cryptography whereas trusted computing relies on somewhat trustworthy hardware. This difference also affects to the underlying attacker models. Simply put MPC requires non-colluding parties and trusted computer requires uncompromised hardware that was correctly manufactured. The goal of this topic is to explore a combination of both approaches to mitigate each others weaknesses for a specific use case where the computing parties are disjunct from data subjects.
„Graph Machine Learning on Evolving Graphs,“ Masterarbeit, B. Erb (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2021 – Verfügbar.
Event-sourced graphs are a concept to capture graphs that are continuously evolving, e.g. based on a stream of live changes. Goal of this thesis is (a) to provide an overview of existing graph machine learning concepts, (b) to assess the applicability of machine learning mechansims on event-sourced graphs, and (c) to prove the feasibility with a prototype implementation. Basic knowledge of general machine learning concepts is a plus for this thesis.
„Security Mechansims for Multi-Tenancy Event-Sourced Graphs,“ Masterarbeit, B. Erb (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2021 – Verfügbar.
Event-sourced graph computing allows to run computations on the latest state or on historical states of an evolving graph. Such event-sourced graphs capture highly connected application domains that are continuously evolving, e.g. based on streams of live changes. An advanced use case is the application of event-sourced graph computing with mutitple concurrent parties that feed in changes into the system and also run computations. Multi tenancy however requires novel mechanisms to address private computations and data access control. Goal of this thesis is (a) to compile a list of challenges when applying multi-tenancy graph computing, (b) to survey and assess possible security solutions, and (c) to contribute a prototype implementation. Basic knowledge of distributed systems and IT security is recommended for this thesis.

IT-Sicherheit

„Confidential Computing via Multiparty Computation and Trusted Computing,“ Projektarbeit oder Masterarbeit, D. Meißner (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2022 – Verfügbar.
Secure multiparty computation and trusted computing are two very different approaches to perform computations on confidential data. MPC relies on provably secure but costly cryptography whereas trusted computing relies on somewhat trustworthy hardware. This difference also affects to the underlying attacker models. Simply put MPC requires non-colluding parties and trusted computer requires uncompromised hardware that was correctly manufactured. The goal of this topic is to explore a combination of both approaches to mitigate each others weaknesses for a specific use case where the computing parties are disjunct from data subjects.
„Library Isolation in Embedded Systems,“ Bachelorarbeit, Masterarbeit, F. Kargl (Betreuung), F. Kargl (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2021 – Verfügbar.
Software vulnerabilities pose critical threats to safety-relevant systems like vehicles. For example, a bug in a library embedded into a control program of a braking electronic-control-unit (ECU) inside a vehicle might be exploited by attackers to infiltrate the ECU and disable the breaks. More and more of today's vehicle allow over-the-air update of their software, but this typically requires updating a full firmware or at least a monolitic binary. So even if the mentioned library is patched, it still takes substantial time to integrate the new library version with the binary, and create and distribute a new firmware. In this work, we want to investigate system-level mechanisms to isolate a faulty library by dissecting it from a binary and executing it in a sandboxed environment. Feasibility of the concepts should be demonstrated in a proof-of-concept implementation.

Fehlertoleranz

„Extending ISOS by tentative decisions,“ Masterarbeit, F. J. Hauck (Betreuung), F. J. Hauck (Prüfer), Inst. of Distr. Sys., Ulm Univ., 2022 – Verfügbar.
ISOS is a leaderless consensus protocol for state-machine replication. It brings any input to the state machines in a total order so that it can be processed in a deterministic way. Typically requests to the machines are processed after the decision in the consensus protocol. As the consensus takes many message exchanges it needs some time. A first goal of this thesis is to implement a version of ISOS in our own framework called SMRteez. The protocol shall be extended by a to-be-defined interface that delivers preliminary decision to a processing unit earlier than the final decision. The interface needs to be able to deliver not only final decisions but also revokations of preliminary decisions, so that the execution engine can abort processing. The student has to identify the extension points when and where preliminary decisions can be derived. Further the new protocol is to be evaluated in order to verify how many wrong decisions are processed in which situations (high load, faulty nodes, etc.). The execution engine is outside of this work, it just needs to be simulated, e.g. by re-executing aborted requests on definite decisions.

Cloud Computing

Multimediakommunikation

Weitere Themen