Nikolaos Makriyannis

39 papers A* 4A 1B 1Misc 1Journal 26Unranked 5
YearRankTypeTitle / Venue / Authors
2025 A* conf
From OT to OLE with Subquadratic Communication.
CCS
Jack Doerner, Iftach Haitner, Yuval Ishai, Nikolaos Makriyannis
2025 J jnl
From OT to OLE with Subquadratic Communication.
IACR Cryptol. ePrint Arch.
Jack Doerner, Iftach Haitner, Yuval Ishai, Nikolaos Makriyannis
2025 J jnl
Integer Commitments, Old and New Tools.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Yehuda Lindell, Nikolaos Makriyannis
2025 J jnl
Stateless 2PC Signatures for Internet-Scale Authentication and Authorization.
IACR Cryptol. ePrint Arch.
Michael Adjedj, Geoffroy Couteau, Arik Galansky, Nikolaos Makriyannis, Oren Yomtov
2025 J jnl
Tight Bounds on Uniform-Challenge Black-Box Reductions from Sigma Protocols.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Nikolaos Makriyannis
2024 J jnl
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.
SIAM J. Comput.
Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
2024 A* conf
Practical Key-Extraction Attacks in Leading MPC Wallets.
CCS
Nikolaos Makriyannis, Oren Yomtov, Arik Galansky
2024 J jnl
Two-Round 2PC ECDSA at the Cost of 1 OLE.
IACR Cryptol. ePrint Arch.
Michael Adjedj, Constantin Blokh, Geoffroy Couteau, Antoine Joux, Nikolaos Makriyannis
2023 J jnl
Practical Key-Extraction Attacks in Leading MPC Wallets.
IACR Cryptol. ePrint Arch.
Nikolaos Makriyannis, Oren Yomtov
2022 J jnl
Efficient Asymmetric Threshold ECDSA for MPC-based Cold Storage.
IACR Cryptol. ePrint Arch.
Constantin Blokh, Nikolaos Makriyannis, Udi Peled
2022 — conf
Highly Efficient OT-Based Multiplication Protocols.
EUROCRYPT (1)
Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia
2022 J jnl
On the Classic Protocol for MPC Schnorr Signatures.
IACR Cryptol. ePrint Arch.
Nikolaos Makriyannis
2022 J jnl
On the Round Complexity of Randomized Byzantine Agreement.
J. Cryptol.
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
2022 J jnl
On the complexity of fair coin flipping.
Theor. Comput. Sci.
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2022 J jnl
Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
SIAM J. Comput.
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2021 J jnl
Highly Efficient OT-Based Multiplication Protocols.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia
2021 J jnl
On the Complexity of Fair Coin Flipping.
CoRR
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2021 J jnl
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
CoRR
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2021 J jnl
UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts.
IACR Cryptol. ePrint Arch.
Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, Udi Peled
2020 A* conf
UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts.
CCS
Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, Udi Peled
2020 J jnl
UC Non-Interactive, Proactive, Threshold ECDSA.
IACR Cryptol. ePrint Arch.
Ran Canetti, Nikolaos Makriyannis, Udi Peled
2019 — conf
On Fully Secure MPC with Solitary Output.
TCC (1)
Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Nikolaos Makriyannis, Tal Rabin
2019 J jnl
On Fully Secure MPC with Solitary Output.
IACR Cryptol. ePrint Arch.
Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Nikolaos Makriyannis, Tal Rabin
2019 A conf
On the Round Complexity of Randomized Byzantine Agreement.
DISC
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
2019 J jnl
On the Round Complexity of Randomized Byzantine Agreement.
CoRR
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
2019 J jnl
On the Round Complexity of Randomized Byzantine Agreement.
IACR Cryptol. ePrint Arch.
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
2018 — conf
On the Complexity of Fair Coin Flipping.
TCC (1)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2018 J jnl
On the Complexity of Fair Coin Flipping.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2018 J jnl
On the Complexity of Fair Coin Flipping.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2018 A* conf
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
FOCS
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2017 — conf
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions.
TCC (1)
Vanesa Daza, Nikolaos Makriyannis
2017 J jnl
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions.
IACR Cryptol. ePrint Arch.
Vanesa Daza, Nikolaos Makriyannis
2017 J jnl
Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.
Electron. Colloquium Comput. Complex.
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2016 — —
Fairness in two-party computation : characterizing fair functions.
Nikolaos Makriyannis
2015 — conf
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.
TCC (1)
Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
2014 J jnl
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
2014 Misc conf
On the Classification of Finite Boolean Functions up to Fairness.
SCN
Nikolaos Makriyannis
2014 J jnl
On the Classification of Finite Boolean Functions up to Fairness.
IACR Cryptol. ePrint Arch.
Nikolaos Makriyannis
2011 B conf
Some constructions of maximal witness codes.
ISIT
Nikolaos Makriyannis, Bertrand Meyer