Ágnes Kiss

Ágnes Kiss, M.Sc.

Ágnes Kiss

PhD Student

I am a PhD student 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.

Besides, my interests include secure multi-party computation, graph theory, and countermeasures against fault attacks and side-channel analysis.


S2|20 209
Pankraktiusstraße 2
64289 Darmstadt

+49 6151 16-27301


Exportieren als [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item type | No grouping
Jump to: 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2012
Number of items: 16.


Buchmann, Johannes ; Dessouky, Ghada ; Frassetto, Tommaso ; Kiss, Ágnes ; Sadeghi, Ahmad-Reza ; Schneider, Thomas ; Traverso, Giulia ; Zeitouni, Shaza (2020):
SAFE: A Secure and Efficient Long-Term Distributed Storage System.
In: 8th International Workshop on Security in Blockchain and Cloud Computing (SBC'20), Taipei, Taiwan, June 1-5, 2020, [Online-Edition: https://conference.cs.cityu.edu.hk/asiaccsscc/],
[Conference item]

Alhassan, Masaud Y. ; Günther, Daniel ; Kiss, Ágnes ; Schneider, Thomas (2020):
Efficient and Scalable Universal Circuits.
In: Journal of Cryptology (JoC), 2020. Springer, [Article]


Felsen, Susanne ; Kiss, Ágnes ; Schneider, Thomas ; Weinert, Christian (2019):
Secure and Private Function Evaluation with Intel SGX.
In: CCSW 2019 - The ACM Cloud Computing Security Workshop, London, UK, November, 11th, 2019, [Online-Edition: https://encrypto.de/papers/FKSW19.pdf],
[Conference item]

Günther, Daniel ; Kiss, Ágnes ; Scheidel, Lukas ; Schneider, Thomas (2019):
Poster: Framework for Semi-private Function Evaluation with Application to Secure Insurance Rate Calculation.
ACM, In: ACM CCS 2019, London, November 11-15, 2019, DOI: 10.1145/3319535.3363251,
[Online-Edition: https://encrypto.de/papers/GKSS19.pdf],
[Conference item]

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

Kiss, Ágnes ; Naderpour, Masoud ; Liu, Jian ; Asokan, N. ; Schneider, Thomas (2019):
SoK: Modular and Efficient Private Decision Tree Evaluation.
In: Proceedings on Privacy Enhancing Technologies (PoPETs), 2De Gruyter Open, [Online-Edition: https://encrypto.de/papers/KNLAS19.pdf],

Kiss, Ágnes ; Schick, Oliver ; Schneider, Thomas (2019):
Web Application for Privacy-Preserving Scheduling using Secure Computation.
In: 16. International Conference on Security and Cryptography (SECRYPT'19), SciTePress, [Online-Edition: https://encrypto.de/papers/KSS19.pdf],
[Conference item]


Järvinen, Kimmo ; Kiss, Ágnes ; Schneider, Thomas ; Tkachenko, Oleksandr ; Yang, Zheng (2018):
Faster Privacy-Preserving Location Proximity Schemes.
In: 17. International Conference on Cryptology And Network Security (CANS'18), Springer, S. 3-22, DOI: 10.1007/978-3-030-00434-7_1,
[Online-Edition: https://encrypto.de/papers/JKSTY18.pdf],
[Conference item]

Kiss, Ágnes ; Schick, Oliver ; Schneider, Thomas (2018):
Web Application for Privacy-Preserving Scheduling (Poster).
[Online-Edition: https://encrypto.de/papers/KSS18.pdf],


Günther, Daniel ; Kiss, Ágnes ; Schneider, Thomas (2017):
More Efficient Universal Circuit Constructions.
In: 23. Advances in Cryptology -- ASIACRYPT 2017, Springer, S. 443-470, DOI: 10.1007/978-3-319-70697-9_16,
[Online-Edition: https://encrypto.de/papers/GKS17.pdf],
[Conference item]

Kiss, Ágnes ; Liu, Jian ; Schneider, Thomas ; Asokan, N. ; Pinkas, Benny (2017):
Private Set Intersection for Unequal Set Sizes with Mobile Applications.
In: Proceedings on Privacy Enhancing Technologies (PoPETs), 2017 (4), De Gruyter Open, S. 177-197, DOI: 10.1515/popets-2017-0044,
[Online-Edition: https://encrypto.de/papers/KLSAP17.pdf],


Kiss, Ágnes ; Schneider, Thomas (2016):
Valiant's Universal Circuit is Practical.
In: 35. Advances in Cryptology -- EUROCRYPT 2016, Springer, S. 699-728, DOI: 10.1007/978-3-662-49890-3_27,
[Online-Edition: https://encrypto.de/papers/KS16.pdf],
[Conference item]

Rauzy, Pablo ; Kiss, Ágnes ; Krämer, Juliane ; 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), Springer, S. 111-129, DOI: 10.1007/978-3-319-43283-0_7,
[Conference item]


Krämer, Juliane ; Kiss, Ágnes ; 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), Springer, S. 181-196, DOI: 10.1007/978-3-319-32859-1_15,
[Conference item]


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


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 Wed Apr 8 05:59:57 2020 CEST.