default search action
Sebastian Berndt 0001
Person information
- affiliation: University of Lübeck, Lübeck, Germany
Other persons with the same name
- Sebastian Berndt 0002 — Alexion Pharma, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j12]Jonas Sander, Sebastian Berndt, Ida Bruhns, Thomas Eisenbarth:
Dash: Accelerating Distributed Private Convolutional Neural Network Inference with Arithmetic Garbled Circuits. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2025(1): 420-449 (2025) - 2024
- [j11]Ida Bruhns
, Sebastian Berndt
Slalom at the Carnival: Privacy-preserving Inference with Masks from Public Knowledge. IACR Commun. Cryptol. 1(3): 40 (2024) - [j10]Florian Sieck, Zhiyuan Zhang, Sebastian Berndt, Chitchanok Chuengsatiansup, Thomas Eisenbarth
TeeJam: Sub-Cache-Line Leakages Strike Back. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(1): 457-500 (2024) - [j9]Paula Arnold, Sebastian Berndt, Thomas Eisenbarth
Polynomial sharings on two secrets: Buy one, get one free. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(3): 671-706 (2024) - [c32]Pascal Bemmann, Sebastian Berndt, Rongmao Chen:
Subversion-Resilient Signatures Without Random Oracles. ACNS (1) 2024: 351-375 - [c31]Sebastian Berndt
New Support Size Bounds and Proximity Bounds for Integer Linear Programming. SOFSEM 2024: 82-95 - [i27]Paula Arnold, Sebastian Berndt, Thomas Eisenbarth, Maximilian Orlt:
Polynomial sharings on two secrets: Buy one, get one free. IACR Cryptol. ePrint Arch. 2024: 1025 (2024) - 2023
- [j8]Sebastian Berndt, Leah Epstein
Online bin covering with limited migration. J. Comput. Syst. Sci. 134: 42-72 (2023) - [c30]Pascal Bemmann, Sebastian Berndt, Denis Diemert, Thomas Eisenbarth
Subversion-Resilient Authenticated Encryption Without Random Oracles. ACNS 2023: 460-483 - [c29]Sebastian Berndt, Thomas Eisenbarth
Combined Fault and Leakage Resilience: Composability, Constructions and Compiler. CRYPTO (3) 2023: 377-409 - [c28]Thore Tiemann
"Act natural!": Exchanging Private Messages on Public Blockchains. EuroS&P 2023: 292-308 - [c27]Sebastian Berndt, Hauke Brinkop
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. ISAAC 2023: 13:1-13:18 - [c26]Max Bannach, Sebastian Berndt:
PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth. IPEC 2023: 35:1-35:14 - [i26]Jonas Sander, Sebastian Berndt, Ida Bruhns, Thomas Eisenbarth:
DASH: Accelerating Distributed Private Machine Learning Inference with Arithmetic Garbled Circuits. CoRR abs/2302.06361 (2023) - [i25]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 abs/2305.08432 (2023) - [i24]Pascal Bemmann, Sebastian Berndt, Denis Diemert, Thomas Eisenbarth, Tibor Jager:
Subversion-Resilient Authenticated Encryption without Random Oracles. IACR Cryptol. ePrint Arch. 2023: 764 (2023) - [i23]Sebastian Berndt, Thomas Eisenbarth, Sebastian Faust, Marc Gourjon, Maximilian Orlt, Okan Seker:
Combined Fault and Leakage Resilience: Composability, Constructions and Compiler. IACR Cryptol. ePrint Arch. 2023: 1143 (2023) - [i22]Pascal Bemmann, Sebastian Berndt, Rongmao Chen:
Subversion-Resilient Signatures without Random Oracles. IACR Cryptol. ePrint Arch. 2023: 1491 (2023) - [i21]Paula Arnold, Sebastian Berndt, Jörn Müller-Quade, Astrid Ottenhues:
Protection Against Subversion Corruptions via Reverse Firewalls in the plain Universal Composability Framework. IACR Cryptol. ePrint Arch. 2023: 1951 (2023) - 2022
- [j7]Max Bannach
Recent Advances in Positive-Instance Driven Graph Searching. Algorithms 15(2): 42 (2022) - [j6]Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Learning residual alternating automata. Inf. Comput. 289(Part): 104981 (2022) - [j5]Sebastian Berndt
Online load balancing with general reassignment cost. Oper. Res. Lett. 50(3): 322-328 (2022) - [c25]Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
Load Balancing: The Long Road from Theory to Practice. ALENEX 2022: 104-116 - [c24]Sebastian Berndt, Jan Wichelmann, Claudius Pott, Tim-Henrik Traving, Thomas Eisenbarth
ASAP: Algorithm Substitution Attacks on Cryptographic Protocols. AsiaCCS 2022: 712-726 - 2021
- [j4]Diego F. Aranha
Side-Channel Protections for Picnic Signatures. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(4): 239-282 (2021) - [c23]Florian Sieck
Util: : Lookup: Exploiting Key Decoding in Cryptographic Libraries. CCS 2021: 2456-2473 - [c22]Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche:
Robust Online Algorithms for Dynamic Choosing Problems. CiE 2021: 38-49 - [c21]Jan Wichelmann
Help, My Signal has Bad Device! - Breaking the Signal Messenger's Post-Compromise Security Through a Malicious Device. DIMVA 2021: 88-105 - [c20]Sebastian Berndt
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. SOFSEM 2021: 349-360 - [c19]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
New Bounds for the Vertices of the Integer Hull. SOSA 2021: 25-36 - [i20]Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche:
Robust Online Algorithms for Dynamic Choosing Problems. CoRR abs/2104.09803 (2021) - [i19]Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
Load Balancing: The Long Road from Theory to Practice. CoRR abs/2107.13638 (2021) - [i18]Florian Sieck, Sebastian Berndt, Jan Wichelmann, Thomas Eisenbarth:
Util: : Lookup: Exploiting key decoding in cryptographic libraries. CoRR abs/2108.04600 (2021) - [i17]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: 626 (2021) - [i16]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: 735 (2021) - [i15]Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz:
"Act natural!": Having a Private Chat on a Public Blockchain. IACR Cryptol. ePrint Arch. 2021: 1073 (2021) - 2020
- [j3]Sebastian Berndt, Maciej Liskiewicz:
On the universal steganography of optimal rate. Inf. Comput. 275: 104632 (2020) - [j2]Sebastian Berndt
Fully dynamic bin packing revisited. Math. Program. 179(1): 109-155 (2020) - [c18]Okan Seker, Sebastian Berndt, Luca Wilke
SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis. CCS 2020: 1033-1049 - [c17]Max Bannach
PACE Solver Description: Fluid. IPEC 2020: 27:1-27:3 - [c16]Max Bannach
PACE Solver Description: PID^⋆. IPEC 2020: 28:1-28:4 - [c15]Max Bannach
Solving Packing Problems with Few Small Items Using Rainbow Matchings. MFCS 2020: 11:1-11:14 - [i14]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
New Bounds for the Vertices of the Integer Hull. CoRR abs/2006.10847 (2020) - [i13]Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich
Solving Packing Problems with Few Small Items Using Rainbow Matchings. CoRR abs/2007.02660 (2020) - [i12]Sebastian Berndt, Klaus Jansen, Alexandra Lassota:
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. CoRR abs/2010.09255 (2020) - [i11]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: 544 (2020) - [i10]Sebastian Berndt, Jan Wichelmann, Claudius Pott, Tim-Henrik Traving, Thomas Eisenbarth:
ASAP: Algorithm Substitution Attacks on Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2020: 1452 (2020)
2010 – 2019
- 2019
- [b1]Sebastian Berndt:
New results on feasibilities and limitations of provable secure steganography. University of Lübeck, Germany, 2019 - [j1]Max Bannach
Practical Access to Dynamic Programming on Tree Decompositions. Algorithms 12(8): 172 (2019) - [c14]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin
Online Bin Covering with Limited Migration. ESA 2019: 18:1-18:14 - [c13]Max Bannach
Positive-Instance Driven Dynamic Programming for Graph Searching. WADS 2019: 43-56 - [c12]Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof:
Robust Online Algorithms for Certain Dynamic Packing Problems. WAOA 2019: 43-59 - [i9]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. CoRR abs/1904.06543 (2019) - [i8]Max Bannach, Sebastian Berndt:
Positive-Instance Driven Dynamic Programming for Graph Searching. CoRR abs/1905.01134 (2019) - [i7]Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof:
Robust Online Algorithms for Dynamic Problems. CoRR abs/1905.07986 (2019) - 2018
- [c11]Sebastian Berndt:
Computing Tree Width: From Theory to Practice and Back. CiE 2018: 81-88 - [c10]Sebastian Berndt, Kim-Manuel Klein:
Using Structural Properties for Integer Programs. CiE 2018: 89-96 - [c9]Max Bannach, Sebastian Berndt:
Practical Access to Dynamic Programming on Tree Decompositions. ESA 2018: 6:1-6:13 - [c8]Sebastian Berndt, Maciej Liskiewicz:
On the Gold Standard for Security of Universal Steganography. EUROCRYPT (1) 2018: 29-60 - [i6]Sebastian Berndt, Maciej Liskiewicz:
On the Gold Standard for Security of Universal Steganography. CoRR abs/1801.08154 (2018) - [i5]Max Bannach, Sebastian Berndt:
Practical Access to Dynamic Programming on Tree Decompositions. CoRR abs/1806.10176 (2018) - [i4]Sebastian Berndt, Maciej Liskiewicz:
On the Gold Standard for Security of Universal Steganography. IACR Cryptol. ePrint Arch. 2018: 106 (2018) - 2017
- [c7]Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Learning Residual Alternating Automata. AAAI 2017: 1749-1755 - [c6]Sebastian Berndt, Maciej Liskiewicz:
Algorithm Substitution Attacks from a Steganographic Perspective. CCS 2017: 1649-1660 - [c5]Max Bannach, Sebastian Berndt, Thorsten Ehlers:
Jdrasil: A Modular Library for Computing Tree Decompositions. SEA 2017: 28:1-28:21 - [i3]Sebastian Berndt, Maciej Liskiewicz:
Algorithm Substitution Attacks from a Steganographic Perspective. CoRR abs/1708.06199 (2017) - [i2]Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Learning Residual Alternating Automata. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c4]Sebastian Berndt, Maciej Liskiewicz:
Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions. IH&MMSec 2016: 81-92 - [c3]Sebastian Berndt, Maciej Liskiewicz:
Hard Communication Channels for Steganography. ISAAC 2016: 16:1-16:13 - [c2]Sebastian Berndt, Rüdiger Reischuk:
Steganography Based on Pattern Languages. LATA 2016: 387-399 - 2015
- [c1]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
Fully Dynamic Bin Packing Revisited . APPROX-RANDOM 2015: 135-151 - 2014
- [i1]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
Fully Dynamic Bin Packing Revisited. CoRR abs/1411.0960 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: