Byzantine Consensus is\Theta (n^ 2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony![Extended Version] P Civit, MA Dzulfikar, S Gilbert, V Gramoli, R Guerraoui, J Komatovic, ...
arXiv preprint arXiv:2208.09262, 2022
22 2022 On the validity of consensus P Civit, S Gilbert, R Guerraoui, J Komatovic, M Vidigueira
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing …, 2023
9 2023 Chop chop: Byzantine atomic broadcast to the network limit M Camaioni, R Guerraoui, M Monti, PL Roman, M Vidigueira, G Voron
18th USENIX Symposium on Operating Systems Design and Implementation (OSDI …, 2024
6 2024 Every bit counts in consensus P Civit, S Gilbert, R Guerraoui, J Komatovic, M Monti, M Vidigueira
arXiv preprint arXiv:2306.00431, 2023
5 2023 All byzantine agreement problems are expensive P Civit, S Gilbert, R Guerraoui, J Komatovic, A Paramonov, M Vidigueira
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing …, 2024
3 2024 Strong Byzantine Agreement with Adaptive Word Complexity P Civit, S Gilbert, R Guerraoui, J Komatovic, M Vidigueira
arXiv preprint arXiv:2308.03524, 2023
3 2023 Oracular Byzantine Reliable Broadcast M Camaioni, R Guerraoui, M Monti, M Vidigueira
LIPIcs–Leibniz International Proceedings in Informatic, 2022
3 2022 DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication P Civit, MA Dzulfikar, S Gilbert, R Guerraoui, J Komatovic, M Vidigueira
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing …, 2024
2 2024 Byzantine consensus is P Civit, MA Dzulfikar, S Gilbert, V Gramoli, R Guerraoui, J Komatovic, ...
Distributed Computing 37 (2), 89-119, 2024
1 2024 Partial synchrony for free? New bounds for Byzantine agreement via a generic transformation across network models P Civit, MA Dzulfikar, S Gilbert, R Guerraoui, J Komatovic, M Vidigueira, ...
arXiv preprint arXiv:2402.10059, 2024
1 2024 Byzantine Consensus Is Theta (n2) P Civit, MA Dzulfikar, S Gilbert, V Gramoli, R Guerraoui, J Komatovic, ...
The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony, 2022
1 2022 Carbon: Scaling Trusted Payments with Untrusted Machines M Camaioni, R Guerraoui, J Komatovic, M Monti, PL Roman, M Vidigueira, ...
IEEE Transactions on Dependable and Secure Computing, 2024
2024 Byzantine consensus is P Civit, MA Dzulfikar, S Gilbert, V Gramoli, R Guerraoui, J Komatovic, ...
Distributed Computing 37 (2), 89-119, 2024
2024 Error-Free Near-Optimal Validated Agreement P Civit, MA Dzulfikar, S Gilbert, R Guerraoui, J Komatovic, M Vidigueira, ...
arXiv preprint arXiv:2403.08374, 2024
2024 Rapidly verifiable aggregate signatures M Camaioni, R Guerraoui, M Monti, PL Roman, M Vidigueira, G Voron
2024 37th International Symposium on Distributed Computing (DISC 2023) I Abraham, D Dolev, I Eyal, JY Halpern, K Altisen, P Corbineau, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2023
2023 Byzantine consensus is 2 (n2): the Dolev-Reischuk bound is tight even in partial synchrony! P Civit, MA Dzulfikar, S Gilbert, V Gramoli, R Guerraoui, J Komatovic, ...
2023 Oracular Byzantine Reliable Broadcast [Extended Version] M Camaioni, R Guerraoui, M Monti, M Vidigueira
arXiv preprint arXiv:2209.13304, 2022
2022 Carbon: An Asynchronous Voting-Based Payment System for a Client-Server Architecture M Camaioni, R Guerraoui, J Komatovic, M Monti, M Vidigueira
arXiv preprint arXiv:2209.09580, 2022
2022 Threshold Logical Clocks M Vidigueira
2019 