Image de couverture de livre

Near-Optimal Communication Byzantine Reliable Broadcast under a Message Adversary

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Albouy, Timothé, Frey, Davide, Gelles, Ran, Hazay, Carmit, Raynal, Michel, Schiller, Elad Michael, Taïani, François, Zikas, Vassilis
Format:	Preprint
Publié:	2023
Sujets:	Distributed, Parallel, and Cluster Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Modular Approach to Construct Signature-Free BRB Algorithms under a Message Adversary
par: Albouy, Timothé, et autres
Publié: (2022)

Context Adaptive Cooperation
par: Albouy, Timothé, et autres
Publié: (2023)

Process-Commutative Distributed Objects: From Cryptocurrencies to Byzantine-Fault-Tolerant CRDTs
par: Frey, Davide, et autres
Publié: (2023)

Asynchronous BFT Asset Transfer: Quasi-Anonymous, Light, and Consensus-Free
par: Albouy, Timothé, et autres
Publié: (2024)

Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience
par: Hu, Michael Yiqing, et autres
Publié: (2026)

Partition Detection in Byzantine Networks
par: Bromberg, Yérom-David, et autres
Publié: (2024)

Ethical Risk Analysis of L2 Rollups
par: Ishmaev, Georgy, et autres
Publié: (2025)

Byzantine Reliable Broadcast with Low Communication and Time Complexity
par: Locher, Thomas
Publié: (2024)

Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer
par: Cohen, Shir, et autres
Publié: (2021)

The Task Completion Problem and its Application to Crash-Resilient Computation
par: Fischer, Orr, et autres
Publié: (2026)

Fast Byzantine Total Order Broadcast
par: Monti, Matteo, et autres
Publié: (2024)

BCM-Broadcast: A Byzantine-Tolerant Causal Broadcast Algorithm for Distributed Mobile Systems
par: NamvariTazehkand, Leila, et autres
Publié: (2024)

On the Decidability of Distributed Tasks with Output Sets under Asynchrony and Any Number of Crashes
par: Albouy, Timothé, et autres
Publié: (2026)

Tight Conditions for Binary-Output Tasks under Crashes
par: Albouy, Timothé, et autres
Publié: (2025)

Byzantine Consensus in Directed Graphs with Message Authentication
par: Vaidya, Nitin H., et autres
Publié: (2026)

Dynamic Probabilistic Reliable Broadcast
par: Anikina, Veronika, et autres
Publié: (2023)

AMECOS: A Modular Event-based Framework for Concurrent Object Specification
par: Albouy, Timothé, et autres
Publié: (2024)

OciorCOOL: Faster Byzantine Agreement and Reliable Broadcast
par: Chen, Jinyuan
Publié: (2024)

Chop Chop: Byzantine Atomic Broadcast to the Network Limit
par: Camaioni, Martina, et autres
Publié: (2023)

Broadcasting on Adversarial Multiple Access Channels
par: Aldawsari, Bader A., et autres
Publié: (2021)

Self-Stabilizing Replicated State Machine Coping with Byzantine and Recurring Transient Faults
par: Dolev, Shlomi, et autres
Publié: (2025)

Optimal Broadcast Schedules in Logarithmic Time with Applications to Broadcast, All-Broadcast, Reduction and All-Reduction
par: Träff, Jesper Larsson
Publié: (2024)

Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
par: Bonomi, Silvia, et autres
Publié: (2021)

Low-Cost Privacy-Preserving Decentralized Learning
par: Biswas, Sayan, et autres
Publié: (2024)

Optimistic, Signature-Free Reliable Broadcast and Its Applications
par: Shrestha, Nibesh, et autres
Publié: (2025)

On the Solvability of Byzantine-tolerant Reliable Communication in Dynamic Networks
par: Bonomi, Silvia, et autres
Publié: (2025)

Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries
par: El-Hayek, Antoine, et autres
Publié: (2023)

Sorting in One and Two Rounds using $t$-Comparators
par: Gelles, Ran, et autres
Publié: (2024)

Content-Oblivious Leader Election on Rings
par: Frei, Fabian, et autres
Publié: (2024)

Network-Offloaded Bandwidth-Optimal Broadcast and Allgather for Distributed AI
par: Khalilov, Mikhail, et autres
Publié: (2024)

From Few to Many Faults: Optimal Adaptive Byzantine Agreement
par: Constantinescu, Andrei, et autres
Publié: (2025)

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures
par: Schneider, Philipp
Publié: (2025)

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

Quantum Byzantine Agreement Against Full-information Adversary
par: Li, Longcheng, et autres
Publié: (2024)

Prioritized-MVBA: A New Approach to Design an Optimal Asynchronous Byzantine Agreement Protocol
par: Sony, Nasit S, et autres
Publié: (2024)

Improved Byzantine Agreement under an Adaptive Adversary
par: Dufoulon, Fabien, et autres
Publié: (2025)

Proximal Byzantine Consensus
par: Shadmon, Roy, et autres
Publié: (2024)

Byzantine Agreement with Predictions
par: Ben-David, Naama, et autres
Publié: (2025)

Byzantine Stable Matching
par: Constantinescu, Andrei, et autres
Publié: (2025)

Broadcast in Almost Mixing Time
par: Paramonov, Anton, et autres
Publié: (2025)