Follow
Nikolaos Makriyannis
Nikolaos Makriyannis
Verified email at cs.technion.ac.il
Title
Cited by
Cited by
Year
UC non-interactive, proactive, threshold ECDSA
R Canetti, N Makriyannis, U Peled
Cryptology ePrint Archive, Report 492, 2020, 2020
192*2020
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
572015
Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
A Beimel, I Haitner, N Makriyannis, E Omri
SIAM Journal on Computing 51 (4), 1126-1171, 2022
292022
On the classification of finite boolean functions up to fairness
N Makriyannis
Security and Cryptography for Networks: 9th International Conference, SCN …, 2014
272014
On the round complexity of randomized byzantine agreement
R Cohen, I Haitner, N Makriyannis, M Orland, A Samorodnitsky
Journal of Cryptology 35 (2), 10, 2022
232022
On the complexity of fair coin flipping
I Haitner, N Makriyannis, E Omri
Theory of Cryptography: 16th International Conference, TCC 2018, Panaji …, 2018
192018
Efficient asymmetric threshold ecdsa for mpc-based cold storage
C Blokh, N Makriyannis, U Peled
Cryptology ePrint Archive, 2022
132022
On fully secure MPC with solitary output
S Halevi, Y Ishai, E Kushilevitz, N Makriyannis, T Rabin
Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg …, 2019
112019
Practical key-extraction attacks in leading MPC wallets
N Makriyannis, O Yomtov, A Galansky
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and …, 2024
92024
Designing fully secure protocols for secure two-party computation of constant-domain functions
V Daza, N Makriyannis
Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017
92017
Highly efficient ot-based multiplication protocols
I Haitner, N Makriyannis, S Ranellucci, E Tsfadia
Annual International Conference on the Theory and Applications of …, 2022
82022
On the classic protocol for MPC schnorr signatures
N Makriyannis
Cryptology ePrint Archive, 2022
82022
Some constructions of maximal witness codes
N Makriyannis, B Meyer
2011 IEEE International Symposium on Information Theory Proceedings, 2105-2109, 2011
42011
System and method for processing boolean and garbled circuits in memory-limited environments
U Peled, N Makriyannis, I Ofrat, P Berengoltz
US Patent 12,067,902, 2024
32024
A note on the security of gg18
N Makriyannis, U Peled
22021
Fairness in two-party computation: characterizing fair functions
N Makriyannis
Universitat Pompeu Fabra, 2016
22016
Integer Commitments, Old and New Tools
I Haitner, Y Lindell, N Makriyannis
Cryptology ePrint Archive, 2025
12025
System and method for processing boolean and garbled circuits in memory-limited environments
U Peled, N Makriyannis, I Ofrat, P Berengoltz
US Patent App. 18/768,864, 2024
2024
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
G Asharov, A Beimel, N Makriyannis, E Omri
SIAM Journal on Computing 53 (5), 1381-1408, 2024
2024
UC Non-Interactive, Proactive, Distributed ECDSA with Identifiable Aborts
R Canetti, R Gennaro, S Goldfeder, N Makriyannis, U Peled
2024
The system can't perform the operation now. Try again later.
Articles 1–20