Sebastian Berndt

79 papers A* 4A 5B 13C 5Journal 45Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
UP TO 50% OFF: Efficient Implementation of Polynomial Masking.
IACR Trans. Cryptogr. Hardw. Embed. Syst.
Jorge Andresen, Paula Arnold, Sebastian Berndt, Thomas Eisenbarth, Sebastian Faust, Marc Gourjon, Eric Landthaler, Elena Micheli, Maximilian Orlt, Pajam Pauls, Kathrin Wirschem, Liang Zhao
2025 J jnl
Dash: Accelerating Distributed Private Convolutional Neural Network Inference with Arithmetic Garbled Circuits.
IACR Trans. Cryptogr. Hardw. Embed. Syst.
Jonas Sander, Sebastian Berndt, Ida Bruhns, Thomas Eisenbarth
2025 J jnl
Efficient Weak Key Recovery for QC-MDPC Codes like BIKE.
IACR Commun. Cryptol.
Tim Gellersen, Till Eifert, Sebastian Berndt, Thomas Eisenbarth
2025 J jnl
Improving the Fault Robustness of Polynomial Masking.
IACR Cryptol. ePrint Arch.
Paula Arnold, Sebastian Berndt, Thomas Eisenbarth, Sebastian Faust, Marc Gourjon, Elena Micheli, Maximilian Orlt, Pajam Pauls, Kathrin Wirschem, Liang Zhao
2025 J jnl
Lightweight Unified Sha-3/Shake Architecture with a Fault-Resilient State.
CoRR
Christian Ewert, Amrit Sharma Poudel, Mouadh Ayache, Andrija Neskovic, Rainer Buchty, Mladen Berekovic, Sebastian Berndt, Saleh Mulhem
2025 J jnl
Non-omniscient backdoor injection with a single poison sample: Proving the one-poison hypothesis for linear regression and linear classification.
CoRR
Thorsten Peinemann, Paula Arnold, Sebastian Berndt, Thomas Eisenbarth, Esfandiar Mohammadi
2025 — conf
Protection Against Subversion Corruptions via Reverse Firewalls in the Plain Universal Composability Framework.
ACNS (2)
Paula Arnold, Sebastian Berndt, Jörn Müller-Quade, Astrid Ottenhues
2025 J jnl
UP TO 50% OFF: Efficient Implementation of Polynomial Masking.
IACR Cryptol. ePrint Arch.
Jorge Andresen, Paula Arnold, Sebastian Berndt, Thomas Eisenbarth, Sebastian Faust, Marc Gourjon, Eric Landthaler, Elena Micheli, Maximilian Orlt, Pajam Pauls, Kathrin Wirschem, Liang Zhao
2024 B conf
New Support Size Bounds and Proximity Bounds for Integer Linear Programming.
SOFSEM
Sebastian Berndt, Matthias Mnich, Tobias Stamm
2024 J jnl
Polynomial sharings on two secrets: Buy one, get one free.
IACR Cryptol. ePrint Arch.
Paula Arnold, Sebastian Berndt, Thomas Eisenbarth, Maximilian Orlt
2024 J jnl
Polynomial sharings on two secrets: Buy one, get one free.
IACR Trans. Cryptogr. Hardw. Embed. Syst.
Paula Arnold, Sebastian Berndt, Thomas Eisenbarth, Maximilian Orlt
2024 J jnl
Slalom at the Carnival: Privacy-preserving Inference with Masks from Public Knowledge.
IACR Commun. Cryptol.
Ida Bruhns, Sebastian Berndt, Jonas Sander, Thomas Eisenbarth
2024 — conf
Subversion-Resilient Signatures Without Random Oracles.
ACNS (1)
Pascal Bemmann, Sebastian Berndt, Rongmao Chen
2024 J jnl
TeeJam: Sub-Cache-Line Leakages Strike Back.
IACR Trans. Cryptogr. Hardw. Embed. Syst.
Florian Sieck, Zhiyuan Zhang, Sebastian Berndt, Chitchanok Chuengsatiansup, Thomas Eisenbarth, Yuval Yarom
2023 A conf
"Act natural!": Exchanging Private Messages on Public Blockchains.
EuroS&P
Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz
2023 — conf
Combined Fault and Leakage Resilience: Composability, Constructions and Compiler.
CRYPTO (3)
Sebastian Berndt, Thomas Eisenbarth, Sebastian Faust, Marc Gourjon, Maximilian Orlt, Okan Seker
2023 J jnl
Combined Fault and Leakage Resilience: Composability, Constructions and Compiler.
IACR Cryptol. ePrint Arch.
Sebastian Berndt, Thomas Eisenbarth, Sebastian Faust, Marc Gourjon, Maximilian Orlt, Okan Seker
2023 J jnl
DASH: Accelerating Distributed Private Machine Learning Inference with Arithmetic Garbled Circuits.
CoRR
Jonas Sander, Sebastian Berndt, Ida Bruhns, Thomas Eisenbarth
2023 B conf
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines.
ISAAC
Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm
2023 J jnl
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines.
CoRR
Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm
2023 J jnl
Online bin covering with limited migration.
J. Comput. Syst. Sci.
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2023 B conf
PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth.
IPEC
Max Bannach, Sebastian Berndt
2023 J jnl
Protection Against Subversion Corruptions via Reverse Firewalls in the plain Universal Composability Framework.
IACR Cryptol. ePrint Arch.
Paula Arnold, Sebastian Berndt, Jörn Müller-Quade, Astrid Ottenhues
2023 B conf
Subversion-Resilient Authenticated Encryption Without Random Oracles.
ACNS
Pascal Bemmann, Sebastian Berndt, Denis Diemert, Thomas Eisenbarth, Tibor Jager
2023 J jnl
Subversion-Resilient Authenticated Encryption without Random Oracles.
IACR Cryptol. ePrint Arch.
Pascal Bemmann, Sebastian Berndt, Denis Diemert, Thomas Eisenbarth, Tibor Jager
2023 J jnl
Subversion-Resilient Signatures without Random Oracles.
IACR Cryptol. ePrint Arch.
Pascal Bemmann, Sebastian Berndt, Rongmao Chen
2022 A conf
ASAP: Algorithm Substitution Attacks on Cryptographic Protocols.
AsiaCCS
Sebastian Berndt, Jan Wichelmann, Claudius Pott, Tim-Henrik Traving, Thomas Eisenbarth
2022 J jnl
Learning residual alternating automata.
Inf. Comput.
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2022 A conf
Load Balancing: The Long Road from Theory to Practice.
ALENEX
Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder
2022 J jnl
Online load balancing with general reassignment cost.
Oper. Res. Lett.
Sebastian Berndt, Franziska Eberle, Nicole Megow
2022 J jnl
Recent Advances in Positive-Instance Driven Graph Searching.
Algorithms
Max Bannach, Sebastian Berndt
2021 J jnl
"Act natural!": Having a Private Chat on a Public Blockchain.
IACR Cryptol. ePrint Arch.
Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz
2021 B conf
Help, My Signal has Bad Device! - Breaking the Signal Messenger's Post-Compromise Security Through a Malicious Device.
DIMVA
Jan Wichelmann, Sebastian Berndt, Claudius Pott, Thomas Eisenbarth
2021 J jnl
Help, my Signal has bad Device! Breaking the Signal Messenger's Post-CompromiseSecurity through a Malicious Device.
IACR Cryptol. ePrint Arch.
Jan Wichelmann, Sebastian Berndt, Claudius Pott, Thomas Eisenbarth
2021 J jnl
Load Balancing: The Long Road from Theory to Practice.
CoRR
Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder
2021 — conf
New Bounds for the Vertices of the Integer Hull.
SOSA
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
2021 C conf
Robust Online Algorithms for Dynamic Choosing Problems.
CiE
Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche
2021 J jnl
Robust Online Algorithms for Dynamic Choosing Problems.
CoRR
Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche
2021 J jnl
Side-Channel Protections for Picnic Signatures.
IACR Cryptol. ePrint Arch.
Diego F. Aranha, Sebastian Berndt, Thomas Eisenbarth, Okan Seker, Akira Takahashi, Luca Wilke, Greg Zaverucha
2021 J jnl
Side-Channel Protections for Picnic Signatures.
IACR Trans. Cryptogr. Hardw. Embed. Syst.
Diego F. Aranha, Sebastian Berndt, Thomas Eisenbarth, Okan Seker, Akira Takahashi, Luca Wilke, Greg Zaverucha
2021 B conf
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs.
SOFSEM
Sebastian Berndt, Klaus Jansen, Alexandra Lassota
2021 A* conf
Util: : Lookup: Exploiting Key Decoding in Cryptographic Libraries.
CCS
Florian Sieck, Sebastian Berndt, Jan Wichelmann, Thomas Eisenbarth
2021 J jnl
Util: : Lookup: Exploiting key decoding in cryptographic libraries.
CoRR
Florian Sieck, Sebastian Berndt, Jan Wichelmann, Thomas Eisenbarth
2020 J jnl
ASAP: Algorithm Substitution Attacks on Cryptographic Protocols.
IACR Cryptol. ePrint Arch.
Sebastian Berndt, Jan Wichelmann, Claudius Pott, Tim-Henrik Traving, Thomas Eisenbarth
2020 J jnl
Fully dynamic bin packing revisited.
Math. Program.
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
2020 J jnl
New Bounds for the Vertices of the Integer Hull.
CoRR
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
2020 J jnl
On the universal steganography of optimal rate.
Inf. Comput.
Sebastian Berndt, Maciej Liskiewicz
2020 B conf
PACE Solver Description: Fluid.
IPEC
Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst
2020 B conf
PACE Solver Description: PID^⋆.
IPEC
Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst
2020 A* conf
SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis.
CCS
Okan Seker, Sebastian Berndt, Luca Wilke, Thomas Eisenbarth
2020 J jnl
SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis.
IACR Cryptol. ePrint Arch.
Okan Seker, Sebastian Berndt, Thomas Eisenbarth
2020 B conf
Solving Packing Problems with Few Small Items Using Rainbow Matchings.
MFCS
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
2020 J jnl
Solving Packing Problems with Few Small Items Using Rainbow Matchings.
CoRR
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
2020 J jnl
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs.
CoRR
Sebastian Berndt, Klaus Jansen, Alexandra Lassota
2019 — —
New results on feasibilities and limitations of provable secure steganography.
Sebastian Berndt
2019 A conf
Online Bin Covering with Limited Migration.
ESA
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2019 J jnl
Online Bin Covering with Limited Migration.
CoRR
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2019 B conf
Positive-Instance Driven Dynamic Programming for Graph Searching.
WADS
Max Bannach, Sebastian Berndt
2019 J jnl
Positive-Instance Driven Dynamic Programming for Graph Searching.
CoRR
Max Bannach, Sebastian Berndt
2019 J jnl
Practical Access to Dynamic Programming on Tree Decompositions.
Algorithms
Max Bannach, Sebastian Berndt
2019 B conf
Robust Online Algorithms for Certain Dynamic Packing Problems.
WAOA
Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof
2019 J jnl
Robust Online Algorithms for Dynamic Problems.
CoRR
Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof
2018 C conf
Computing Tree Width: From Theory to Practice and Back.
CiE
Sebastian Berndt
2018 — conf
On the Gold Standard for Security of Universal Steganography.
EUROCRYPT (1)
Sebastian Berndt, Maciej Liskiewicz
2018 J jnl
On the Gold Standard for Security of Universal Steganography.
CoRR
Sebastian Berndt, Maciej Liskiewicz
2018 J jnl
On the Gold Standard for Security of Universal Steganography.
IACR Cryptol. ePrint Arch.
Sebastian Berndt, Maciej Liskiewicz
2018 A conf
Practical Access to Dynamic Programming on Tree Decompositions.
ESA
Max Bannach, Sebastian Berndt
2018 J jnl
Practical Access to Dynamic Programming on Tree Decompositions.
CoRR
Max Bannach, Sebastian Berndt
2018 C conf
Using Structural Properties for Integer Programs.
CiE
Sebastian Berndt, Kim-Manuel Klein
2017 A* conf
Algorithm Substitution Attacks from a Steganographic Perspective.
CCS
Sebastian Berndt, Maciej Liskiewicz
2017 J jnl
Algorithm Substitution Attacks from a Steganographic Perspective.
CoRR
Sebastian Berndt, Maciej Liskiewicz
2017 B conf
Jdrasil: A Modular Library for Computing Tree Decompositions.
SEA
Max Bannach, Sebastian Berndt, Thorsten Ehlers
2017 A* conf
Learning Residual Alternating Automata.
AAAI
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2017 J jnl
Learning Residual Alternating Automata.
Electron. Colloquium Comput. Complex.
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2016 B conf
Hard Communication Channels for Steganography.
ISAAC
Sebastian Berndt, Maciej Liskiewicz
2016 C conf
Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions.
IH&MMSec
Sebastian Berndt, Maciej Liskiewicz
2016 C conf
Steganography Based on Pattern Languages.
LATA
Sebastian Berndt, Rüdiger Reischuk
2015 — conf
Fully Dynamic Bin Packing Revisited .
APPROX-RANDOM
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
2014 J jnl
Fully Dynamic Bin Packing Revisited.
CoRR
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein