50 years Univerity of Lübeck

Dr. rer. nat. Sebastian Berndt

Research


Research Interests

Publications

2024

  • Pascal Bemmann, Sebastian Berndt, Rongmao Chen:
    Subversion-Resilient Signatures without Random Oracles.
    In Conference on Applied Cryptography and Network Security (ACNS 2024), , 2024.
  • Florian Sieck, Zhiyuan Zhang, Sebastian Berndt, Chitchanok Chuengsatiansup, Thomas Eisenbarth, Yuval Yarom:
    TeeJam: Sub Cache Line Leakages Strike Back.
    In IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES '24), , 2024.

2023

  • Pascal Bemmann, Sebastian Berndt, Denis Diemert, Tibor Jager:
    Subversion-Resilient Authenticated Encryption without Random Oracles.
    In Applied Cryptography and Network Security, ACNS 2023, Communications in Computer and Information Science, , 2023.
  • Sebastian Berndt, Thomas Eisenbarth, Sebastian Faust, Marc Gourjon, Maximilian Orlt, Okan Seker:
    Combined Fault and Leakage Resilience: Composability, Constructions and Compiler.
    In Advances in Cryptology - CRYPTO 2023, Springer, 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.
    In The 34th International Symposium on Algorithms and Computation (ISAAC 2023), , 2023.
  • Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
    Online Bin Covering with Limited Migration.
    J. Comput. Syst. Sci., 2023.
  • Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz:
    "Act natural!": Having a Private Chat on a Public Blockchain.
    In 8th IEEE European Symposium on Security and Privacy (EuroS&P '23), IEEE, 2023.

2022

  • Max Bannach, Sebastian Berndt:
    Recent Advances in Positive-Instance Driven Graph Searching.
    Algorithms, 15(2):42, 2022.
    Go to website | Show abstract
  • Sebastian Berndt, Jan Wichelmann, Claudius Pott, Tim-Henrik Tracking, Thomas Eisenbarth:
    ASAP: Algorithm Substitution Attacks on Cryptographic Protocols.
    In Proceedings ASIACCS, ACM, 2022.
  • Sebastian Berndt, Maciej Liskiewic, Matthias Lutter, Rüdiger Reischuk:
    Learning residual alternating automata.
    Inf. Comput., 289(Part):861-878, 2022.
  • Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Learning residual alternating automata.
    Information and Computation, (289):104981, 2022.
    Go to website
  • Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
    Load Balancing: The Long Road from Theory to Practice..
    In Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, pp. 104-116. SIAM, 2022.
    Go to website
  • Sebastian Berndt, Franziska Eberle, Nicole Megow:
    Online load balancing with general reassignment cost.
    Operations Research Letters, 50(3):322-328, 2022.

2020

  • Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst:
    PACE Solver Description: PID*.
    In Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), LIPIcs, 2020.
    Go to website | Show abstract
  • Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst:
    PACE Solver Description: Fluid.
    In Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), LIPIcs, 2020.
    Go to website | Show abstract
  • Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath:
    Solving Packing Problems with Few Small Items Using Rainbow Matchings.
    In Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), LIPIcs, 2020.
    Go to website | Go to website | Show abstract
  • Sebastian Berndt, Maciej Liskiewicz:
    On the universal steganography of optimal rate.
    Information and Computation, 104632(Available online 14 October 2020)2020.
    Go to website

2019

  • Max Bannach, Sebastian Berndt:
    Positive-Instance Driven Dynamic Programming for Graph Searching.
    In Proceedings of the 16th Algorithms and Data Structures Symposium (WADS 2019), Springer, 2019.
    Show PDF | Show abstract
  • Max Bannach, Sebastian Berndt:
    Practical Access to Dynamic Programming on Tree Decompositions.
    MDPI Algorithms, 2019. Special Issue: New Frontiers in Parameterized Complexity and Algorithms
    Go to website | Show abstract

2018

  • Max Bannach, Sebastian Berndt:
    Practical Access to Dynamic Programming on Tree Decompositions.
    In Proceedings of the 26th Annual European Symposium on Algorithms, LIPIcs, 2018.
    Go to website | Show PDF | Show abstract
  • Max Bannach, Sebastian Berndt, Thorsten Ehlers, Dirk Nowotka:
    SAT-Encodings of Tree Decompositions.
    In Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions, , 2018.
    Go to website | Show abstract
  • Sebastian Berndt, Maciej Liskiewicz:
    On the Gold Standard for Security of Universal Steganography.
    In Proc. Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Volume vol. 10820 of LNCS, pp. 29-60. Springer, 2018.
    Go to website | Show abstract
  • Sebastian Berndt, Maciej Liskiewicz:
    On the Gold Standard for Security of Universal Steganography.
    Technical report 106, IACR Cryptology ePrint Archive, 2018.
    Go to website

2017

  • Max Bannach, Sebastian Berndt, Thorsten Ehlers:
    Jdrasil: A Modular Library for Computing Tree Decompositions.
    In International Symposium on Experimental Algorithms (SEA 2017), Volume 75 of LIPIcs, pp. 28:1--28:21. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
    Go to website | Show PDF | Show abstract
  • Sebastian Berndt, Maciej Liskiewicz:
    Algorithm Substitution Attacks from a Steganographic Perspective.
    In Proc. 24th ACM Conference on Computer and Communications Security (CCS 2017), pp. 1649-1660. ACM Press, 2017.
    Go to website | Show abstract
  • Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Learning Residual Alternating Automata.
    Electronic Colloquium on Computational Complexity (ECCC), 24(46)2017.
    Go to website | Show abstract
  • Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Learning Residual Alternating Automata.
    Proc. 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 1749-1755. AAAI Press, 2017.
    Go to website | Show abstract

2016

  • Sebastian Berndt, Maciej Liskiewicz:
    Hard Communication Channels for Steganography.
    In The 27th International Symposium on Algorithms and Computation (ISAAC 2016), ISBN 978-3-95977-026-2, LIPICS Vol. 64, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2016.
    Go to website | Show abstract
  • Sebastian Berndt, Maciej Liskiewicz:
    Provable Secure Universal Steganography of Optimal Rate.
    In Proceedings of the 4rd ACM Workshop on Information Hiding and Multimedia Security, IH&MMSec 2016, Vigo, Spain, June 20 - 22, 2016, pp. 387-394. ACM (Awarded Best Student Paper), 2016.
    Go to website | Show abstract
  • Sebastian Berndt, Rüdiger Reischuk:
    Steganography Based on Pattern Languages.
    In Language and Automata Theory and Applications, 10th International Conference LATA 2016 Prague, Czech Republic, March 14-18, 2016, Volume Volume 9618 of Lecture Notes in Computer Science (LNCS), pp. 387-399. Springer, 2016.
    Go to website | Show abstract

2015

  • Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
    Fully Dynamic Bin Packing Revisited.
    In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015), Volume 40 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 135-151. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2015.
    Go to website | Show abstract

2014

  • Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
    Fully Dynamic Bin Packing Revisited.
    Technical report arXiv:1411.0960, arXiv, 2014.
    Go to website | Show abstract

Talks

2016

2015