Pierre Civit

According to our database, Pierre Civit authored at least 18 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

DARE to agree: Byzantine Agreement with Optimal Resilience and Adaptive Communication.

Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira

IACR Cryptol. ePrint Arch., 2024

Error-Free Near-Optimal Validated Agreement.

Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi

CoRR, 2024

Partial synchrony for free? New bounds for Byzantine agreement via a generic transformation across network models.

Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi

CoRR, 2024

2023

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Pierre Civit, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic

J. Parallel Distributed Comput., November, 2023

All Byzantine Agreement Problems are Expensive.

Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Anton Paramonov, Manuel Vidigueira

CoRR, 2023

Strong Byzantine Agreement with Adaptive Word Complexity.

Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira

CoRR, 2023

Every Bit Counts in Consensus.

Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Matteo Monti, Manuel Vidigueira

Proceedings of the 37th International Symposium on Distributed Computing, 2023

On the Validity of Consensus.

Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022

Composable Dynamic Secure Emulation.

Pierre Civit, Maria Potop-Butucaru

IACR Cryptol. ePrint Arch., 2022

Crime and Punishment in Distributed Byzantine Decision Tasks.

Pierre Civit, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, Zarko Milosevic, Adi Seredinschi

IACR Cryptol. ePrint Arch., 2022

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version].

Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira

CoRR, 2022

Dynamic Probabilistic Input Output Automata.

Pierre Civit, Maria Potop-Butucaru

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!

Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Brief Announcement: Composable Dynamic Secure Emulation.

Pierre Civit, Maria Potop-Butucaru

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Brief Announcement: Probabilistic Dynamic Input/Output Automata.

Pierre Civit, Maria Potop-Butucaru

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Probabilistic Dynamic Input Output Automata.

Pierre Civit, Maria Potop-Butucaru

IACR Cryptol. ePrint Arch., 2021

2020

Brief Announcement: Polygraph: Accountable Byzantine Agreement.

Pierre Civit, Seth Gilbert, Vincent Gramoli

Proceedings of the 34th International Symposium on Distributed Computing, 2020

2019

Polygraph: Accountable Byzantine Agreement.

Pierre Civit, Seth Gilbert, Vincent Gramoli

IACR Cryptol. ePrint Arch., 2019