Ágnes Kiss
Ágnes Kiss
PhD Student, TU Darmstadt
Verifierad e-postadress på crisp-da.de
Titel
Citeras av
Citeras av
År
Private set intersection for unequal set sizes with mobile applications
Á Kiss, J Liu, T Schneider, N Asokan, B Pinkas
Proceedings on Privacy Enhancing Technologies 2017 (4), 177-197, 2017
532017
Valiant’s universal circuit is practical
Á Kiss, T Schneider
Annual International Conference on the Theory and Applications of …, 2016
502016
More efficient universal circuit constructions
D Günther, Á Kiss, T Schneider
International Conference on the Theory and Application of Cryptology and …, 2017
322017
Sok: modular and efficient private decision tree evaluation
Á Kiss, M Naderpour, J Liu, N Asokan, T Schneider
Proceedings on Privacy Enhancing Technologies 2019 (2), 187-208, 2019
192019
Efficient and Scalable Universal Circuits.
MY Alhassan, D Günther, Á Kiss, T Schneider
IACR Cryptology ePrint Archive 2019, 348, 2019
122019
Algorithmic countermeasures against fault attacks and power analysis for RSA-CRT
Á Kiss, J Krämer, P Rauzy, JP Seifert
International Workshop on Constructive Side-Channel Analysis and Secure …, 2016
122016
Faster privacy-preserving location proximity schemes
K Järvinen, Á Kiss, T Schneider, O Tkachenko, Z Yang
International Conference on Cryptology and Network Security, 3-22, 2018
92018
Secure and private function evaluation with intel sgx
S Felsen, Á Kiss, T Schneider, C Weinert
Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security …, 2019
72019
On the optimality of differential fault analyses on CLEFIA
Á Kiss, J Krämer, A Stüber
International Conference on Mathematical Aspects of Computer and Information …, 2015
72015
Linear-Complexity Private Function Evaluation is Practical
M Holz, Á Kiss, D Rathee, T Schneider
European Symposium on Research in Computer Security, 401-420, 2020
22020
Linear-complexity private function evaluation is practical (full version)
M Holz, Á Kiss, D Rathee, T Schneider
Cryptology ePrint Archive, Report 2020/853, 2020
12020
Faster privacy-preserving location proximity schemes for circles and polygons
K Järvinen, Á Kiss, T Schneider, O Tkachenko, Z Yang
IET Information Security 14 (3), 254-265, 2019
12019
SAFE: A Secure and Efficient Long-Term Distributed Storage System
J Buchmann, G Dessouky, T Frassetto, Á Kiss, AR Sadeghi, T Schneider, ...
Proceedings of the 8th International Workshop on Security in Blockchain and …, 2020
2020
Trustworthy AI Inference Systems: An Industry Research View
R Cammarota, M Schunter, A Rajan, F Boemer, Á Kiss, A Treiber, ...
arXiv preprint arXiv:2008.04449, 2020
2020
Poster: Framework for Semi-Private Function Evaluation with Application to Secure Insurance Rate Calculation
D Günther, Á Kiss, L Scheidel, T Schneider
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
2019
Web Application for Privacy-preserving Scheduling using Secure Computation.
Á Kiss, O Schick, T Schneider
ICETE (2), 456-463, 2019
2019
Testing Self-Secure Exponentiation Countermeasures Against the Bellcore Attack
Á Kiss, JP Seifert
2014
Experimenting Differential Fault Analyses on CLEFIA
A Kiss
20 th Crypto-Day, 2014
2014
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–18