This image shows Pascal Reisert

Pascal Reisert

Dr.

Postdoc
Institute of Information Security

Contact

Universitaetsstraße 38
70569 Stuttgart
Germany
Room: 2.454

Office Hours

According to prior agreement. Please contact me by e-mail or use the office hours of the corresponding lectures.

Subject

Mathematics, Cryptography, Information Security, (Physics)

  1. 2024

    1. Mayar Elfares, Pascal Reisert, Zhiming Hu, Wenwu Tang, Ralf Küsters, and Andreas Bulling, “PrivatEyes: Appearance-based Gaze Estimation Using Federated Secure Multi-Party Computation,” Proc. ACM Hum.-Comput. Interact., vol. 8, no. ETRA, May 2024.
    2. Mayar Elfares, Pascal Reisert, Zhiming Hu, Wenwu Tang, Ralf Küsters, and Andreas Bulling, “PrivatEyes: Appearance-based Gaze Estimation Using Federated Secure Multi-Party Computation,” arXiv, Technical Report 2402.18970, 2024.
    3. Sebastian Hasler, Pascal Reisert, Marc Rivinius, and Ralf Küsters, “Multipars: Reduced-Communication MPC over Z2k,” Proceedings on Privacy Enhancing Technologies, 2024. To appear.
  2. 2023

    1. Sebastian Hasler, Pascal Reisert, Marc Rivinius, and Ralf Küsters, “Multipars: Reduced-Communication MPC over Z2k,” Cryptology ePrint Archive, Technical Report 2023/1932, 2023.
    2. David Mestel, Johannes Müller, and Pascal Reisert, “How Efficient Are Replay Attacks Against Vote Privacy? A Formal Quantitative Analysis (Extended Version),” Journal of Computer Security, pp. 1--47, 2023. This paper is an extended and revised version of a paper presented at CSF’22.
    3. Marc Rivinius, Pascal Reisert, Sebastian Hasler, and Ralf Küsters, “Convolutions in Overdrive: Maliciously Secure Convolutions for MPC,” Proceedings on Privacy Enhancing Technologies, vol. 2023, no. 3, pp. 321--353, 2023. Runner-Up for the PETS 2023 Best Student Paper Award.
    4. Marc Rivinius, Pascal Reisert, Sebastian Hasler, and Ralf Küsters, “Convolutions in Overdrive: Maliciously Secure Convolutions for MPC,” Cryptology ePrint Archive, Technical Report 2023/359, 2023.
    5. Sebastian Hasler, Toomas Krips, Ralf Küsters, Pascal Reisert, and Marc Rivinius, “Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice,” Cryptology ePrint Archive, Technical Report 2023/462, 2023.
    6. Pascal Reisert, Marc Rivinius, Toomas Krips, and Ralf Küsters, “Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice,” in ACM ASIA Conference on Computer and Communications Security (ASIA CCS 2023), 2023, pp. 372–386.
  3. 2022

    1. Mayar Elfares, Zhiming Hu, Pascal Reisert, Andreas Bulling, and Ralf Küsters, “Federated Learning for Appearance-based Gaze Estimation in the Wild,” NeurIPS 2022 Workshop GMML, 2022.
    2. Mayar Elfares, Zhiming Hu, Pascal Reisert, Andreas Bulling, and Ralf Küsters, “Federated Learning for Appearance-based Gaze Estimation in the Wild,” arXiv, Technical Report 2211.07330, 2022.
    3. Nicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke, Johannes Müller, Daniel Rausch, Pascal Reisert, and Andreas Vogt, “Kryvos: Publicly Tally-Hiding Verifiable E-Voting,” in CCS ’22: ACM Conference on Computer and Communications Security, November 7--11, 2022, Los Angeles, USA, 2022, pp. 1443--1457.
    4. Nicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke, Johannes Müller, Daniel Rausch, Pascal Reisert, and Andreas Vogt, “Kryvos: Publicly Tally-Hiding Verifiable E-Voting,” Cryptology ePrint Archive, Technical Report 2022/1132, 2022.
    5. David Mestel, Johannes Müller, and Pascal Reisert, “How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis,” in 35th IEEE Computer Security Foundations Symposium, CSF 2022, Haifa, Israel, August 7-10, 2022, 2022, pp. 179--194.
    6. David Mestel, Johannes Müller, and Pascal Reisert, “How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis,” Cryptology ePrint Archive, Technical Report 2022/743, 2022.
    7. Toomas Krips, Ralf Küsters, Pascal Reisert, and Marc Rivinius, “Arithmetic Tuples for MPC,” Cryptology ePrint Archive, Technical Report 2022/667, 2022.
    8. Marc Rivinius, Pascal Reisert, Daniel Rausch, and Ralf Küsters, “Publicly Accountable Robust Multi-Party Computation,” in 43rd IEEE Symposium on Security and Privacy (S&P 2022), 2022, pp. 2430--2449.
    9. Marc Rivinius, Pascal Reisert, Daniel Rausch, and Ralf Küsters, “Publicly Accountable Robust Multi-Party Computation,” Cryptology ePrint Archive, Technical Report 2022/436, 2022.
  4. 2016

    1. Pascal Reisert, “Moduli Spaces of Parabolic Twisted Generalized Higgs Bundles,” Ludwig-Maximilians University, Germany, 2016. Available as urn:nbn:de:bvb:19-198909.
  5. 2011

    1. Pascal Reisert, “Kobayashi-Hitchin Correspondence for Tame Harmonic Bundles,” Thesis, Ludwig-Maximilians University, Germany, 2011. Available as urn:nbn:de:bvb:19-epub-28472-2.
  6. 2009

    1. Pascal Reisert, “The Multiplicative Structure in Verlinde Algebras over SU(2),” Thesis, Ludwig-Maximilians University, Germany, 2009. Available as urn:nbn:de:bvb:19-epub-28471-6.
  • Indocrypt 2021
  • GI-Sicherheit 2022, 2024
  • IEEE Symposium on Security and Privacy (SP) 2023
  • IEEE Computer Security Foundations Symposium (CSF) 2023 (also Special Session Chair on Cryptography)
  • International Joint Conference on Electronic Voting (E-VOTE-ID) 2022, 2023, 2024
  • International Workshop on Cyberspace Security and Artificial Intelligence (CAI-2023)
  • International Conference on Availability, Reliability and Security (ARES 2024)

Are you a student and want to write a thesis / carry out a project at the SEC?

To the top of the page