Nikolaos Makriyannis

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Complete characterization of fairness in secure two-party computation of Boolean functions SIAM Journal on Computing	2024-10-21	Paper
On the round complexity of randomized Byzantine agreement	2023-02-03	Paper
Highly efficient OT-based multiplication protocols	2022-08-30	Paper
Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling SIAM Journal on Computing	2022-08-12	Paper
On the complexity of fair coin flipping Theoretical Computer Science	2022-04-19	Paper
On the round complexity of randomized Byzantine agreement Journal of Cryptology	2022-04-04	Paper
On the round complexity of randomized Byzantine agreement Journal of Cryptology	2022-04-04	Paper
On fully secure MPC with solitary output	2020-04-30	Paper
On the complexity of fair coin flipping Theory of Cryptography	2018-12-11	Paper
Designing fully secure protocols for secure two-party computation of constant-domain functions	2018-01-19	Paper
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions Theory of Cryptography	2015-07-06	Paper
On the classification of finite Boolean functions up to fairness Lecture Notes in Computer Science	2014-10-14	Paper

Research outcomes over time

This page was built for person: Nikolaos Makriyannis