Sebastian Berndt

According to our database, Sebastian Berndt authored at least 44 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

TeeJam: Sub-Cache-Line Leakages Strike Back.

Florian Sieck, Zhiyuan Zhang, Sebastian Berndt, Chitchanok Chuengsatiansup, Thomas Eisenbarth, Yuval Yarom

IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024

New Support Size Bounds and Proximity Bounds for Integer Linear Programming.

Sebastian Berndt, Matthias Mnich, Tobias Stamm

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

Online bin covering with limited migration.

Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder

J. Comput. Syst. Sci., June, 2023

Subversion-Resilient Authenticated Encryption without Random Oracles.

Pascal Bemmann, Sebastian Berndt, Denis Diemert, Thomas Eisenbarth, Tibor Jager

IACR Cryptol. ePrint Arch., 2023

Subversion-Resilient Signatures without Random Oracles.

Pascal Bemmann, Sebastian Berndt, Rongmao Chen

IACR Cryptol. ePrint Arch., 2023

Protection Against Subversion Corruptions via Reverse Firewalls in the plain Universal Composability Framework.

Paula Arnold, Sebastian Berndt, Jörn Müller-Quade, Astrid Ottenhues

IACR Cryptol. ePrint Arch., 2023

Combined Fault and Leakage Resilience: Composability, Constructions and Compiler.

Sebastian Berndt, Thomas Eisenbarth, Sebastian Faust, Marc Gourjon, Maximilian Orlt, Okan Seker

IACR Cryptol. ePrint Arch., 2023

DASH: Accelerating Distributed Private Machine Learning Inference with Arithmetic Garbled Circuits.

Jonas Sander, Sebastian Berndt, Ida Bruhns, Thomas Eisenbarth

CoRR, 2023

PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth.

Max Bannach, Sebastian Berndt

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines.

Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

"Act natural!": Exchanging Private Messages on Public Blockchains.

Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz

Proceedings of the 8th IEEE European Symposium on Security and Privacy, 2023

2022

Online load balancing with general reassignment cost.

Sebastian Berndt, Franziska Eberle, Nicole Megow

Oper. Res. Lett., 2022

Recent Advances in Positive-Instance Driven Graph Searching.

Max Bannach, Sebastian Berndt

Algorithms, 2022

Load Balancing: The Long Road from Theory to Practice.

Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Side-Channel Protections for Picnic Signatures.

Diego F. Aranha, Sebastian Berndt, Thomas Eisenbarth, Okan Seker, Akira Takahashi, Luca Wilke, Greg Zaverucha

IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021

Help, my Signal has bad Device! Breaking the Signal Messenger's Post-CompromiseSecurity through a Malicious Device.

Jan Wichelmann, Sebastian Berndt, Claudius Pott, Thomas Eisenbarth

IACR Cryptol. ePrint Arch., 2021

"Act natural!": Having a Private Chat on a Public Blockchain.

Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz

IACR Cryptol. ePrint Arch., 2021

New Bounds for the Vertices of the Integer Hull.

Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs.

Sebastian Berndt, Klaus Jansen, Alexandra Lassota

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Help, My Signal has Bad Device! - Breaking the Signal Messenger's Post-Compromise Security Through a Malicious Device.

Jan Wichelmann, Sebastian Berndt, Claudius Pott, Thomas Eisenbarth

Proceedings of the Detection of Intrusions and Malware, and Vulnerability Assessment, 2021

Robust Online Algorithms for Dynamic Choosing Problems.

Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche

Proceedings of the Connecting with Computability, 2021

Util: : Lookup: Exploiting Key Decoding in Cryptographic Libraries.

Florian Sieck, Sebastian Berndt, Jan Wichelmann, Thomas Eisenbarth

Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020

Fully dynamic bin packing revisited.

Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein

Math. Program., 2020

On the universal steganography of optimal rate.

Sebastian Berndt, Maciej Liskiewicz

Inf. Comput., 2020

SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis.

Okan Seker, Sebastian Berndt, Thomas Eisenbarth

IACR Cryptol. ePrint Arch., 2020

ASAP: Algorithm Substitution Attacks on Cryptographic Protocols.

Sebastian Berndt, Jan Wichelmann, Claudius Pott, Tim-Henrik Traving, Thomas Eisenbarth

IACR Cryptol. ePrint Arch., 2020

Solving Packing Problems with Few Small Items Using Rainbow Matchings.

Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

PACE Solver Description: PID^⋆.

Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

PACE Solver Description: Fluid.

Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis.

Okan Seker, Sebastian Berndt, Luca Wilke, Thomas Eisenbarth

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019

New results on feasibilities and limitations of provable secure steganography.

Sebastian Berndt

PhD thesis, 2019

Robust Online Algorithms for Dynamic Problems.

Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof

CoRR, 2019

Practical Access to Dynamic Programming on Tree Decompositions.

Max Bannach, Sebastian Berndt

Algorithms, 2019

Robust Online Algorithms for Certain Dynamic Packing Problems.

Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

Positive-Instance Driven Dynamic Programming for Graph Searching.

Max Bannach, Sebastian Berndt

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018

On the Gold Standard for Security of Universal Steganography.

Sebastian Berndt, Maciej Liskiewicz

IACR Cryptol. ePrint Arch., 2018

Using Structural Properties for Integer Programs.

Sebastian Berndt, Kim-Manuel Klein

Proceedings of the Sailing Routes in the World of Computation, 2018

Computing Tree Width: From Theory to Practice and Back.

Sebastian Berndt

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

Learning Residual Alternating Automata.

Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk

Electron. Colloquium Comput. Complex., 2017

Jdrasil: A Modular Library for Computing Tree Decompositions.

Max Bannach, Sebastian Berndt, Thorsten Ehlers

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Algorithm Substitution Attacks from a Steganographic Perspective.

Sebastian Berndt, Maciej Liskiewicz

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016

Steganography Based on Pattern Languages.

Sebastian Berndt, Rüdiger Reischuk

Proceedings of the Language and Automata Theory and Applications, 2016

Hard Communication Channels for Steganography.

Sebastian Berndt, Maciej Liskiewicz

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions.

Sebastian Berndt, Maciej Liskiewicz

Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security, 2016