On the Optimality of Differential Fault Analyses on CLEFIA. - Juliane Krämer; Anke Stüber; Ágnes Kiss (IACR Cryptol. ePrint Arch., 2014)

Valiant's Universal Circuit is Practical. - Ágnes Kiss; Thomas Schneider 003 (IACR Cryptol. ePrint Arch., 2016)

Algorithmic Countermeasures Against Fault Attacks and Power Analysis for RSA-CRT. - Ágnes Kiss; Juliane Krämer; Pablo Rauzy; Jean-Pierre Seifert (IACR Cryptol. ePrint Arch., 2016)

More Efficient Universal Circuit Constructions. - Daniel Günther 004; Ágnes Kiss; Thomas Schneider 003 (IACR Cryptol. ePrint Arch., 2017)

Private Set Intersection for Unequal Set Sizes with Mobile Applications. - Ágnes Kiss; Jian Liu 012; Thomas Schneider 003; N. Asokan; Benny Pinkas (Proc. Priv. Enhancing Technol., 2017)

Faster Privacy-Preserving Location Proximity Schemes. - Kimmo Järvinen 001; Ágnes Kiss; Thomas Schneider 003; Oleksandr Tkachenko; Zheng Yang 001 (IACR Cryptol. ePrint Arch., 2018)

Poster: Framework for Semi-Private Function Evaluation with Application to Secure Insurance Rate Calculation. - Daniel Günther 004; Ágnes Kiss; Lukas Scheidel; Thomas Schneider 003 (CCS, 2019)

Secure and Private Function Evaluation with Intel SGX. - Susanne Felsen; Ágnes Kiss; Thomas Schneider 003; Christian Weinert (CCSW, 2019)

Web Application for Privacy-preserving Scheduling using Secure Computation. - Ágnes Kiss; Oliver Schick; Thomas Schneider 003 (ICETE (2), 2019)

SoK: Modular and Efficient Private Decision Tree Evaluation. - Ágnes Kiss; Masoud Naderpour; Jian Liu 012; N. Asokan; Thomas Schneider 003 (Proc. Priv. Enhancing Technol., 2019)

Trustworthy AI Inference Systems: An Industry Research View. - Rosario Cammarota; Matthias Schunter; Anand Rajan; Fabian Boemer; Ágnes Kiss; Amos Treiber; Christian Weinert; Thomas Schneider 003; Emmanuel Stapf; Ahmad-Reza Sadeghi; Daniel Demmler; Huili Chen; et al. (CoRR, 2020)

SAFE: A Secure and Efficient Long-Term Distributed Storage System. - Johannes Buchmann 001; Ghada Dessouky; Tommaso Frassetto; Ágnes Kiss; Ahmad-Reza Sadeghi; Thomas Schneider 003; Giulia Traverso; Shaza Zeitouni (IACR Cryptol. ePrint Arch., 2020)

Linear-Complexity Private Function Evaluation is Practical. - Marco Holz; Ágnes Kiss; Deevashwer Rathee; Thomas Schneider 003 (IACR Cryptol. ePrint Arch., 2020)

Faster privacy-preserving location proximity schemes for circles and polygons. - Kimmo Järvinen 001; Ágnes Kiss; Thomas Schneider 003; Oleksandr Tkachenko; Zheng Yang 001 (IET Inf. Secur., 2020)

Efficient and Scalable Universal Circuits. - Masaud Y. Alhassan; Daniel Günther 004; Ágnes Kiss; Thomas Schneider 003 (J. Cryptol., 2020)

Efficient Private Function Evaluation. - Ágnes Kiss (2021)

Bilingual Problems: Studying the Security Risks Incurred by Native Extensions in Scripting Languages. - Cristian-Alexandru Staicu; Sazzadur Rahaman; Ágnes Kiss; Michael Backes 001 (USENIX Security Symposium, 2023)