Daniel Rausch

Orcid: 0000-0002-1901-3659

Affiliations:
  • University of Stuttgart
  • University of Trier (former)


According to our database1, Daniel Rausch authored at least 24 papers between 2014 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Universally Composable Adaptor Signatures.
IACR Cryptol. ePrint Arch., 2025

Universally Composable Password-Hardened Encryption.
IACR Cryptol. ePrint Arch., 2025

Verifiable E-Voting with a Trustless Bulletin Board.
Proceedings of the 38th IEEE Computer Security Foundations Symposium, 2025

A Fully-Adaptive Threshold Partially-Oblivious PRF.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
ZK-SNARKs for Ballot Validity: A Feasibility Study.
Proceedings of the Electronic Voting - 9th International Joint Conference, 2024

Accountable Bulletin Boards: Definition and Provably Secure Implementation.
Proceedings of the 37th IEEE Computer Security Foundations Symposium, 2024

2023
AUC: Accountable Universal Composability.
Proceedings of the 44th IEEE Symposium on Security and Privacy, 2023

Fully Tally-Hiding Verifiable E-Voting for Real-World Elections with Seat-Allocations.
Proceedings of the Computer Security - ESORICS 2023, 2023

2022
Publicly Accountable Robust Multi-Party Computation.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Embedding the UC Model into the IITM Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Kryvos: Publicly Tally-Hiding Verifiable E-Voting.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Extending the Tally-Hiding Ordinos System: Implementations for Borda, Hare-Niemeyer, Condorcet, and Instant-Runoff Voting.
IACR Cryptol. ePrint Arch., 2021

A Security Framework for Distributed Ledgers.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Simple and flexible universal composability: definition of a framework and applications.
PhD thesis, 2020

Joint State Composition Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation.
J. Cryptol., 2020

The IITM Model: A Simple and Expressive Model for Universal Composability.
J. Cryptol., 2020

Ordinos: A Verifiable Tally-Hiding E-Voting System.
Proceedings of the IEEE European Symposium on Security and Privacy, 2020

Accountability in a Permissioned Blockchain: Formal Analysis of Hyperledger Fabric.
Proceedings of the IEEE European Symposium on Security and Privacy, 2020

2019
iUC: Flexible Universal Composability Made Simple.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Universal Composability: A Comparison of Different Models.
Proceedings of the 29. Krypto-Tag, Renningen, Germany, September 6-7, 2018, 2018

2017
A Framework for Universally Composable Diffie-Hellman Key Exchange.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

2016
Universal Composition with Responsive Environments.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2014
A directory comparison and manipulation tool.
Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing, 2014

Get your directories right: From hierarchy visualization to hierarchy manipulation.
Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing, 2014


  Loading...