Dieses Bild zeigt Daniel Rausch

Daniel Rausch

Herr Dr.

Postdoc
Institute of Information Security

Kontakt

Universitaetsstrasse 38
70569 Stuttgart
Germany
Raum: 2.458

  1. 2022

    1. 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.
    2. 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. 2021

    1. Mike Graf, Daniel Rausch, Viktoria Ronge, Christoph Egger, Ralf Küsters, und Dominique Schröder, „A Security Framework for Distributed Ledgers“, CCS ’21: ACM Conference on Computer and Communications Security, November 14--19, 2021, Seoul, South Korea, 2021.
    2. Fabian Hertel, Nicolas Huber, Jonas Kittelberger, Ralf Küsters, Julian Liedtke, und Daniel Rausch, „Extending the Tally-Hiding Ordinos System: Implementations for Borda, Hare-Niemeyer, Condorcet, and Instant-Runoff Voting“, in Electronic Voting - Sixth International Joint Conference on Electronic Voting, 5 – 8 October 2021, Online, Proceedings, 2021.
    3. Fabian Hertel, Nicolas Huber, Jonas Kittelberger, Ralf Küsters, Julian Liedtke, und Daniel Rausch, „Extending the Tally-Hiding Ordinos System: Implementations for Borda, Hare-Niemeyer, Condorcet, and Instant-Runoff Voting“, Cryptology ePrint Archive, Technical Report 2021/1420, 2021.
    4. Mike Graf, Daniel Rausch, Viktoria Ronge, Christoph Egger, Ralf Küsters, und Dominique Schröder, „A Security Framework for Distributed Ledgers“, Cryptology ePrint Archive, Technical Report 2021/145, 2021.
  3. 2020

    1. Daniel Rausch, „Simple and flexible universal composability: definition of a framework and applications“, University of Stuttgart, Germany, Ph.D. Thesis, 2020.
    2. Ralf Küsters, Max Tuengerthal, und Daniel Rausch, „Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation“, J. Cryptol., Bd. 33, Nr. 4, S. 1585--1658, 2020.
    3. Ralf Küsters, Max Tuengerthal, und Daniel Rausch, „The IITM Model: a Simple and Expressive Model for Universal Composability“, J. Cryptol., Bd. 33, Nr. 4, S. 1461--1584, 2020.
    4. Mike Graf, Ralf Küsters, und Daniel Rausch, „Accountability in a Permissioned Blockchain: Formal Analysis of Hyperledger Fabric“, in IEEE European Symposium on Security and Privacy, EuroS&P 2020, Genoa, Italy, September 7-11, 2020, 2020, S. 236--255.
    5. Mike Graf, Ralf Küsters, und Daniel Rausch, „Accountability in a Permissioned Blockchain: Formal Analysis of Hyperledger Fabric“, Cryptology ePrint Archive, Technical Report 2020/386, 2020.
    6. Ralf Küsters, Julian Liedtke, Johannes Müller, Daniel Rausch, und Andreas Vogt, „Ordinos: A Verifiable Tally-Hiding Remote E-Voting System“, in IEEE European Symposium on Security and Privacy, EuroS&P 2020, Genoa, Italy, September 7-11, 2020, 2020, S. 216--235.
    7. Ralf Küsters, Julian Liedtke, Johannes Müller, Daniel Rausch, und Andreas Vogt, „Ordinos: A Verifiable Tally-Hiding E-Voting System“, Cryptology ePrint Archive, Technical Report 2020/405, 2020.
  4. 2019

    1. Jan Camenisch, Stephan Krenn, Ralf Küsters, und Daniel Rausch, „iUC: Flexible Universal Composability Made Simple“, in Advances in Cryptology - ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8-12, 2019, Proceedings, Part III, 2019, Bd. 11923, S. 191--221.
    2. Jan Camenisch, Stephan Krenn, Ralf Küsters, und Daniel Rausch, „iUC: Flexible Universal Composability Made Simple“, Cryptology ePrint Archive, Technical Report 2019/1073, 2019.
  5. 2018

    1. Ralf Küsters, Max Tuengerthal, und Daniel Rausch, „The IITM Model: a Simple and Expressive Model for Universal Composability“, Cryptology ePrint Archive, Technical Report 2013/025, 2018. Available at http://eprint.iacr.org/2013/025/. This is an updated version of the technical report from 2013. Compared to the previous version, we added a discussion on Canetti’s UC model, version July 2013. We provided more examples of how the IITM model can be used. The actual model did not change at all.
  6. 2017

    1. Ralf Küsters und Daniel Rausch, „A Framework for Universally Composable Diffie-Hellman Key Exchange“, in IEEE 38th Symposium on Security and Privacy (S&P 2017), 2017, S. 881--900.
    2. Ralf Küsters und Daniel Rausch, „A Framework for Universally Composable Diffie-Hellman Key Exchange“, Cryptology ePrint Archive, Technical Report 2017/256, 2017. Available at http://eprint.iacr.org/2017/256.
  7. 2016

    1. Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, und Daniel Rausch, „Universal Composition with Responsive Environments“, in Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, 2016, S. 807--840.
    2. Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, und Daniel Rausch, „Universal Composition with Responsive Environments“, Cryptology ePrint Archive, Report 2016/034, 2016. Available at http://eprint.iacr.org/2016/034.
Since 2020 University of Stuttgart
Post doctoral researcher at the institute for information security
2017 - 2020

University of Stuttgart
PhD student and researcher at the institute for information security

PhD (Dr. rer. nat.) in Computer Science with distinction, 2020.
Thesis: "Simple and Flexible Universal Composability: Definition of a Framework and Applications"
Advisor: Prof. Dr. Ralf Küsters

2014 - 2016

University of Trier
PhD student and researcher at the chair for information security and cryptography

2012 - 2014

University of Trier
Master of Science (Computer Science)
Thesis: "Modulare kryptographische Analyse des PeerKey Handshakes in WPA2"

Scholarships: Deutschlandstipendium sponsored by the Nikolaus Koch Stiftung (2013-2014)

2009 - 2012

University of Trier
Bachelor of Education (Computer Science and Mathematics)
Thesis: "Interaktives Zusammenführen von Hierarchien"

Umfangreichere Informationen finden Sie auf unserer englischsprachigen Seite.

Zum Seitenanfang