Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions. - Sebastian Berndt 001; Maciej Liskiewicz (IH&MMSec, 2016)

Hard Communication Channels for Steganography. - Sebastian Berndt 001; Maciej Liskiewicz (ISAAC, 2016)

Steganography Based on Pattern Languages. - Sebastian Berndt 001; Rüdiger Reischuk (LATA, 2016)

Algorithm Substitution Attacks from a Steganographic Perspective. - Sebastian Berndt 001; Maciej Liskiewicz (CCS, 2017)

Jdrasil: A Modular Library for Computing Tree Decompositions. - Max Bannach; Sebastian Berndt 001; Thorsten Ehlers (SEA, 2017)

Learning Residual Alternating Automata. - Sebastian Berndt 001; Maciej Liskiewicz; Matthias Lutter; Rüdiger Reischuk (Electron. Colloquium Comput. Complex., 2017)

Computing Tree Width: From Theory to Practice and Back. - Sebastian Berndt 001 (CiE, 2018)

Using Structural Properties for Integer Programs. - Sebastian Berndt 001; Kim-Manuel Klein (CiE, 2018)

On the Gold Standard for Security of Universal Steganography. - Sebastian Berndt 001; Maciej Liskiewicz (IACR Cryptol. ePrint Arch., 2018)

Positive-Instance Driven Dynamic Programming for Graph Searching. - Max Bannach; Sebastian Berndt 001 (WADS, 2019)

Robust Online Algorithms for Certain Dynamic Packing Problems. - Sebastian Berndt 001; Valentin Dreismann; Kilian Grage; Klaus Jansen; Ingmar Knof (WAOA, 2019)

Practical Access to Dynamic Programming on Tree Decompositions. - Max Bannach; Sebastian Berndt 001 (Algorithms, 2019)

Robust Online Algorithms for Dynamic Problems. - Sebastian Berndt 001; Valentin Dreismann; Kilian Grage; Klaus Jansen; Ingmar Knof (CoRR, 2019)

New results on feasibilities and limitations of provable secure steganography. - Sebastian Berndt 001 (2019)

SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis. - Okan Seker; Sebastian Berndt 001; Luca Wilke; Thomas Eisenbarth 001 (CCS, 2020)

PACE Solver Description: Fluid. - Max Bannach; Sebastian Berndt 001; Martin Schuster; Marcel Wienöbst (IPEC, 2020)

PACE Solver Description: PID^⋆. - Max Bannach; Sebastian Berndt 001; Martin Schuster; Marcel Wienöbst (IPEC, 2020)

Solving Packing Problems with Few Small Items Using Rainbow Matchings. - Max Bannach; Sebastian Berndt 001; Marten Maack; Matthias Mnich; Alexandra Lassota; Malin Rau; Malte Skambath (MFCS, 2020)

ASAP: Algorithm Substitution Attacks on Cryptographic Protocols. - Sebastian Berndt 001; Jan Wichelmann; Claudius Pott; Tim-Henrik Traving; Thomas Eisenbarth 001 (IACR Cryptol. ePrint Arch., 2020)

SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis. - Okan Seker; Sebastian Berndt 001; Thomas Eisenbarth 001 (IACR Cryptol. ePrint Arch., 2020)

On the universal steganography of optimal rate. - Sebastian Berndt 001; Maciej Liskiewicz (Inf. Comput., 2020)

Fully dynamic bin packing revisited. - Sebastian Berndt 001; Klaus Jansen; Kim-Manuel Klein (Math. Program., 2020)

Util: : Lookup: Exploiting Key Decoding in Cryptographic Libraries. - Florian Sieck; Sebastian Berndt 001; Jan Wichelmann; Thomas Eisenbarth 001 (CCS, 2021)

Robust Online Algorithms for Dynamic Choosing Problems. - Sebastian Berndt 001; Kilian Grage; Klaus Jansen; Lukas Johannsen; Maria Kosche (CiE, 2021)

Help, My Signal has Bad Device! - Breaking the Signal Messenger's Post-Compromise Security Through a Malicious Device. - Jan Wichelmann; Sebastian Berndt 001; Claudius Pott; Thomas Eisenbarth 001 (DIMVA, 2021)

Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. - Sebastian Berndt 001; Klaus Jansen; Alexandra Lassota (SOFSEM, 2021)

New Bounds for the Vertices of the Integer Hull. - Sebastian Berndt 001; Klaus Jansen; Kim-Manuel Klein (SOSA, 2021)

"Act natural!": Having a Private Chat on a Public Blockchain. - Thore Tiemann; Sebastian Berndt 001; Thomas Eisenbarth 001; Maciej Liskiewicz (IACR Cryptol. ePrint Arch., 2021)

