Nikolaos Makriyannis

According to our database, Nikolaos Makriyannis authored at least 23 papers between 2011 and 2025.

Collaborative distances:

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

2025

Tight Bounds on Uniform-Challenge Black-Box Reductions from Sigma Protocols.

Iftach Haitner, Nikolaos Makriyannis

IACR Cryptol. ePrint Arch., 2025

Integer Commitments, Old and New Tools.

Iftach Haitner, Yehuda Lindell, Nikolaos Makriyannis

IACR Cryptol. ePrint Arch., 2025

Stateless 2PC Signatures for Internet-Scale Authentication and Authorization.

Michael Adjedj, Geoffroy Couteau, Arik Galansky, Nikolaos Makriyannis, Oren Yomtov

IACR Cryptol. ePrint Arch., 2025

From OT to OLE with Subquadratic Communication.

Jack Doerner, Iftach Haitner, Yuval Ishai, Nikolaos Makriyannis

Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

2024

Two-Round 2PC ECDSA at the Cost of 1 OLE.

Michael Adjedj, Constantin Blokh, Geoffroy Couteau, Antoine Joux, Nikolaos Makriyannis

IACR Cryptol. ePrint Arch., 2024

Practical Key-Extraction Attacks in Leading MPC Wallets.

Nikolaos Makriyannis, Oren Yomtov, Arik Galansky

Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023

Practical Key-Extraction Attacks in Leading MPC Wallets.

Nikolaos Makriyannis, Oren Yomtov

IACR Cryptol. ePrint Arch., 2023

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 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

Highly Efficient OT-Based Multiplication Protocols.

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2020

UC Non-Interactive, Proactive, Threshold ECDSA.

Ran Canetti, Nikolaos Makriyannis, Udi Peled

IACR Cryptol. ePrint Arch., 2020

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

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

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019

On the Round Complexity of Randomized Byzantine Agreement.

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

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

On Fully Secure MPC with Solitary Output.

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

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

2018

On the Complexity of Fair Coin Flipping.

Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Proceedings of the Theory of Cryptography - 16th International Conference, 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

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

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

Vanesa Daza, Nikolaos Makriyannis

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

2016

Fairness in two-party computation : characterizing fair functions.

Nikolaos Makriyannis

PhD thesis, 2016

2015

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

Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

2014

On the Classification of Finite Boolean Functions up to Fairness.

Nikolaos Makriyannis

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

2011

Some constructions of maximal witness codes.

Nikolaos Makriyannis, Bertrand Meyer

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