Some constructions of maximal witness codes. - Nikolaos Makriyannis; Bertrand Meyer 002 (ISIT, 2011)

On the Classification of Finite Boolean Functions up to Fairness. - Nikolaos Makriyannis (IACR Cryptol. ePrint Arch., 2014)

Fairness in two-party computation : characterizing fair functions. - Nikolaos Makriyannis (2016)

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 (IACR Cryptol. ePrint Arch., 2017)

Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. - Amos Beimel; Iftach Haitner; Nikolaos Makriyannis; Eran Omri (FOCS, 2018)

On Fully Secure MPC with Solitary Output. - Shai Halevi; Yuval Ishai; Eyal Kushilevitz; Nikolaos Makriyannis; Tal Rabin (IACR Cryptol. ePrint Arch., 2019)

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 (IACR Cryptol. ePrint Arch., 2021)

Highly Efficient OT-Based Multiplication Protocols. - Iftach Haitner; Nikolaos Makriyannis; Samuel Ranellucci; Eliad Tsfadia (IACR Cryptol. ePrint Arch., 2021)

Efficient Asymmetric Threshold ECDSA for MPC-based Cold Storage. - Constantin Blokh; Nikolaos Makriyannis; Udi Peled (IACR Cryptol. ePrint Arch., 2022)

On the Classic Protocol for MPC Schnorr Signatures. - Nikolaos Makriyannis (IACR Cryptol. ePrint Arch., 2022)

On the Round Complexity of Randomized Byzantine Agreement. - Ran Cohen; Iftach Haitner; Nikolaos Makriyannis; Matan Orland; Alex Samorodnitsky (J. Cryptol., 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 complexity of fair coin flipping. - Iftach Haitner; Nikolaos Makriyannis; Eran Omri (Theor. Comput. Sci., 2022)

Practical Key-Extraction Attacks in Leading MPC Wallets. - Nikolaos Makriyannis; Oren Yomtov (IACR Cryptol. ePrint Arch., 2023)

Practical Key-Extraction Attacks in Leading MPC Wallets. - Nikolaos Makriyannis; Oren Yomtov; Arik Galansky (CCS, 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)

Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. - Gilad Asharov; Amos Beimel; Nikolaos Makriyannis; Eran Omri (SIAM J. Comput., 2024)

Stateless 2PC Signatures for Internet-Scale Authentication and Authorization. - Michael Adjedj; Geoffroy Couteau; Arik Galansky; Nikolaos Makriyannis; Oren Yomtov (IACR Cryptol. ePrint Arch., 2025)

Integer Commitments, Old and New Tools. - Iftach Haitner; Yehuda Lindell; Nikolaos Makriyannis (IACR Cryptol. ePrint Arch., 2025)