 Byzantine Agreement in Polynomial Time with Near-Optimal ResilienceSymposium on the Theory of Computing (STOC), 2022 |
 From Fairness to Full Security in Multiparty ComputationJournal of Cryptology (J. Cryptol.), 2018 |
 Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak
Martingales and Differentially Private SamplingIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2018 |
 Characterization of Secure Multiparty Computation Without BroadcastJournal of Cryptology (J. Cryptol.), 2016 |
 A Tight Lower Bound on Adaptively Secure Full-Information Coin FlipIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020 |
