Sebastian Berndt

ORCID

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 56

Top Venues

CoRR

IACR Cryptol. ePrint Arch.

CCS

CiE

University of Lübeck, Germany (PHD)

Education History

University of Lübeck, Germany

PHD

Publications

Maximilian Rettinger, Sebastian Berndt, Gerhard Rigoll, Christoph Schmaderer
Collaborative VR: Conveying a Complex Disease and Its Treatment. VRW (2023)
Pascal Bemmann, Sebastian Berndt, Denis Diemert, Thomas Eisenbarth, Tibor Jager
Subversion-Resilient Authenticated Encryption Without Random Oracles. ACNS (2023)
Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. CoRR (2023)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online bin covering with limited migration. J. Comput. Syst. Sci. 134 (2023)
Jonas Sander, Sebastian Berndt, Ida Bruhns, Thomas Eisenbarth
DASH: Accelerating Distributed Private Machine Learning Inference with Arithmetic Garbled Circuits. CoRR (2023)
Pascal Bemmann, Sebastian Berndt, Denis Diemert, Thomas Eisenbarth, Tibor Jager
Subversion-Resilient Authenticated Encryption without Random Oracles. IACR Cryptol. ePrint Arch. 2023 (2023)
Sebastian Berndt, Franziska Eberle, Nicole Megow
Online load balancing with general reassignment cost. Oper. Res. Lett. 50 (3) (2022)
Max Bannach, Sebastian Berndt
Recent Advances in Positive-Instance Driven Graph Searching. Algorithms 15 (2) (2022)
Sebastian Berndt, Jan Wichelmann, Claudius Pott, Tim-Henrik Traving, Thomas Eisenbarth
ASAP: Algorithm Substitution Attacks on Cryptographic Protocols. AsiaCCS (2022)
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
Learning residual alternating automata. Inf. Comput. 289 (Part) (2022)
Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder
Load Balancing: The Long Road from Theory to Practice. ALENEX (2022)
Jan Wichelmann, Sebastian Berndt, Claudius Pott, Thomas Eisenbarth
Help, My Signal has Bad Device! - Breaking the Signal Messenger's Post-Compromise Security Through a Malicious Device. DIMVA (2021)
Florian Sieck, Sebastian Berndt, Jan Wichelmann, Thomas Eisenbarth
Util: : Lookup: Exploiting key decoding in cryptographic libraries. CoRR (2021)
Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz
"Act natural!": Having a Private Chat on a Public Blockchain. IACR Cryptol. ePrint Arch. 2021 (2021)
Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche
Robust Online Algorithms for Dynamic Choosing Problems. CiE (2021)
Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder
Load Balancing: The Long Road from Theory to Practice. CoRR (2021)
Sebastian Berndt, Klaus Jansen, Alexandra Lassota
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. SOFSEM (2021)
Florian Sieck, Sebastian Berndt, Jan Wichelmann, Thomas Eisenbarth
Util: : Lookup: Exploiting Key Decoding in Cryptographic Libraries. CCS (2021)
Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche
Robust Online Algorithms for Dynamic Choosing Problems. CoRR (2021)
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
New Bounds for the Vertices of the Integer Hull. SOSA (2021)
Diego F. Aranha, Sebastian Berndt, Thomas Eisenbarth, Okan Seker, Akira Takahashi, Luca Wilke, Greg Zaverucha
Side-Channel Protections for Picnic Signatures. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021 (4) (2021)
Diego F. Aranha, Sebastian Berndt, Thomas Eisenbarth, Okan Seker, Akira Takahashi, Luca Wilke, Greg Zaverucha
Side-Channel Protections for Picnic Signatures. IACR Cryptol. ePrint Arch. 2021 (2021)
Jan Wichelmann, Sebastian Berndt, Claudius Pott, Thomas Eisenbarth
Help, my Signal has bad Device! Breaking the Signal Messenger's Post-CompromiseSecurity through a Malicious Device. IACR Cryptol. ePrint Arch. 2021 (2021)
Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst
PACE Solver Description: Fluid. IPEC (2020)
Sebastian Berndt, Jan Wichelmann, Claudius Pott, Tim-Henrik Traving, Thomas Eisenbarth
ASAP: Algorithm Substitution Attacks on Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2020 (2020)
Sebastian Berndt, Maciej Liskiewicz
On the universal steganography of optimal rate. Inf. Comput. 275 (2020)
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
Fully dynamic bin packing revisited. Math. Program. 179 (1) (2020)
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
Solving Packing Problems with Few Small Items Using Rainbow Matchings. CoRR (2020)
Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst
PACE Solver Description: PID^⋆. IPEC (2020)
Okan Seker, Sebastian Berndt, Luca Wilke, Thomas Eisenbarth
SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis. CCS (2020)
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
Solving Packing Problems with Few Small Items Using Rainbow Matchings. MFCS (2020)
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
New Bounds for the Vertices of the Integer Hull. CoRR (2020)
Sebastian Berndt, Klaus Jansen, Alexandra Lassota
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. CoRR (2020)
Okan Seker, Sebastian Berndt, Thomas Eisenbarth
SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis. IACR Cryptol. ePrint Arch. 2020 (2020)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online Bin Covering with Limited Migration. CoRR (2019)
Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof
Robust Online Algorithms for Certain Dynamic Packing Problems. WAOA (2019)
Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof
Robust Online Algorithms for Dynamic Problems. CoRR (2019)
Max Bannach, Sebastian Berndt
Practical Access to Dynamic Programming on Tree Decompositions. Algorithms 12 (8) (2019)
Max Bannach, Sebastian Berndt
Positive-Instance Driven Dynamic Programming for Graph Searching. WADS (2019)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online Bin Covering with Limited Migration. ESA (2019)
Max Bannach, Sebastian Berndt
Positive-Instance Driven Dynamic Programming for Graph Searching. CoRR (2019)
Max Bannach, Sebastian Berndt
Practical Access to Dynamic Programming on Tree Decompositions. CoRR (2018)
Sebastian Berndt, Maciej Liskiewicz
On the Gold Standard for Security of Universal Steganography. EUROCRYPT (1) (2018)
Max Bannach, Sebastian Berndt
Practical Access to Dynamic Programming on Tree Decompositions. ESA (2018)
Sebastian Berndt, Maciej Liskiewicz
On the Gold Standard for Security of Universal Steganography. IACR Cryptol. ePrint Arch. 2018 (2018)
Sebastian Berndt, Maciej Liskiewicz
On the Gold Standard for Security of Universal Steganography. CoRR (2018)
Sebastian Berndt, Kim-Manuel Klein
Using Structural Properties for Integer Programs. CiE (2018)
Sebastian Berndt
Computing Tree Width: From Theory to Practice and Back. CiE (2018)
Max Bannach, Sebastian Berndt, Thorsten Ehlers
Jdrasil: A Modular Library for Computing Tree Decompositions. SEA (2017)
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
Learning Residual Alternating Automata. AAAI (2017)
Sebastian Berndt, Maciej Liskiewicz
Algorithm Substitution Attacks from a Steganographic Perspective. CoRR (2017)
Sebastian Berndt, Maciej Liskiewicz
Algorithm Substitution Attacks from a Steganographic Perspective. CCS (2017)
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
Learning Residual Alternating Automata. Electron. Colloquium Comput. Complex. 24 (2017)
Sebastian Berndt, Rüdiger Reischuk
Steganography Based on Pattern Languages. LATA (2016)
Sebastian Berndt, Maciej Liskiewicz
Hard Communication Channels for Steganography. ISAAC (2016)
Sebastian Berndt, Maciej Liskiewicz
Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions. IH&MMSec (2016)
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
Fully Dynamic Bin Packing Revisited . APPROX-RANDOM (2015)
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
Fully Dynamic Bin Packing Revisited. CoRR (2014)

Sebastian Berndt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sebastian Berndt