Fabian Regen

Dipl.-Ing. / BSc

Research Areas

Cryptography, Cybersecurity

Role

PreDoc Researcher
Security and Privacy, E192-06

Contact

Publications

Round-Optimal Threshold Blind Signatures Without Random Oracles / Fuchsbauer, G., Regen, F., & Hoeteck, W. (2026). Round-Optimal Threshold Blind Signatures Without Random Oracles. In N. Heninger & M. Rosulek (Eds.), Advances in Cryptology – CRYPTO 2026 : 46th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17–20, 2026, Proceedings, Part VII (pp. 555–587). Springer, Cham. https://doi.org/10.1007/978-3-032-35415-0_18
Projects: COnFIDE (2020–2029) / CrossPings (2026–2029) / SFB SPyCoDe (2023–2030)
A Composable Game-Theoretic Framework for Blockchains / Avarikioti, G., Fuchsbauer, G., Keer, P., Maffei, M., & Regen, F. (2026). A Composable Game-Theoretic Framework for Blockchains. In 2026 IEEE 39th Computer Security Foundations Symposium (CSF) (pp. 513–528). IEEE. https://doi.org/10.1109/CSF68417.2026.00034
Projects: BlockSec (2025–2030) / COnFIDE (2020–2029) / CROSS (2026–2030) / SFB SPyCoDe (2023–2030)
On Security Proofs of Existing Equivalence Class Signature Schemes / Bauer, B., Fuchsbauer, G., & Regen, F. (2024). On Security Proofs of Existing Equivalence Class Signature Schemes. In K.-M. Chung & Y. Sakaki (Eds.), Advances in Cryptology – ASIACRYPT 2024 : 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9–13, 2024, Proceedings, Part II (pp. 3–37). Springer. https://doi.org/10.1007/978-981-96-0888-1_1
Projects: COnFIDE (2020–2029) / SFB SPyCoDe (2023–2030)
On Proving Equivalence Class Signatures Secure from Non-interactive Assumptions / Bauer, B., Fuchsbauer, G., & Regen, F. (2024). On Proving Equivalence Class Signatures Secure from Non-interactive Assumptions. In Public-Key Cryptography – PKC 2024 (pp. 3–36). https://doi.org/10.1007/978-3-031-57718-5_1
Projects: COnFIDE (2020–2029) / SFB SPyCoDe (2023–2030)
On the impossbility of proving security of equivalence class signatures from computational assumptions / Regen, F. (2023). On the impossbility of proving security of equivalence class signatures from computational assumptions [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.116107
Download: PDF (502 KB)