Dieses Bild zeigt Pascal Reisert

Pascal Reisert

Herr Dr.

Postdoc
Institute of Information Security

Kontakt

Universitaetsstraße 38
70569 Stuttgart
Germany
Raum: 2.454

  1. 2022

    1. David Mestel, Johannes Müller, und 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.
    2. David Mestel, Johannes Müller, und Pascal Reisert, „How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis“, Cryptology ePrint Archive, Technical Report 2022/743, 2022.
    3. Pascal Reisert, Marc Rivinius, and Toomas Krips, und Ralf Küsters, „Arithmetic Tuples for MPC“, Cryptology ePrint Archive, Technical Report 2022/667, 2022.
    4. Marc Rivinius, Pascal Reisert, Daniel Rausch, und Ralf Ralf Küsters, „Publicly Accountable Robust Multi-Party Computation“, in 43rd IEEE Symposium on Security and Privacy (S&P 2022), 2022.
    5. Marc Rivinius, Pascal Reisert, Daniel Rausch, und Ralf Küsters, „Publicly Accountable Robust Multi-Party Computation“, Cryptology ePrint Archive, Technical Report 2022/436, 2022.
  2. 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.
  3. 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.
  4. 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.

Umfangreichere Informationen finden Sie auf unserer englischsprachigen Seite.

Zum Seitenanfang