CORE A/A* ranked venues marked in bold.
Yann Disser, Daniel Günther, Thomas Schneider, Maximilian Stillger, Arthur Wigandt, and Hossein Yalame. Breaking the size barrier: Universal circuits meet lookup tables. In 29. Advances in Cryptology - ASIACRYPT'23, volume 14438 of LNCS, pages 3–37, Springer, Guangzhou, China, December 4-8, 2023. Full version: https://ia.cr/2022/1652. Code: https://encrypto.de/code/LUC. Acceptance rate 28.2%. CORE rank A. [ DOI | pdf | web ]
Thomas Reinhold, Philipp Kühn, Daniel Günther, Thomas Schneider, and Christian Reuter. ExTRUST: Reducing exploit stockpiles with a privacy-preserving depletion system for inter-state relationships. IEEE Transactions on Technology and Society, 4(2):158–170, May 29, 2023. Online: http://arxiv.org/abs/2306.00589. [ DOI | pdf | web ]
Daniel Günther, Marco Holz, Benjamin Judkewitz, Helen Möllering, Benny Pinkas, Thomas Schneider, and Ajith Suresh. POSTER: Privacy-preserving epidemiological modeling on mobile graphs. In 29. ACM Conference on Computer and Communications Security (CCS'22) Posters/Demos, pages 3351–3353, ACM, Los Angeles, USA, November 7-11, 2022. CORE rank A*. [ DOI | pdf | web ]
Daniel Günther, Maurice Heymann, Benny Pinkas, and Thomas Schneider. GPU-accelerated PIR with client-independent preprocessing for large-scale applications. In 31. USENIX Security Symposium (USENIX Security'22), pages 1759–1776, USENIX, Boston, MA, USA, August 10-12, 2022. Online: https://ia.cr/2021/823. Code: https://encrypto.de/code/cip-pir. Acceptance rate 18.1%. CORE rank A*. [ pdf | web ]
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, pages 2408–2410, ACM, Virtual Event, November 15-19, 2021. Code: https://encrypto.de/code/HybridPIR. CORE rank A*. [ DOI | pdf | web ]
Daniel Günther, Marco Holz, Benjamin Judkewitz, Helen Möllering, Benny Pinkas, Thomas Schneider, and Ajith Suresh. Privacy-preserving epidemiological modeling on mobile graphs. Cryptology ePrint Archive, Report 2020/1546, December 11, 2020. https://ia.cr/2020/1546.
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 ]
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. Code: https://encrypto.de/code/spfe-framework. 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: 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.