| UC non-interactive, proactive, threshold ECDSA R Canetti, N Makriyannis, U Peled Cryptology ePrint Archive, Report 492, 2020, 2020 | 163* | 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 | 55 | 2015 |
| 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 | 29 | 2022 |
| On the classification of finite boolean functions up to fairness N Makriyannis Security and Cryptography for Networks: 9th International Conference, SCN …, 2014 | 25 | 2014 |
| 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 | 20 | 2022 |
| On the complexity of fair coin flipping I Haitner, N Makriyannis, E Omri Theory of Cryptography: 16th International Conference, TCC 2018, Panaji …, 2018 | 19 | 2018 |
| 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 | 10 | 2019 |
| 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 | 9 | 2017 |
| Practical key-extraction attacks in leading mpc wallets N Makriyannis, O Yomtov, A Galansky Cryptology ePrint Archive, 2023 | 8 | 2023 |
| Efficient asymmetric threshold ecdsa for mpc-based cold storage C Blokh, N Makriyannis, U Peled Cryptology ePrint Archive, 2022 | 8 | 2022 |
| Highly efficient ot-based multiplication protocols I Haitner, N Makriyannis, S Ranellucci, E Tsfadia Annual International Conference on the Theory and Applications of …, 2022 | 7 | 2022 |
| On the classic protocol for MPC schnorr signatures N Makriyannis Cryptology ePrint Archive, 2022 | 6 | 2022 |
| Some constructions of maximal witness codes N Makriyannis, B Meyer 2011 IEEE International Symposium on Information Theory Proceedings, 2105-2109, 2011 | 4 | 2011 |
| 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 | 2 | 2024 |
| Fairness in two-party computation: characterizing fair functions N Makriyannis Universitat Pompeu Fabra, 2016 | 2 | 2016 |
| A note on the security of gg18 N Makriyannis, U Peled | 2 | |
| 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 |
