Oberseminar Rechnernetze und Telematik (Winter 2025/2026)

In the oberseminar, talks are held on selected topics, as well as final presentations of master's & bachelor's theses, and projects. The seminar takes place hybridly:

• In room 051-02-008, as well as via
• Zoom - link (Meeting-ID: 879 6692 5056, password: WR6RriwYD)

Upcoming Oberseminar Talks:

• 29.10.2025 14:00-15:00 Moritz Michalak and Johann Cuthbertson , Master Project final presentations
  Title: Simulation and Analysis of Flip Operations on Ring of Cliques
  
  Sub-Title 1: Verification of the upper bound by averaged simulations (Johann Cuthbertson)
  Sub-Title 2: Analysis of Expected Cut Size and Expected Cut Strain running simulations on certain single cuts (Moritz Michalak)
  Abstract: Our work deals with the paper Expanders via local edge flips in quasilinear time by Giakkoupis (2022). To present our project, we want to proceed in three steps: 
  1. A brief overview on the key points of the Giakkoupis paper: What new was found and how it was done.
  2. Graph Topology used for the project.
  3. What we simulated

• 29.10.2025 14:00-16:00 Christian Schindelhauer: Project and Theses Topics at the chair of Computer Networks and Telematics

• 05.11.2025 14:45-16:00 Christian Schindelhauer: Survey Talk
  Title: On the Theory of Distributional NP Complete Problems 
  Abstract: We survey the history and the current state of Average-P and its relationship to NP.

Previous Oberseminar Talks:

• 15.10.2025 14:00-14:30 Bachelor Project intermediate presentation
  Title: A new Peer-To-Peer MCG Architecture
  Abstract :
  The original plan for the MCG implementation was to run entirely in a browser, utilizing the WebAssembly runtime. Browsers impose fundamental limits which make most kinds of peer to peer or utilizing the project to implement new kinds of data transfer impossible. I have now reworked the entire architecture to be split into a native application running all the game logic, cryptography and communication, and a thin frontend still compiling to WASM, keeping compatibility with Smartphones. With the ability to run native code, a lot of previously pending features were now implemented. The project can now utilize multiple different protocols for transport, among them the NAT hole punching library iroh. There is also a command line interface enabling automated testing. Another new feature is a rudimentary Poker GUI in the interface, as well as a poker engine in the backend along with a protocol for communicating with said engine. The protocol is designed to be extensible to other card games, and compliance with the protocol can be checked entirely at compile time.
  The mcg repository is intended to serve as a central codebase for multiple mental card game projects, so the presentation will also go into the development setup and how to extend existing functionality.

• 08.10.2025 14:00-14:30 Marvin Stötzel: intermediate presentation Bachelor Project
  Title: Prototype Implementation of a Client–Server Poker Engine in Rust ( ZKpoker)
  Abstract : I present ZKpoker, a client–server prototype for Texas Hold’em in Rust. The server acts as the authoritative game engine; multiple clients connect via an encrypted transport (Noise/snow) layered on WebSockets (tokio-tungstenite).
  The prototype includes a egui-based UI, centralized game-state management, and synchronized updates across clients. Zero-knowledge shuffling and proof verification are deferred to future work. We document the architecture, runtime flow, design decisions, and limitations, and outline next steps toward stronger security properties and a possible distributed (P2P) redesign.

   

• 08.10.2025 14:35-15:05 Benedikt Nothhelfer,  Bachelor project final presentation
  Title: Scalable Shuffle for Mental Card Games
  Abstract: In Mental Card Games, traditional shuffle protocols often assume all players in shuffling the entire deck. For an increasing amount of players, and correspondingly increasing deck size, this leads to significant communication and computational overhead. We present an approach for a verifiable shuffle algorithm, that restricts shuffling operations to a subset of players and operates on deck partitions. We examine this approach and develop a protocol, which utilizes commitment schemes, bulletproofs and a shuffle argument, to guarantee correctness and secrecy. Our protocol achieves asymptotically lower communication complexity and parallelizable execution while preserving randomness and preventing bias or leakage of card order.