Nikolaos Makriyannis
Nikolaos Makriyannis
Verifierad e-postadress på
Citeras av
Citeras av
MOOC attack: closing the gap between pre-university and university mathematics
V Daza, N Makriyannis, C Rovira Riera
Open Learning: The Journal of Open, Distance and e-Learning 28 (3), 227-238, 2013
Complete characterization of fairness in secure two-party computation of boolean functions
G Asharov, A Beimel, N Makriyannis, E Omri
Theory of Cryptography Conference, 199-228, 2015
On the classification of finite boolean functions up to fairness
N Makriyannis
International Conference on Security and Cryptography for Networks, 135-154, 2014
Tighter bounds on multi-party coin flipping via augmented weak martingales and differentially private sampling
A Beimel, I Haitner, N Makriyannis, E Omri
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
On the round complexity of randomized Byzantine agreement
R Cohen, I Haitner, N Makriyannis, M Orland, A Samorodnitsky
arXiv preprint arXiv:1907.11329, 2019
On the complexity of fair coin flipping
I Haitner, N Makriyannis, E Omri
Theory of Cryptography Conference, 539-562, 2018
Designing fully secure protocols for secure two-party computation of constant-domain functions
V Daza, N Makriyannis
Theory of Cryptography Conference, 581-611, 2017
Some constructions of maximal witness codes
N Makriyannis, B Meyer
2011 IEEE International Symposium on Information Theory Proceedings, 2105-2109, 2011
UC Non-Interactive, Proactive, Threshold ECDSA.
R Canetti, N Makriyannis, U Peled
IACR Cryptol. ePrint Arch. 2020, 492, 2020
On fully secure MPC with solitary output
S Halevi, Y Ishai, E Kushilevitz, N Makriyannis, T Rabin
Theory of Cryptography Conference, 312-340, 2019
On the Fairness of Finite Boolean Functions
N Makriyannis
RECSI, 2012
Fairness in two-party computation: characterizing fair functions
N Makriyannis
Universitat Pompeu Fabra, 2016
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–12