Help, my Signal has bad Device! Breaking the Signal Messenger's Post-CompromiseSecurity through a Malicious Device. - Jan Wichelmann; Sebastian Berndt 001; Claudius Pott; Thomas Eisenbarth 001 (IACR Cryptol. ePrint Arch., 2021)

Side-Channel Protections for Picnic Signatures. - Diego F. Aranha; Sebastian Berndt 001; Thomas Eisenbarth 001; Okan Seker; Akira Takahashi 002; Luca Wilke; Greg Zaverucha (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021)

Load Balancing: The Long Road from Theory to Practice. - Sebastian Berndt 001; Max A. Deppert; Klaus Jansen; Lars Rohwedder (ALENEX, 2022)

Recent Advances in Positive-Instance Driven Graph Searching. - Max Bannach; Sebastian Berndt 001 (Algorithms, 2022)

Online load balancing with general reassignment cost. - Sebastian Berndt 001; Franziska Eberle; Nicole Megow (Oper. Res. Lett., 2022)

"Act natural!": Exchanging Private Messages on Public Blockchains. - Thore Tiemann; Sebastian Berndt 001; Thomas Eisenbarth 001; Maciej Liskiewicz (EuroS&P, 2023)

New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. - Sebastian Berndt 001; Hauke Brinkop; Klaus Jansen; Matthias Mnich; Tobias Stamm (ISAAC, 2023)

PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth. - Max Bannach; Sebastian Berndt 001 (IPEC, 2023)

DASH: Accelerating Distributed Private Machine Learning Inference with Arithmetic Garbled Circuits. - Jonas Sander; Sebastian Berndt 001; Ida Bruhns; Thomas Eisenbarth 001 (CoRR, 2023)

Combined Fault and Leakage Resilience: Composability, Constructions and Compiler. - Sebastian Berndt 001; Thomas Eisenbarth 001; Sebastian Faust; Marc Gourjon; Maximilian Orlt; Okan Seker (IACR Cryptol. ePrint Arch., 2023)

Protection Against Subversion Corruptions via Reverse Firewalls in the plain Universal Composability Framework. - Paula Arnold; Sebastian Berndt 001; Jörn Müller-Quade; Astrid Ottenhues (IACR Cryptol. ePrint Arch., 2023)

Subversion-Resilient Signatures without Random Oracles. - Pascal Bemmann; Sebastian Berndt 001; Rongmao Chen (IACR Cryptol. ePrint Arch., 2023)

Subversion-Resilient Authenticated Encryption without Random Oracles. - Pascal Bemmann; Sebastian Berndt 001; Denis Diemert; Thomas Eisenbarth 001; Tibor Jager (IACR Cryptol. ePrint Arch., 2023)

Online bin covering with limited migration. - Sebastian Berndt 001; Leah Epstein; Klaus Jansen; Asaf Levin; Marten Maack; Lars Rohwedder (J. Comput. Syst. Sci., 2023)

New Support Size Bounds and Proximity Bounds for Integer Linear Programming. - Sebastian Berndt 001; Matthias Mnich; Tobias Stamm (SOFSEM, 2024)

Slalom at the Carnival: Privacy-preserving Inference with Masks from Public Knowledge. - Ida Bruhns; Sebastian Berndt 001; Jonas Sander; Thomas Eisenbarth 001 (IACR Commun. Cryptol., 2024)

Polynomial sharings on two secrets: Buy one, get one free. - Paula Arnold; Sebastian Berndt 001; Thomas Eisenbarth 001; Maximilian Orlt (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024)

TeeJam: Sub-Cache-Line Leakages Strike Back. - Florian Sieck; Zhiyuan Zhang 005; Sebastian Berndt 001; Chitchanok Chuengsatiansup; Thomas Eisenbarth 001; Yuval Yarom (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024)

Improving the Fault Robustness of Polynomial Masking. - Paula Arnold; Sebastian Berndt 001; Thomas Eisenbarth 001; Sebastian Faust; Marc Gourjon; Elena Micheli; Maximilian Orlt; Pajam Pauls; Kathrin Wirschem; Liang Zhao (IACR Cryptol. ePrint Arch., 2025)

Dash: Accelerating Distributed Private Convolutional Neural Network Inference with Arithmetic Garbled Circuits. - Jonas Sander; Sebastian Berndt 001; Ida Bruhns; Thomas Eisenbarth 001 (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2025)

Non-omniscient backdoor injection with a single poison sample: Proving the one-poison hypothesis for linear regression and linear classification. - Thorsten Peinemann; Paula Arnold; Sebastian Berndt 001; Thomas Eisenbarth 001; Esfandiar Mohammadi (CoRR, 2025)