Polygraph: Accountable byzantine agreement P Civit, S Gilbert, V Gramoli
2021 IEEE 41st International Conference on Distributed Computing Systems …, 2021
87 2021 As easy as ABC: Optimal (A) ccountable (B) yzantine (C) onsensus is easy! P Civit, S Gilbert, V Gramoli, R Guerraoui, J Komatovic
Journal of Parallel and Distributed Computing 181, 104743, 2023
25 2023 Crime and punishment in distributed byzantine decision tasks P Civit, S Gilbert, V Gramoli, R Guerraoui, J Komatovic, Z Milosevic, ...
2022 IEEE 42nd International Conference on Distributed Computing Systems …, 2022
18 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
17 2023 Brief announcement: Polygraph: Accountable byzantine agreement P Civit, S Gilbert, V Gramoli
34th International Symposium on Distributed Computing (DISC 2020), 2020
14 2020 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
8 2024 Polygraph: Accountable byzantine consensus P Civit, S Gilbert, V Gramoli
Workshop on Verification of Distributed Systems (VDS), 2019
7 2019 Every Bit Counts in Consensus P Civit, S Gilbert, R Guerraoui, J Komatovic, M Monti, M Vidigueira
arXiv preprint arXiv:2306.00431, 2023
6 2023 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
5 2024 Strong Byzantine Agreement with Adaptive Word Complexity P Civit, S Gilbert, R Guerraoui, J Komatovic, M Vidigueira
arXiv preprint arXiv:2308.03524, 2023
4 2023 Partial Synchrony for Free: New Upper Bounds for Byzantine Agreement P Civit, MA Dzulfikar, S Gilbert, R Guerraoui, J Komatovic, M Vidigueira, ...
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
3 2025 Byzantine consensus is P Civit, MA Dzulfikar, S Gilbert, V Gramoli, R Guerraoui, J Komatovic, ...
Distributed Computing 37 (2), 89-119, 2024
3 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
3 2024 Probabilistic Dynamic Input Output Automata. IACR Cryptol. ePrint Arch.(2021), 798 P Civit, M Potop-Butucaru
3 2021 Dynamic Probabilistic Input Output Automata P Civit, M Potop-Butucaru
2 2022 Composable Dynamic Secure Emulation. IACR Cryptol. ePrint Arch.(2022), 326 P Civit, M Potop-Butucaru
2 2022 Probabilistic dynamic input output automata (extended version) P Civit, M Potop-Butucaru
Cryptology ePrint Archive, 2021
2 2021 Efficient Signature-Free Validated Agreement P Civit, MA Dzulfikar, S Gilbert, R Guerraoui, J Komatovic, M Vidigueira, ...
38th International Symposium on Distributed Computing (DISC 2024), 14: 1-14: 23, 2024
1 2024 Brief announcement: Composable dynamic secure emulation P Civit, M Potop-Butucaru
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022
1 2022 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 