Подписаться
Pierre Civit
Pierre Civit
EPFL (École Polytechnique Fédérale de Lausanne)
Подтвержден адрес электронной почты в домене epfl.ch - Главная страница
Название
Процитировано
Процитировано
Год
Polygraph: Accountable byzantine agreement
P Civit, S Gilbert, V Gramoli
2021 IEEE 41st International Conference on Distributed Computing Systems …, 2021
802021
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
242022
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
232023
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
172022
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
152023
Brief announcement: Polygraph: Accountable byzantine agreement
P Civit, S Gilbert, V Gramoli
34th International Symposium on Distributed Computing (DISC 2020), 2020
132020
Polygraph: Accountable byzantine consensus
P Civit, S Gilbert, V Gramoli
Workshop on Verification of Distributed Systems (VDS), 2019
72019
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
62024
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
62024
Every Bit Counts in Consensus
P Civit, S Gilbert, R Guerraoui, J Komatovic, M Monti, M Vidigueira
arXiv preprint arXiv:2306.00431, 2023
62023
Strong Byzantine Agreement with Adaptive Word Complexity
P Civit, S Gilbert, R Guerraoui, J Komatovic, M Vidigueira
arXiv preprint arXiv:2308.03524, 2023
42023
Error-Free Near-Optimal Validated Agreement
P Civit, MA Dzulfikar, S Gilbert, R Guerraoui, J Komatovic, M Vidigueira, ...
arXiv preprint arXiv:2403.08374, 2024
32024
Probabilistic Dynamic Input Output Automata. IACR Cryptol. ePrint Arch.(2021), 798
P Civit, M Potop-Butucaru
32021
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
22025
Dynamic Probabilistic Input Output Automata
P Civit, M Potop-Butucaru
22022
Composable Dynamic Secure Emulation. IACR Cryptol. ePrint Arch.(2022), 326
P Civit, M Potop-Butucaru
22022
Probabilistic dynamic input output automata (extended version)
P Civit, M Potop-Butucaru
Cryptology ePrint Archive, 2021
22021
Byzantine consensus is : the Dolev-Reischuk bound is tight even in partial synchrony!
P Civit, MA Dzulfikar, S Gilbert, V Gramoli, R Guerraoui, J Komatovic, ...
Distributed Computing 37 (2), 89-119, 2024
12024
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
12024
Byzantine consensus is : the Dolev-Reischuk bound is tight even in partial synchrony!
P Civit, MA Dzulfikar, S Gilbert, V Gramoli, R Guerraoui, J Komatovic, ...
Distributed Computing, 1-31, 2023
12023
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20