Sebastian Berndt

Sebastian Berndt

Postdoc in IT security

University of Lübeck

Biography

Sebastian Berndt is a postdoc at the Institute for IT Security led by Prof. Dr. Thomas Eisenbarth at the University of Lübeck. His research interests revolve around intractable problems. On the one hand, he applies these problems to cryptography and steganography to enable secure communication. On the other hand, he tries to solve them with approaches such as approximation algorithms or fixed-parameter-tractability.

List of Coauthors

I had the pleasure to work with very talented researchers. In alphabetical order, they are

Max Bannach, Valentin Dreismann, Thorsten Ehlers, Thomas Eisenbarth, Leah Epstein, Kilian Grage, Klaus Jansen, Kim-Manuel Klein, Ingmar Knof, Alexandra Lassota, Asaf Levin, Maciej Liśkiewicz, Matthias Lutter, Marten Maack, Matthias Mnich, Dirk Nowotka, Claudius Pott, Malin Rau, Rüdiger Reischuk, Lars Rohwedder, Okan Seker, Malte Skambath, Tim-Henrik Traving, Jan Wichelmann, Luca Wilke

Interests

  • Cryptography
  • IT security
  • Algorithms (Parameterized, Approximation, Online)

Education

  • PhD in Computer Science (summa cum laude), 2018

    University of Lübeck

  • M.Sc. in Computer Science, 2012

    Kiel University

  • BSc in Computer Science, 2010

    Kiel University

Recent Posts

Program Commitees 2021

I’ll be on the program commitee of COSADE 2021 and on the shadow program commitee of S&P 2021.

SOSA 2021

Our paper New Bounds for the Vertices of the Integer Hull was accepted at SOSA 2021.

SOFSEM 2021

Our paper Tightness of Sensitivity and Proximity Bounds for Integer Programs was accepted at SOFSEM 2021.

CCS 2020

Our paper SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis was accepted at CCS 2020.

MFCS 2020

Our paper Solving Packing Problems with Few Small Items Using Rainbow Matchings was accepted at MFCS 2020.

Recent Publications

Quickly discover relevant content by filtering publications.

On the Universal Steganography of Optimal Rate (Inf. Comput. 2020)

In this work, we present the first secure steganographic protocol in the common computational model which, for any communication …

New Bounds for the Vertices of the Integer Hull (SOSA 2021)

The vertices of the integer hull are the integral equivalent to the well-studied basic feasible solutions of linear programs. In this …

Tightness of Sensitivity and Proximity Bounds for Integer Programs (SOFSEM 2021)

We consider Integer Programs (IPs) where each variable corresponds to an integral point within a polytope $\mathcal{P}\subseteq …

SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis (CCS 2020)

Abstract: MPC-in-the-head based protocols have recently gained much popularity and are at the brink of seeing widespread usage. With …

Solving Packing Problems with Few Small Items Using Rainbow Matchings (MFCS 2020)

An important area of combinatorial optimization is the study of packing and covering problems, such as Bin Packing, Multiple Knapsack, …

Contact