 All Byzantine Agreement Problems are ExpensiveACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Communication Lower Bounds for Cryptographic Broadcast ProtocolsInternational Symposium on Distributed Computing (DISC), 2023 |
 Dynamic Probabilistic Reliable BroadcastInternational Conference on Principles of Distributed Systems (OPODIS), 2023 |
 On the Validity of ConsensusACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Distributed Randomness from Approximate AgreementInternational Symposium on Distributed Computing (DISC), 2022 |
 Optimal Clock Synchronization with SignaturesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Make Every Word Count: Adaptive BA with Fewer WordsInternational Conference on Principles of Distributed Systems (OPODIS), 2022 |
 On Payment Channels in Asynchronous Money Transfer SystemsInternational Symposium on Distributed Computing (DISC), 2022 |
 Byzantine Agreement with Less Communication: Recent AdvancesSigact News (SIGACT), 2021 |
 Efficient Asynchronous Byzantine Agreement without Private SetupsIEEE International Conference on Distributed Computing Systems (ICDCS), 2021 |
 Expected Linear Round Synchronization: The Missing Link for Linear
Byzantine SMRInternational Symposium on Distributed Computing (DISC), 2020 |
 In Search for an Optimal Authenticated Byzantine AgreementInternational Symposium on Distributed Computing (DISC), 2020 |
