Pierre Civit

Orcid: 0000-0003-2394-1201

According to our database1, Pierre Civit authored at least 20 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Byzantine consensus is Θ (n<sup>2)</sup>: the Dolev-Reischuk bound is tight even in partial synchrony!
Distributed Comput., June, 2024

DARE to agree: Byzantine Agreement with Optimal Resilience and Adaptive Communication.
IACR Cryptol. ePrint Arch., 2024

Error-Free Near-Optimal Validated Agreement.
CoRR, 2024

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

Efficient Signature-Free Validated Agreement.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

All Byzantine Agreement Problems Are Expensive.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023
As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!
J. Parallel Distributed Comput., November, 2023

Strong Byzantine Agreement with Adaptive Word Complexity.
CoRR, 2023

Every Bit Counts in Consensus.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

On the Validity of Consensus.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022
Composable Dynamic Secure Emulation.
IACR Cryptol. ePrint Arch., 2022

Crime and Punishment in Distributed Byzantine Decision Tasks.
IACR Cryptol. ePrint Arch., 2022

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

Dynamic Probabilistic Input Output Automata.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Brief Announcement: Composable Dynamic Secure Emulation.
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.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Probabilistic Dynamic Input Output Automata.
IACR Cryptol. ePrint Arch., 2021

2020
Brief Announcement: Polygraph: Accountable Byzantine Agreement.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

2019
Polygraph: Accountable Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2019


  Loading...