Daniel Günther M.Sc.
Doctoral Researcher
Contact
guenther@encrypto.cs.tu-...
work +49 6151 16-27302
Work
S2|20 211
Pankratiusstraße 2
64289
Darmstadt
I am a doctoral researcher and member of the Cryptography and Privacy Engineering Group (ENCRYPTO) at the Department of Computer Science of Technische Universität Darmstadt, Germany.
My research focuses on the design and evaluation of efficient and secure private function evaluation protocols.
Honors and Awards
- CAST Förderpreis IT Security 2020 – 1st prize with Master Thesis
- CAST Förderpreis IT Security 2018 – 1st prize with Bachelor Thesis
Work Experience
- Since 2019/12 Doctoral Researcher at ENCRYPTO
- 2017/04 – 2019/11 Student Research Assistant at ENCRYPTO
- 2014/10 – 2017/04 Student Teaching Assistant
Studies
- 2017-2019 M.Sc. in IT Security, Technical University of Darmstadt, Germany
- 2013-2017 B.Sc. in Computer Science, Technical University of Darmstadt, Germany
Publications
CORE A/A* ranked venues marked in bold.
2020
Masaud Y. Alhassan, Daniel Günther, Ágnes Kiss, and Thomas Schneider. Efficient and scalable universal circuits. Journal of Cryptology (JoC), 33(3):1216–1271, April 8, 2020. Preliminary version: https://ia.cr/2019/348. Code: https://encrypto.de/code/UC. CORE rank A*. [ DOI | pdf | web ]
2019
Daniel Günther, Ágnes Kiss, Lukas Scheidel, and Thomas Schneider. Framework for semi-private function evaluation with application to secure insurance rate calculation. In 26. ACM Conference on Computer and Communications Security (CCS'19) Poster/Demo, pages 2541–2543, ACM, London, UK, November 11-15, 2019. Acceptance rate 67.2%. CORE rank A*. [ DOI | pdf | poster | web ]
2018
Daniel Günther. Private function evaluation with universal circuits. In 29. Workshop der Fachgruppe Kryptographie in der Gesellschaft für Informatik (Kryptotag), Bosch Renningen, Germany, September 6-7, 2018.
2017
Daniel Günther, Ágnes Kiss, and Thomas Schneider. More efficient universal circuit constructions. In 23. Advances in Cryptology – ASIACRYPT'17, volume 10625 of LNCS, pages 443–470, Springer, Hong Kong, China, December 3-7, 2017. Full version: https://ia.cr/2017/798. Code: https://encrypto.de/code/UC. Acceptance rate 27.6%. CORE rank A. [ DOI | pdf | web ]
Daniel Günther. Valiant's universal circuit – towards a modular construction and implementation. Bachelor's thesis, TU Darmstadt, Germany, March 31, 2017.