Daniel Günther

Daniel Günther M.Sc.

Doctoral Researcher


work +49 6151 16-27301

Work S2|20 210
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

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


  • 2017-2019 M.Sc. in IT Security, Technical University of Darmstadt, Germany
  • 2013-2017 B.Sc. in Computer Science, Technical University of Darmstadt, Germany


CORE A/A* ranked venues marked in bold.


Daniel Günther, Thomas Schneider, and Felix Wiegand. Poster: Revisiting hybrid private information retrieval. In 28. ACM Conference on Computer and Communications Security (CCS'21) Posters/Demos, ACM, Virtual Event, November 15-19, 2021. To appear. Code: CORE rank A*. [ web ]

Daniel Günther, Maurice Heymann, Benny Pinkas, and Thomas Schneider. GPU-accelerated PIR with client-independent preprocessing for large-scale applications. Cryptology ePrint Archive, Report 2021/823, June 16, 2021.


Daniel Günther, Marco Holz, Benjamin Judkewitz, Helen Möllering, Benny Pinkas, and Thomas Schneider. PEM: Privacy-preserving Epidemiological Modeling. Cryptology ePrint Archive, Report 2020/1546, December 11, 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: Code: CORE rank A*. [ DOI | pdf | web ]


Daniel Günther. Optimizing private information retrieval for compromised credential checking. Master's thesis, TU Darmstadt, Germany, November 22, 2019.

Daniel Günther, Ágnes Kiss, Lukas Scheidel, and Thomas Schneider. Poster: Framework for semi-private function evaluation with application to secure insurance rate calculation. In 26. ACM Conference on Computer and Communications Security (CCS'19) Posters/Demos, pages 2541–2543, ACM, London, UK, November 11-15, 2019. Acceptance rate 67.2%. CORE rank A*. [ DOI | pdf | poster | web ]


Daniel Günther. Private function evaluation with universal circuits. In 29. Kryptotag (crypto day matters), Gesellschaft für Informatik e.V. / FG KRYPTO, Bosch Renningen, Germany, September 6-7, 2018.


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: Code: 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.