The following pages link to Nikolaos Makriyannis (Q1629432):
Displayed 9 items.
- Designing fully secure protocols for secure two-party computation of constant-domain functions (Q1690209) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Highly efficient OT-based multiplication protocols (Q2169999) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- On the Classification of Finite Boolean Functions up to Fairness (Q2922657) (← links)
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling (Q5096104) (← links)
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions (Q5261630) (← links)
- On the complexity of fair coin flipping (Q5915598) (← links)
- On the complexity of fair coin flipping (Q5918656) (← links)