TU Darmstadt / ULB / TUbiblio

Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: No Grouping | Item Type | Date | Language
Number of items: 19.

Kiss, Ágnes (2021):
Efficient Private Function Evaluation. (Publisher's Version)
Darmstadt, Technische Universität Darmstadt,
DOI: 10.26083/tuprints-00017496,
[Ph.D. Thesis]

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.
8th International Workshop on Security in Blockchain and Cloud Computing (SBC'20), Taipei, Taiwan, June 1-5, 2020, [Conference or Workshop Item]

Holz, Marco ; Kiss, Ágnes ; Rathee, Deevashwer ; 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 ; Schunter, Matthias ; Rajan, Anand ; Boemer, Fabian ; Kiss, Ágnes ; Treiber, Amos ; Weinert, Christian ; Schneider, Thomas ; Stapf, Emmanuel ; Sadeghi, Ahmad-Reza ; Demmler, Daniel ; Chen, Huili ; Hussain, Siam Umar ; Riazi, M. Sadegh ; Koushanfar, Farinaz ; Gupta, Saransh ; Rosing, Tajan Simunic ; Chaudhuri, Kamalika ; Nejatollahi, Hamid ; Dutt, Nikil ; Imani, Mohsen ; Laine, Kim ; Dubey, Anuj ; Aysu, Aydin ; Sadat Hosseini, Fateme ; Yang, Chengmo ; Wallace, Eric ; Norton, Pamela (2020):
Trustworthy AI Inference Systems: An Industry Research View.
In: Cryptography and Security, (Preprint), Version 1, arXiv, 2008.04449, [Report]

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

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, ACM CCS 2019, London, November 11-15, 2019, DOI: 10.1145/3319535.3363251,
[Conference or Workshop Item]

Felsen, Susanne ; Kiss, Ágnes ; Schneider, Thomas ; 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]

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,
[Article]

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), 2, De Gruyter Open, [Article]

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, [Conference or Workshop 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), pp. 3-22,
Springer, DOI: 10.1007/978-3-030-00434-7_1,
[Conference or Workshop Item]

Kiss, Ágnes ; Schick, Oliver ; 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]

Günther, Daniel ; Kiss, Ágnes ; 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 ; 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), (4), pp. 177-197. De Gruyter Open, DOI: 10.1515/popets-2017-0044,
[Article]

Kiss, Ágnes ; 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 ; 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), pp. 111-129,
Springer, DOI: 10.1007/978-3-319-43283-0_7,
[Conference or Workshop 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), pp. 181-196,
Springer, DOI: 10.1007/978-3-319-32859-1_15,
[Conference or Workshop 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 Tue Jun 6 01:14:32 2023 CEST.