Nikolaos Makriyannis

According to our database, Nikolaos Makriyannis authored at least 17 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Practical Key-Extraction Attacks in Leading MPC Wallets.

Nikolaos Makriyannis, Oren Yomtov

IACR Cryptol. ePrint Arch., 2023

2022

On the complexity of fair coin flipping.

Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Theor. Comput. Sci., 2022

Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.

Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri

SIAM J. Comput., 2022

On the Round Complexity of Randomized Byzantine Agreement.

Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky

J. Cryptol., 2022

On the Classic Protocol for MPC Schnorr Signatures.

Nikolaos Makriyannis

IACR Cryptol. ePrint Arch., 2022

Efficient Asymmetric Threshold ECDSA for MPC-based Cold Storage.

Constantin Blokh, Nikolaos Makriyannis, Udi Peled

IACR Cryptol. ePrint Arch., 2022

2021

Highly Efficient OT-Based Multiplication Protocols.

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia

IACR Cryptol. ePrint Arch., 2021

UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts.

Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, Udi Peled

IACR Cryptol. ePrint Arch., 2021

2020

UC Non-Interactive, Proactive, Threshold ECDSA.

Ran Canetti, Nikolaos Makriyannis, Udi Peled

IACR Cryptol. ePrint Arch., 2020

2019

On Fully Secure MPC with Solitary Output.

Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Nikolaos Makriyannis, Tal Rabin

IACR Cryptol. ePrint Arch., 2019

2018

Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.

Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions.

Vanesa Daza, Nikolaos Makriyannis

IACR Cryptol. ePrint Arch., 2017

Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.

Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Electron. Colloquium Comput. Complex., 2017

2016

Fairness in two-party computation : characterizing fair functions.

Nikolaos Makriyannis

PhD thesis, 2016

2014

On the Classification of Finite Boolean Functions up to Fairness.

Nikolaos Makriyannis

IACR Cryptol. ePrint Arch., 2014

Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.

Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri

IACR Cryptol. ePrint Arch., 2014

2011

Some constructions of maximal witness codes.

Nikolaos Makriyannis, Bertrand Meyer

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011