arXiv (All)
open access
Scalable Composition of Byzantine Agreements under Reorder Attacks
Byzantine agreement (BA) is a foundational building block in distributed systems, and the security analysis of BA protocols under multi-instance executions has attracted increasing attention. However, most existing adversary models focus solely on party corruption and neglect important threats posed
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Decoupling Trust in Byzantine CRDTs: Fine-grained Post-Compromise Handling without Breaking Causality#324861
- Optimal Adaptive Multi-Valued Byzantine Agreement#463198
- Settling The Round Complexity of Byzantine Agreement Against a Full-Information, Adaptive Adversary#373364
- Communication Efficient Byzantine Agreement with Predictions#180632
- Security-Induced Braess Paradoxes in Service Function Chain Orchestration#282721
Record · ID 987959
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive