Team

Ágnes Kiss

Dr.-Ing. Ágnes Kiss

Former PhD Student

Contact

This website is no longer updated. Please see my new website for more information.

I was a PhD student (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

Work Experience

  • 2015/02 – 2020/09 Doctoral Researcher at ENCRYPTO
  • 2014/05 – 2014/08 Research Internship at Deutsche Telekom, Berlin

Studies

Publications

Jump to: 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2012
Number of items: 18.

2020

Buchmann, Johannes and Dessouky, Ghada and Frassetto, Tommaso and Kiss, Ágnes and Sadeghi, Ahmad-Reza and Schneider, Thomas and Traverso, Giulia and Zeitouni, Shaza (2020):
SAFE: A Secure and Efficient Long-Term Distributed Storage System.
8th International Workshop on Security in Blockchain and Cloud Computing (SBC'20), Taipei, Taiwan, June 1-5, 2020, [Conference or Workshop Item]

Holz, Marco and Kiss, Ágnes and Rathee, Deevashwer and Schneider, Thomas (2020):
Linear-Complexity Private Function Evaluation is Practical.
25. European Symposium on Research in Computer Security (ESORICS'20), virtual Conference, 14.-18.09.2020, [Conference or Workshop Item]

Cammarota, Rosario and Schunter, Matthias and Rajan, Anand and Boemer, Fabian and Kiss, Ágnes and Treiber, Amos and Weinert, Christian and Schneider, Thomas and Stapf, Emmanuel and Sadeghi, Ahmad-Reza and Demmler, Daniel and Chen, Huili and Hussain, Siam Umar and Riazi, M. Sadegh and Koushanfar, Farinaz and Gupta, Saransh and Rosing, Simunic (2020):
Trustworthy AI Inference Systems: An Industry Research View.
In: arXiv/Computer Science/Cryptography and Security, Version 1, [Report]

Alhassan, Masaud Y. and Günther, Daniel and Kiss, Ágnes and Schneider, Thomas (2020):
Efficient and Scalable Universal Circuits.
In: Journal of Cryptology (JoC), Springer, DOI: 10.1007/s00145-020-09346-z,
[Article]

2019

Felsen, Susanne and Kiss, Ágnes and Schneider, Thomas and Weinert, Christian (2019):
Secure and Private Function Evaluation with Intel SGX.
CCSW 2019 - The ACM Cloud Computing Security Workshop, London, UK, November, 11th, 2019, [Conference or Workshop Item]

Günther, Daniel and Kiss, Ágnes and Scheidel, Lukas and Schneider, Thomas (2019):
Poster: Framework for Semi-private Function Evaluation with Application to Secure Insurance Rate Calculation.
ACM, ACM CCS 2019, London, November 11-15, 2019, DOI: 10.1145/3319535.3363251,
[Conference or Workshop Item]

Järvinen, Kimmo and Kiss, Ágnes and Schneider, Thomas and Tkachenko, Oleksandr and Yang, Zheng (2019):
Faster Privacy-Preserving Location Proximity Schemes for Circles and Polygons.
In: IET Information Security, DOI: 10.1049/iet-ifs.2019.0125,
[Article]

Kiss, Ágnes and Naderpour, Masoud and Liu, Jian and Asokan, N. and Schneider, Thomas (2019):
SoK: Modular and Efficient Private Decision Tree Evaluation.
2, In: Proceedings on Privacy Enhancing Technologies (PoPETs), De Gruyter Open, [Article]

Kiss, Ágnes and Schick, Oliver and Schneider, Thomas (2019):
Web Application for Privacy-Preserving Scheduling using Secure Computation.
In: 16. International Conference on Security and Cryptography (SECRYPT'19),
SciTePress, [Conference or Workshop Item]

2018

Järvinen, Kimmo and Kiss, Ágnes and Schneider, Thomas and Tkachenko, Oleksandr and Yang, Zheng (2018):
Faster Privacy-Preserving Location Proximity Schemes.
In: 17. International Conference on Cryptology And Network Security (CANS'18), pp. 3-22,
Springer, DOI: 10.1007/978-3-030-00434-7_1,
[Conference or Workshop Item]

Kiss, Ágnes and Schick, Oliver and Schneider, Thomas (2018):
Web Application for Privacy-Preserving Scheduling (Poster).
27. USENIX Security Symposium: USENIX Security'18 : Poster Session, Baltimore, MD, USA, August 15–17, 2018, [Conference or Workshop Item]

2017

Günther, Daniel and Kiss, Ágnes and Schneider, Thomas (2017):
More Efficient Universal Circuit Constructions.
In: 23. Advances in Cryptology -- ASIACRYPT 2017, pp. 443-470,
Springer, DOI: 10.1007/978-3-319-70697-9_16,
[Conference or Workshop Item]

Kiss, Ágnes and Liu, Jian and Schneider, Thomas and Asokan, N. and Pinkas, Benny (2017):
Private Set Intersection for Unequal Set Sizes with Mobile Applications.
In: Proceedings on Privacy Enhancing Technologies (PoPETs), (4), pp. 177-197. De Gruyter Open, DOI: 10.1515/popets-2017-0044,
[Article]

2016

Kiss, Ágnes and Schneider, Thomas (2016):
Valiant's Universal Circuit is Practical.
In: 35. Advances in Cryptology -- EUROCRYPT 2016, pp. 699-728,
Springer, DOI: 10.1007/978-3-662-49890-3_27,
[Conference or Workshop Item]

Rauzy, Pablo and Kiss, Ágnes and Krämer, Juliane and Seifert, Jean-Pierre (2016):
Algorithmic Countermeasures Against Fault Attacks and Power Analysis for RSA-CRT.
In: Constructive Side-Channel Analysis and Secure Design - 7. International Workshop (COSADE'16), pp. 111-129,
Springer, DOI: 10.1007/978-3-319-43283-0_7,
[Conference or Workshop Item]

2015

Krämer, Juliane and Kiss, Ágnes and Stüber, Anke (2015):
On the Optimality of Differential Fault Analyses on CLEFIA.
In: 6. International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS'15), pp. 181-196,
Springer, DOI: 10.1007/978-3-319-32859-1_15,
[Conference or Workshop Item]

2014

Kiss, Ágnes (2014):
Testing Self-Secure Exponentiation Countermeasures Against the Bellcore Attack.
Technical University of Berlin, [Master Thesis]

2012

Kiss, Ágnes (2012):
Finding and Representations of Minimum Cuts and Their Applications.
Budapest University of Technology and Economics, [Bachelor Thesis]

This list was generated on Fri Nov 27 03:40:18 2020 CET.