UPB Bildmarke
Codes and Cryptography
Contact
  • Deutsch
  • English
    • Open Page "Teaching"
      • Open Page "Current Courses"
      • Foundations of Cryptography
      • Komplexitätstheorie (in English)
      • Seminar: Current topics in Cryptography
      • Open Page "Terms"
      • Overview of all terms
      • ST 2025
      • WS 2024/25
      • SS 2024
      • WT 2023/24
      • SS 2023
      • WT 2022/23
      • ST 2022
      • WT 2021/22
      • ST 2021
      • WT 2020/21
      • ST 2020
      • WT 2019/2020
      • Open Page "Student Projects"
      • Open Theses
      • Material / Theses templates
      • Completed Diploma-/Masterstheses
      • Completed Bachelorstheses
    • Open Page "Research"
      • Open Page "Thematic Priorities"
      • Anonymous Credential Systems
      • Cryptimeleon
      • Incentive Systems
      • Rational Cryptography
      • Secure Multiparty Computation
      • Clusteranalysis
      • Open Page "Projects"
      • CRC 901
      • Soft-Clustering -- Von Heuristiken zu Approximationsalgorithmen
      • Securing the Financial Cloud
      • KogniHome
      • Completed Projects
      • Open Page "Publications"
      • List of Publications
      • Dissertations
    • Open Page "Team"
    • Johannes Blömer
    • Elisabeth Schlatt
    • Henrik Bröcher
    • Laurens Porzenheim
    • Stanislaw Soltan
    • Yinzi Xiao
    • Former Employees
    • Open Page "Faculty"
    • Faculty of Computer Science, Electrical Engineering and Mathematics
    • Department of Electrical Engineering and Information Technology
    • Department of Computer Science
    • Institute of Mathematics
Open Theses
Open Theses
Mas­ter's theses
Bach­el­or's theses
  1. Faculty of Computer Science, Electrical Engineering and Mathematics
  2. Institute of Computer Science
  3. Codes and Cryptography
  4. Teaching
  5. Open Theses

Open Theses

In addition to the topics listed here, we can also find topics adapted to your own interests at short notice upon request. For an orientation on what you might be interested in, we recommend to have a look at the main research topics of the working group.

If you are interested in writing a thesis with us, please contact Prof. Blömer. Even if none of the listed topics below interests you, still feel free to contact us and we'll try to find a good topic together. If you are looking for a general overview of open topics including other working groups, then please see this overview.

Mas­ter's theses

Fuzzy k-Means is a popular generalization of the classical k-Means problem to soft clusterings. From an algorithmic perspective however, it is much more difficult to compute provably good solutions. Typically, these problems use the squared Euclidean distance to measure how far data points are apart. The squared Euclidean distance is part of the mu-similar Bregman divergences, a large class of dissimilarity measures sharing desirable characteristics.

Using sampling techniques to find good approximations of optimal centroids has proven to work for both, the k-Means problem using mu-similar Bregman divergences and also for the Fuzzy k-Means problem using the squared Euclidean distance. The goal of this thesis is to explore whether this can actually be combined to obtain a good approximation algorithm for the Fuzzy k-Means problem using mu-similar Bregman divergences.

Contact: Johannes Blömer

Bach­el­or's theses

In lattice cryptography there are many parameters. Many, if not all useful theorems require certain bounds on these parameters. Examples for these parameters are the length of some vectors under the L2 norm or the infinity norm, the spectral norm of matrices of certain distributions, or the so-called smoothing parameter.

When instantiating cryptographic schemes based on lattices, one has to decide on values for these parameters, such that security still holds. However, theoretical bounds can often be quite conservative, leading to not-so efficient schemes.

The question now is whether there are heuristics with which one could choose values for the parameters and how much these heuristics could improve the efficiency of the cryptographic schemes.

Your task is to identify interesting parameters, to create and implement heuristic tests for bounds and to compare the heuristics to the theoretical bounds. Afterwards you compare the efficiency of instantiations of some cryptographic schemes based on your heuristics and theoretical bounds.

A Decade of Lattice Cryptography: https://eprint.iacr.org/2015/939.pdf A good starting point to learn about lattices.

Supervisor: Laurens Porzenheim Mail

Codes and Cryptography

Warburger Str. 100
33098 Paderborn
Germany

Universität Paderborn

Warburger Str. 100
33098 Paderborn
Germany

Phone University

+49 5251 60-0
Legal notice
  • Imprint
  • Data privacy
  • Whistleblower system
Social networks