Nikolaos Makriyannis

Orcid: 0000-0002-9818-456X

According to our database1, Nikolaos Makriyannis authored at least 17 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.
SIAM J. Comput., 2024

2023
Practical Key-Extraction Attacks in Leading MPC Wallets.
IACR Cryptol. ePrint Arch., 2023

2022
On the complexity of fair coin flipping.
Theor. Comput. Sci., 2022

Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
SIAM J. Comput., 2022

On the Round Complexity of Randomized Byzantine Agreement.
J. Cryptol., 2022

On the Classic Protocol for MPC Schnorr Signatures.
IACR Cryptol. ePrint Arch., 2022

Efficient Asymmetric Threshold ECDSA for MPC-based Cold Storage.
IACR Cryptol. ePrint Arch., 2022

2021
Highly Efficient OT-Based Multiplication Protocols.
IACR Cryptol. ePrint Arch., 2021

UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts.
IACR Cryptol. ePrint Arch., 2021

2020
UC Non-Interactive, Proactive, Threshold ECDSA.
IACR Cryptol. ePrint Arch., 2020

2019
On Fully Secure MPC with Solitary Output.
IACR Cryptol. ePrint Arch., 2019

2018
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
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.
IACR Cryptol. ePrint Arch., 2017

Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.
Electron. Colloquium Comput. Complex., 2017

2016
Fairness in two-party computation : characterizing fair functions.
PhD thesis, 2016

2014
On the Classification of Finite Boolean Functions up to Fairness.
IACR Cryptol. ePrint Arch., 2014

2011
Some constructions of maximal witness codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011


  Loading...