Dr.-Ing. Ágnes Kiss
Former Doctoral Researcher
Contact
kiss@encrypto.cs.tu-...
This website is no longer updated. Please see my new website for more information.
Team
I was a doctoral researcher (2015/02 – 2020/09) and member of the Cryptography and Privacy Engineering Group (ENCRYPTO) at the Department of Computer Science of Technische Universität Darmstadt, Germany.
In November 2020, I started as a postdoctoral researcher at CISPA.
My research focuses on the design and evaluation of efficient and secure private function evaluation protocols.
Besides, my interests include secure multi-party computation, graph theory, and countermeasures against fault attacks and side-channel analysis.
PC Memberships
Honors and Awards
- CROSSING Collaboration Award 2019
- Invitation to the 6. Heidelberg Laureate Forum (HLF)
- Stipend for visiting Women in Theory 2018
- CAST Förderpreis IT Sicherheit 2015 – 3rd prize with Master thesis
- European Institute for Innovation and Technology (EIT) Digital Master School Scholarship
Work Experience
- 2015/02 – 2020/09 Doctoral Researcher at ENCRYPTO
- 2014/05 – 2014/08 Research Internship at Deutsche Telekom, Berlin
Studies
- 2012-2014 M.Sc. in Security & Privacy, University of Trento, Italy & Technical University of Berlin, Germany within the EIT Digital Master School
- 2009-2012 Bachelor in Mathematics, Budapest University of Technology and Economics, Hungary
Publications
CORE A/A* ranked venues marked in bold.
2020
Johannes Buchmann, Ghada Dessouky, Tommaso Frassetto, Ágnes Kiss, Ahmad-Reza Sadeghi, Thomas Schneider, Giulia Traverso, and Shaza Zeitouni. SAFE: A secure and efficient long-term distributed storage system. In 8. ACM International Workshop on Security in Blockchain and Cloud Computing (SBC@ASIACCS'20), pages 8–13, ACM, Virtual Event, October 6, 2020. Online: https://ia.cr/2020/690. Acceptance rate 44.4%. [ DOI | pdf | web ]
Ágnes Kiss. Efficient Private Function Evaluation. PhD thesis, TU Darmstadt, Germany, September 25, 2020. [ pdf ]
Marco Holz, Ágnes Kiss, Deevashwer Rathee, and Thomas Schneider. Linear-complexity private function evaluation is practical. In 25. European Symposium on Research in Computer Security (ESORICS'20), volume 12309 of LNCS, pages 401–420, Springer, Virtual Event, September 14-18, 2020. Full version: https://ia.cr/2020/853. Code: https://encrypto.de/code/linearPFE. Acceptance rate 19.7%. CORE rank A. [ DOI | pdf | web ]
Rosario Cammarota, Matthias Schunter, Anand Rajan, Fabian Boemer, Ágnes Kiss, Amos Treiber, Christian Weinert, Thomas Schneider, Emmanuel Stapf, Ahmad-Reza Sadeghi, Daniel Demmler, Huili Chen, Siam Umar Hussain, Sadegh Riazi, Farinaz Koushanfar, Saransh Gupta, Tajan Simunic Rosing, Kamalika Chaudhuri, Hamid Nejatollahi, Nikil Dutt, Mohsen Imani, Kim Laine, Anuj Dubey, Aydin Aysu, Fateme Sadat Hosseini, Chengmo Yang, Eric Wallace, and Pamela Norton. Trustworthy AI inference systems: An industry research view, August 10, 2020. https://arxiv.org/abs/2008.04449. [ arXiv ]
Kimmo Järvinen, Ágnes Kiss, Thomas Schneider, Oleksandr Tkachenko, and Zheng Yang. Faster privacy-preserving location proximity schemes for circles and polygons. IET Information Security, 14(3):254–265, May, 2020. CORE rank C. [ DOI | pdf | web ]
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. 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 ]
Susanne Felsen, Ágnes Kiss, Thomas Schneider, and Christian Weinert. Secure and private function evaluation with Intel SGX. In 10. ACM Cloud Computing Security Workshop (CCSW'19), pages 165–181, ACM, London, UK, November 11, 2019. Acceptance rate 37.5%. [ DOI | pdf | web ]
Ágnes Kiss, Oliver Schick, and Thomas Schneider. Web application for privacy-preserving scheduling using secure computation. In 16. International Conference on Security and Cryptography (SECRYPT'19), pages 456–463, SciTePress, Prague, Czech Republic, July 26-28, 2019. Short paper. Code: https://encrypto.de/code/scheduling. Acceptance rate 15.2%. CORE rank B. [ DOI | pdf | poster | web ]
Ágnes Kiss, Masoud Naderpour, Jian Liu, N. Asokan, and Thomas Schneider. SoK: Modular and efficient private decision tree evaluation. Proceedings on Privacy Enhancing Technologies (PoPETs), 2019(2):187–208, April 2019. Full version: https://ia.cr/2018/1099. Code: https://encrypto.de/code/PDTE. Acceptance rate 21.1%. CORE rank A. [ DOI | pdf | web ]
2018
Kimmo Järvinen, Ágnes Kiss, Thomas Schneider, Oleksandr Tkachenko, and Zheng Yang. Faster privacy-preserving location proximity schemes. In 17. International Conference on Cryptology And Network Security (CANS'18), volume 11124 of LNCS, pages 3–22, Springer, Naples, Italy, September 30-October 3, 2018. Full version: https://ia.cr/2018/694. Acceptance rate 32.9%. CORE rank B. [ DOI | pdf | web ]
Ágnes Kiss, Oliver Schick, and Thomas Schneider. POSTER: Web application for privacy-preserving scheduling. 27. USENIX Security Symposium (USENIX Security'18) Poster Session, Baltimore, MD, USA, August 15-17, 2018. CORE rank A*. [ poster | web ]
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 ]
Ágnes Kiss, Jian Liu, Thomas Schneider, N. Asokan, and Benny Pinkas. Private set intersection for unequal set sizes with mobile applications. Proceedings on Privacy Enhancing Technologies (PoPETs), 2017(4):177–197, October 2017. Full version: https://ia.cr/2017/670. Code: https://encrypto.de/code/MobilePSI. Acceptance rate 21.7%. CORE rank A. [ DOI | pdf | web ]
2016
Ágnes Kiss and Thomas Schneider. Valiant's universal circuit is practical. In 35. Advances in Cryptology – EUROCRYPT'16, volume 9665 of LNCS, pages 699–728, Springer, Vienna, Austria, May 8-12, 2016. Full version: https://ia.cr/2016/093. Code: https://encrypto.de/code/UC. Acceptance rate 22.6%. CORE rank A*. [ DOI | pdf | web ]
Ágnes Kiss, Juliane Krämer, Pablo Rauzy, and Jean-Pierre Seifert. Algorithmic countermeasures against fault attacks and power analysis for RSA-CRT. In 7. International Workshop on Constructive Side-Channel Analysis and Secure Design (COSADE'16), volume 9689 of LNCS, pages 111–129, Springer, Graz, Austria, April 14-15, 2016. [ DOI | web ]
2015
Ágnes Kiss, Juliane Krämer, and Anke Stüber. On the optimality of differential fault analyses on CLEFIA. In 6. International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS'15), volume 9582 of LNCS, pages 181–196, Springer, Berlin, Germany, November 11-13, 2015. [ DOI | web ]
2014
Ágnes Kiss. Testing self-secure exponentiation countermeasures against the bellcore attack. Master's thesis, TU Berlin, Germany, November, 2014.
2012
Ágnes Kiss. Finding and representations of minimum cuts and their applications. Bachelor's thesis, Budapest University of Technology and Economics, Hungary, May, 2012.