Dr. rer. nat. Sebastian Berndt

Wissenschaftlicher Mitarbeiter
Ratzeburger Allee 160
23562 Lübeck
Gebäude 64, 1. OG, Raum 049
Email: | s.berndt(at)uni-luebeck.de |
Phone: | +49 451 3101 6613 |
Fax: | +49 451 3101 6604 |
Publikationen
2021
Sebastian
Berndt,
Klaus
Jansen and
Kim-Manuel
Klein,
New Bounds for the Vertices of the Integer Hull
in SOSA@SODA
,
SIAM,
2021.
Sebastian
Berndt,
Klaus
Jansen and
Alexandra
Lassota,
Tightness of Sensitivity and Proximity Bounds for Integer Programs
in SOFSEM (accepted)
,
2021.
2020
Sebastian
Berndt,
Jan
Wichelmann,
Claudius
Pott,
Tim-Henrik
Traving and
Thomas
Eisenbarth,
ASAP: Algorithm Substitution Attacks on Cryptographic Protocols
,
IACR Cryptol. ePrint Arch.
,
vol. 2020,
pp. 1452,
2020.
Datei: | https://eprint.iacr.org/2020/1452 |
Sebastian
Berndt and
Maciej
Liskiewicz,
On the universal steganography of optimal rate
,
Inf. Comput.
,
vol. 275,
pp. 104632,
2020.
Max
Bannach,
Sebastian
Berndt,
Martin
Schuster and
Marcel
Wienöbst,
PACE Solver Description: Fluid
in IPEC
,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020.
pp. 27:1--27:3.
Max
Bannach,
Sebastian
Berndt,
Martin
Schuster and
Marcel
Wienöbst,
PACE Solver Description: PID (star)
in IPEC
,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020.
pp. 28:1--28:4.
Okan
Seker,
Sebastian
Berndt,
Luca
Wilke and
Thomas
Eisenbarth,
SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis
in CCS
,
ACM,
2020.
pp. 1033--1049.
DOI: | 10.1145/3372297.3417889 |
Datei: | https://dl.acm.org/doi/10.1145/3372297.3417889 |
Max
Bannach,
Sebastian
Berndt,
Marten
Maack,
Matthias
Mnich,
Alexandra
Lassota,
Malin
Rau and
Malte
Skambath,
Solving Packing Problems with Few Small Items Using Rainbow Matchings
in MFCS 2020
,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020.
2019
Sebastian
Berndt,
Leah
Epstein,
Klaus
Jansen,
Asaf
Levin,
Marten
Maack and
Lars
Rohwedder,
Online Bin Covering with Limited Migration
in ESA
,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019.
pp. 18:1--18:14.
Max
Bannach and
Sebastian
Berndt,
Positive-Instance Driven Dynamic Programming for Graph Searching
in WADS
,
Springer,
2019.
pp. 43--56.
Sebastian
Berndt,
Valentin
Dreismann,
Kilian
Grage,
Klaus
Jansen and
Ingmar
Knof,
Robust Online Algorithms for Certain Dynamic Packing Problems
in WAOA
,
Springer,
2019.
pp. 43--59.
2018
Sebastian
Berndt and
Kim-Manuel
Klein,
Using Structural Properties for Integer Programs
in CiE
,
Springer,
2018.
pp. 89--96.
Sebastian Berndt,
Computing Tree Width: From Theory to Practice and Back
in CiE
,
Springer,
2018.
pp. 81--88.
Max
Bannach and
Sebastian
Berndt,
Practical Access to Dynamic Programming on Tree Decompositions
in ESA
,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018.
pp. 6:1--6:13.
Sebastian
Berndt and
Maciej
Liskiewicz,
On the Gold Standard for Security of Universal Steganography
in EUROCRYPT (1)
,
Springer,
2018.
pp. 29--60.
2017
Sebastian
Berndt and
Maciej
Liskiewicz,
Algorithm Substitution Attacks from a Steganographic Perspective
in ACM Conference on Computer and Communications Security
,
ACM,
2017.
pp. 1649--1660.
Max
Bannach,
Sebastian
Berndt and
Thorsten
Ehlers,
Jdrasil: A Modular Library for Computing Tree Decompositions
in SEA
,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017.
pp. 28:1--28:21.
Sebastian
Berndt,
Maciej
Liskiewicz,
Matthias
Lutter and
Rüdiger
Reischuk,
Learning Residual Alternating Automata
in AAAI
,
AAAI Press,
2017.
pp. 1749--1755.
2016
Sebastian
Berndt and
Maciej
Liskiewicz,
Hard Communication Channels for Steganography
in ISAAC
,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016.
pp. 16:1--16:13.
Sebastian
Berndt and
Maciej
Liskiewicz,
Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions
in IH&MMSec
,
ACM,
2016.
pp. 81--92.
Sebastian
Berndt and
Rüdiger
Reischuk,
Steganography Based on Pattern Languages
in LATA
,
Springer,
2016.
pp. 387--399.
2015
Sebastian
Berndt,
Klaus
Jansen and
Kim-Manuel
Klein,
Fully Dynamic Bin Packing Revisited
in APPROX-RANDOM
,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015.
pp. 135--151.