Master's theses of year 2020
Theses and projects (PhD, MSc, BSc, Project)
-
Improving Data Locality in Distributed Processing of Multi-Channel Remote Sensing Data with Potentially Large Stencils.
2
2020.
BibTeX Entry
@misc{poso20, author = {Philipp Posovzky}, title = {{Improving} {Data} {Locality} in {Distributed} {Processing} of {Multi-Channel} {Remote} {Sensing} {Data} with {Potentially} {Large} {Stencils}}, year = {2020}, key = {poso20}, month = {2}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Roger Kowalewski}, type = {Masterthesis}, } -
Konzeption und Implementierung einer SaaS-Lösung zur Unterstützung von Awareness-Programmen in der Informationssicherheit.
3
2020.
BibTeX Entry
@misc{shyl20, author = {Olena Shylobokova}, title = {{Konzeption} und {Implementierung} einer {SaaS-Lösung} zur {Unterstützung} von {Awareness-Programmen} in der {Informationssicherheit}}, year = {2020}, key = {shyl20}, month = {3}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Michael Brenner and Jule Ziegler}, type = {Masterthesis}, } -
Evaluating the Scalability of State Channels for Real-Time Blockchain Applications.
3
2020.
BibTeX Entry
@misc{sako20, author = {Julian Sakowski}, title = {{Evaluating} the {Scalability} of {State} {Channels} for {Real-Time} {Blockchain} {Applications}}, year = {2020}, key = {sako20}, month = {3}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Andre Luckow}, type = {Masterthesis}, } -
Auswirkungen von Netzvirtualisierung auf Organisationsstrukturen und Prozesse im IT-Betrieb.
4
2020.
PDF
BibTeX Entry
@misc{tomz20, author = {Milian Tomzig}, title = {{Auswirkungen} von {Netzvirtualisierung} auf {Organisationsstrukturen} und {Prozesse} im {IT-Betrieb}}, year = {2020}, pdf = {https://bib.nm.ifi.lmu.de/pdf/tomz20.pdf}, key = {tomz20}, month = {4}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Tobias Lindinger and Jan Schmidt}, type = {Masterthesis}, } -
Test-Umgebung zur Evaluierung von Schwachstellenscannern.
7
2020.
PDF
Abstract
Schwachstellenscanner ermöglichen es Zielsysteme auf das Vorhandensein bekannter Sicherheitslücken zu untersuchen. Studien zeigen, dass die Wahl des richtigen Schwachstellenscanners essenziell für die Qualität der Scan-Ergebnisse ist und ein falscher Scanner oder eine falsche Konfiguration unzureichende und fehlerhafte Ergebnisse erzeugen können. Unerkannte Schwachstellen können als Einfallstor für Hacker dienen und stellen somit ein Risiko für die Sicherheit einer Anwendung dar. Ein passender Scanner ist abhängig von szenario-spezifischen Anforderungen. So ist nicht jeder Scanner für jeden Anwendungsfall ähnlich geeignet oder verschlechtert sogar die Scan-Resultate, wenn er falsch angewendet wird. Konkret ist ein Scanner von Datenbanken nicht ebenso gut für Scans von Webseiten geeignet. Diese Masterarbeit entwickelt das Konzept einer universellen automatisierten Test-Umgebung für Schwachstellenscanner, welche Unternehmen und Forschenden dabei hilft verschiedene Schwachstellenscanner miteinander zu vergleichen. Der Vergleich geschieht anhand von Qualitätsmerkmalen eines solchen Scanners. Die Erkennungsrate der vorhandenen Schwachstellen sowie Nebenwirkungen der Scans auf die Zielsysteme sind beispielhafte Merkmale. Die zu beantwortende Kernfrage lautet: Wie sieht das Konzept einer gesamtheitlichen Test-Umgebung für Schwachstellenscanner aus und lässt sich dieses anhand einer Referenzimplementierung in der Praxis anwenden? In dieser Arbeit werden zunächst Anforderungen an eine solche Test-Umgebung aus Anwendungsfällen abgeleitet, welche im Folgenden die Grundlage eines Gesamtkonzepts bilden. Eine anschließende Referenzimplementierung zeigt, wie eine Test-Umgebung es einem Anwender ermöglicht eine informierte Entscheidung bezüglich eines passenden Schwachstellenscanners zu treffen.BibTeX Entry
@misc{wuer20, author = {Robin Würz}, title = {{Test-Umgebung} zur {Evaluierung} von {Schwachstellenscannern}}, year = {2020}, pdf = {https://bib.nm.ifi.lmu.de/pdf/wuer20.pdf}, abstract = {Schwachstellenscanner ermöglichen es Zielsysteme auf das Vorhandensein bekannter Sicherheitslücken zu untersuchen. Studien zeigen, dass die Wahl des richtigen Schwachstellenscanners essenziell für die Qualität der Scan-Ergebnisse ist und ein falscher Scanner oder eine falsche Konfiguration unzureichende und fehlerhafte Ergebnisse erzeugen können. Unerkannte Schwachstellen können als Einfallstor für Hacker dienen und stellen somit ein Risiko für die Sicherheit einer Anwendung dar. Ein passender Scanner ist abhängig von szenario-spezifischen Anforderungen. So ist nicht jeder Scanner für jeden Anwendungsfall ähnlich geeignet oder verschlechtert sogar die Scan-Resultate, wenn er falsch angewendet wird. Konkret ist ein Scanner von Datenbanken nicht ebenso gut für Scans von Webseiten geeignet. Diese Masterarbeit entwickelt das Konzept einer universellen automatisierten Test-Umgebung für Schwachstellenscanner, welche Unternehmen und Forschenden dabei hilft verschiedene Schwachstellenscanner miteinander zu vergleichen. Der Vergleich geschieht anhand von Qualitätsmerkmalen eines solchen Scanners. Die Erkennungsrate der vorhandenen Schwachstellen sowie Nebenwirkungen der Scans auf die Zielsysteme sind beispielhafte Merkmale. Die zu beantwortende Kernfrage lautet: Wie sieht das Konzept einer gesamtheitlichen Test-Umgebung für Schwachstellenscanner aus und lässt sich dieses anhand einer Referenzimplementierung in der Praxis anwenden? In dieser Arbeit werden zunächst Anforderungen an eine solche Test-Umgebung aus Anwendungsfällen abgeleitet, welche im Folgenden die Grundlage eines Gesamtkonzepts bilden. Eine anschließende Referenzimplementierung zeigt, wie eine Test-Umgebung es einem Anwender ermöglicht eine informierte Entscheidung bezüglich eines passenden Schwachstellenscanners zu treffen.}, key = {wuer20}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Tobias Appel}, type = {Masterthesis}, } -
Deep-learning-based analysis of hand radiographs to detect developmental disorder.
7
2020.
BibTeX Entry
@misc{lutz20, author = {Tobias Lutzenberger}, title = {{Deep-learning-based} analysis of hand radiographs to detect developmental disorder}, year = {2020}, key = {lutz20}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Sophia Grundner-Culemann and Zinterhof}, type = {Masterthesis}, } -
Evaluation of network-level Moving Target Defense Strategies.
4
2020.
BibTeX Entry
@misc{posc20, author = {Richard Poschinger}, title = {{Evaluation} of network-level {Moving} {Target} {Defense} {Strategies}}, year = {2020}, key = {posc20}, month = {4}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Nils gentschen Felde and Tobias Guggemos and Nils Rodday and Jan Schmidt}, type = {Masterthesis}, } -
Organisationsübergreifendes Security Incident Management am Beispiel des Münchner Wissenschaftsnetzes.
8
2020.
BibTeX Entry
@misc{miza20, author = {Maximilian Miran Mizani}, title = {{Organisationsübergreifendes} {Security} {Incident} {Management} am {Beispiel} des {Münchner} {Wissenschaftsnetzes}}, year = {2020}, key = {miza20}, month = {8}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Stefan Metzger}, type = {Masterthesis}, } -
Evaluation of Real-Time Music Feature Extraction for Reharmonization.
8
2020.
BibTeX Entry
@misc{visi20, author = {Valentina Visintini}, title = {{Evaluation} of {Real-Time} {Music} {Feature} {Extraction} for {Reharmonization}}, year = {2020}, key = {visi20}, month = {8}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Roger Kowalewski and Tobias Fuchs}, type = {Masterthesis}, } -
Index Set Mappings for Multidimensional Views on PGAS Data Domains.
8
2020.
BibTeX Entry
@misc{herg20, author = {Marius Herget}, title = {{Index} {Set} {Mappings} for {Multidimensional} {Views} on {PGAS} {Data} {Domains}}, year = {2020}, key = {herg20}, month = {8}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Roger Kowalewski and Tobias Fuchs}, type = {Masterthesis}, } -
Deriving and Distributing Static Compression Context for LPWANs via IKEv2.
8
2020.
PDF
Abstract
Header compression is a way to adapt existing network protocols for use in IoT (Internet of Things) scenarios. The motivation is the limited network bandwidth and energy budget of IoT devices. Specifically, default IPv6 requires the maximum transmission unit (MTU) to be at least 1280 bytes, which is not feasible for many of the networking devices used in IoT. Existing header compression protocols use prior knowledge (context) and/or approximations to encapsulate and compress header data of common network protocols. Static context header compression (SCHC) is one such protocol and uses exclusively prior knowledge (static context) to elide or compress header fields. A major shortcoming of SCHC is the lack of mechanics to distribute this static context between communication partners as it relies solely on manual configuration. This work examines the possibility to combine SCHC with IPSec and use its key exchange protocol (IKEv2) to identify and distribute context information. The concept introduced in this work is able to leverage the power of header compression to reduce the overhead created by the protocols in the IP stack without relying on the manual configuration of SCHC. To this goal, we develop a method to derive static compression context for SCHC from the context information stored in the IPsec Security Associations. The proof of concept demonstrates some of the major obstacles that have to be overcome to successfully integrate SCHC processing into the IPsec suite.BibTeX Entry
@misc{hald20, author = {Sebastian Halder}, title = {{Deriving} and {Distributing} {Static} {Compression} {Context} for {LPWANs} via {IKEv2}}, year = {2020}, pdf = {https://bib.nm.ifi.lmu.de/pdf/hald20.pdf}, abstract = {Header compression is a way to adapt existing network protocols for use in IoT (Internet of Things) scenarios. The motivation is the limited network bandwidth and energy budget of IoT devices. Specifically, default IPv6 requires the maximum transmission unit (MTU) to be at least 1280 bytes, which is not feasible for many of the networking devices used in IoT. Existing header compression protocols use prior knowledge (context) and/or approximations to encapsulate and compress header data of common network protocols. Static context header compression (SCHC) is one such protocol and uses exclusively prior knowledge (static context) to elide or compress header fields. A major shortcoming of SCHC is the lack of mechanics to distribute this static context between communication partners as it relies solely on manual configuration. This work examines the possibility to combine SCHC with IPSec and use its key exchange protocol (IKEv2) to identify and distribute context information. The concept introduced in this work is able to leverage the power of header compression to reduce the overhead created by the protocols in the IP stack without relying on the manual configuration of SCHC. To this goal, we develop a method to derive static compression context for SCHC from the context information stored in the IPsec Security Associations. The proof of concept demonstrates some of the major obstacles that have to be overcome to successfully integrate SCHC processing into the IPsec suite.}, annote = {embedded-msec}, key = {hald20}, month = {8}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Tobias Guggemos}, type = {Masterthesis}, }Additional Infos
embedded-msec -
Practicability of XMSS on JavaCards.
7
2020.
PDF
Abstract
Advancements in the field of quantum computing pose a threat to cryptographic systems used today. As a result, alternatives for all kinds of cryptographic algorithms need to be found, with digital signatures being one of them. However, with the transition to quantum-secure signature schemes a number of challenges arise. The increased computational effort necessary for signature generation and the associated key sizes are especially problematic when executed on devices with limited resources like SmartCards. Since they are a crucial building block in modern security systems, it is important to bring quantum-secure schemes onto them. A special kind of SmartCard are JavaCards. While not being able to provide the same level of performance as native cards programmed in C or Assembler, the usage of the Java Virtual Machine allows applications to run manufacturer and hardware independent. This can be an important factor when it comes to widespread distribution of a new quantum-secure signature scheme. A promising candidate regarding quantum-secure signature algorithms is XMSS. This hash based scheme solely relies on the security of the underlying hash function. However it comes with a high computational cost of repeated hash function evaluations. The goal of this thesis is to implement this scheme on a JavaCard and analyze its real-world practicability. The implementation uses the BDS tree traversal algorithm, providing a trade-off between memory usage and runtimes. By decoupling the computationally most expensive part of XMSS into an independent subroutine, operations necessary for the creation of signatures are minimized. The provided API allows signature generation with minimal communication between SmartCard and host. A parameter set optimized for fast runtimes is found and the resulting measurements are compared to requirements derived from possible use-cases. The results show that real-world applicability can only be achieved to a limited degree with runtimes significantly longer than the ones of conventional signature algorithms.BibTeX Entry
@misc{kage20, author = {Thomas Kagermeier}, title = {{Practicability} of {XMSS} on {JavaCards}}, year = {2020}, pdf = {https://bib.nm.ifi.lmu.de/pdf/kage20.pdf}, abstract = {Advancements in the field of quantum computing pose a threat to cryptographic systems used today. As a result, alternatives for all kinds of cryptographic algorithms need to be found, with digital signatures being one of them. However, with the transition to quantum-secure signature schemes a number of challenges arise. The increased computational effort necessary for signature generation and the associated key sizes are especially problematic when executed on devices with limited resources like SmartCards. Since they are a crucial building block in modern security systems, it is important to bring quantum-secure schemes onto them. A special kind of SmartCard are JavaCards. While not being able to provide the same level of performance as native cards programmed in C or Assembler, the usage of the Java Virtual Machine allows applications to run manufacturer and hardware independent. This can be an important factor when it comes to widespread distribution of a new quantum-secure signature scheme. A promising candidate regarding quantum-secure signature algorithms is XMSS. This hash based scheme solely relies on the security of the underlying hash function. However it comes with a high computational cost of repeated hash function evaluations. The goal of this thesis is to implement this scheme on a JavaCard and analyze its real-world practicability. The implementation uses the BDS tree traversal algorithm, providing a trade-off between memory usage and runtimes. By decoupling the computationally most expensive part of XMSS into an independent subroutine, operations necessary for the creation of signatures are minimized. The provided API allows signature generation with minimal communication between SmartCard and host. A parameter set optimized for fast runtimes is found and the resulting measurements are compared to requirements derived from possible use-cases. The results show that real-world applicability can only be achieved to a limited degree with runtimes significantly longer than the ones of conventional signature algorithms.}, annote = {quasimodo}, key = {kage20}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Tobias Guggemos and Sophia Grundner-Culemann and Gazdag}, type = {Masterthesis}, }Additional Infos
quasimodo -
Availability Scoring for Dynamic Redundancy in Distributed Hash Tables.
11
2020.
BibTeX Entry
@misc{ried20, author = {Korbinian Riedl}, title = {{Availability} {Scoring} for {Dynamic} {Redundancy} in {Distributed} {Hash} {Tables}}, year = {2020}, key = {ried20}, month = {11}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Jan Schmidt}, type = {Masterthesis}, } -
Identitätsbasierte Signaturen für quantenresistentes IKEv2.
9
2020.
BibTeX Entry
@misc{lind20, author = {David Linder}, title = {{Identitätsbasierte} {Signaturen} für quantenresistentes {IKEv2}}, year = {2020}, annote = {quasimodo}, key = {lind20}, month = {9}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Tobias Guggemos and Sophia Grundner-Culemann}, type = {Masterthesis}, }Additional Infos
quasimodo -
Ontologie zur Auswertung der Privatsphäre im Internet der Dinge.
7
2020.
BibTeX Entry
@misc{eich20, author = {Daniel Eichinger}, title = {{Ontologie} zur {Auswertung} der {Privatsphäre} im {Internet} der {Dinge}}, year = {2020}, key = {eich20}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Tobias Guggemos and Jan Schmidt}, type = {Masterthesis}, }
Disclaimer:
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.