Nikolaos Makriyannis

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers8 papers

Sort

By YearBy Citation

On the Round Complexity of Randomized Byzantine Agreement

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

DISC, (2019)

EIBibtex

On the Round Complexity of Randomized Byzantine Agreement

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

IACR Cryptology ePrint Archive, (2019): 868

EIBibtex

Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling

Amos Beimel,Iftach Haitner,Nikolaos Makriyannis,Eran Omri

2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp.838.0-849, (2018)

Cited by10EIBibtex

On the Complexity of Fair Coin Flipping

Iftach Haitner,Nikolaos Makriyannis,Eran Omri

Electronic Colloquium on Computational Complexity (ECCC), (2018)

Cited by4EIBibtex

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

Vanesa Daza,Nikolaos Makriyannis

IACR Cryptology ePrint Archive, (2017)

Cited by3EIBibtex

Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling

Amos Beimel,Iftach Haitner,Nikolaos Makriyannis,Eran Omri

Electronic Colloquium on Computational Complexity (ECCC), (2017): 168

EIBibtex

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

Gilad Asharov,Amos Beimel,Nikolaos Makriyannis,Eran Omri

TCC, (2015): 199-228

Cited by29EIBibtex

MOOC attack: closing the gap between pre-university and university mathematics

V Vladimir Daza,Nikolaos Makriyannis,Carme Rovira Riera

(2014)

Cited by3Bibtex

View All

Base Info Papers Patents Projects

Nikolaos MakriyannisBinding

Papers8 papers

Nikolaos Makriyannis