Folgen
Eleftheria Makri
Eleftheria Makri
Assistant Professor at LIACS, Leiden University, The Netherlands; Free Researcher KU Leuven, Belgium
Bestätigte E-Mail-Adresse bei liacs.leidenuniv.nl - Startseite
Titel
Zitiert von
Zitiert von
Jahr
EPIC: efficient private image classification (or: Learning from the masters)
E Makri, D Rotaru, NP Smart, F Vercauteren
Topics in Cryptology–CT-RSA 2019: The Cryptographers' Track at the RSA …, 2019
84*2019
: Efficient Comparison for Secure Multi-Party Computation
E Makri, D Rotaru, F Vercauteren, S Wagh
International Conference on Financial Cryptography and Data Security, 249-270, 2021
672021
Towards practical privacy-preserving genome-wide association study
C Bonte, E Makri, A Ardeshirdavani, J Simm, Y Moreau, F Vercauteren
BMC bioinformatics 19, 1-12, 2018
63*2018
Constant round group key agreement protocols: A comparative study
E Makri, E Konstantinou
computers & security 30 (8), 643-678, 2011
242011
The return of eratosthenes: Secure generation of RSA moduli using distributed sieving
C Delpech de Saint Guilhem, E Makri, D Rotaru, T Tanguy
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021
122021
Privacy-friendly wi-fi-based occupancy estimation with minimal resources
E Makri, J ten Brinke, R Evers, P Man, H Olthof
International Journal of Ambient Computing and Intelligence (IJACI) 9 (4), 34-51, 2018
72018
Full-threshold actively-secure multiparty arithmetic circuit garbling
E Makri, T Wood
Progress in Cryptology–LATINCRYPT 2021: 7th International Conference on …, 2021
52021
Privacy-preserving verification of clinical research
E Makri, MH Everts, SD Hoogh, A Peter, HOD Akker, P Hartel, W Jonker
Sicherheit 2014–Sicherheit, Schutz und Zuverlässigkeit, 481-500, 2014
22014
Secure and Efficient Computing on Private Data
E Makri
2021
The return of Eratosthenes: Secure Generation of RSA Moduli using Distributed Sieving
CDS Guilhem, E Makri, D Rotaru, T Tanguy
ASSOC COMPUTING MACHINERY, 2021
2021
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–10