\textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
From MaRDI portal
Publication:6157530
DOI10.1007/978-3-030-92075-3_19zbMATH Open1514.94047OpenAlexW3204209583MaRDI QIDQ6157530FDOQ6157530
Authors: Erica Blum, Jonathan Katz, Julian Loss 
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92075-3_19
Recommendations
Cites Work
- Asynchronous Multiparty Computation: Theory and Implementation
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Asynchronous secure computations with optimal resilience (extended abstract)
- The Bitcoin Backbone Protocol: Analysis and Applications
- Atomic broadcast: From simple message diffusion to Byzantine agreement
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Thunderella: blockchains with optimistic instant confirmation
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Synchronous consensus with optimal asynchronous fallback guarantees
- Synchronous, with a chance of partition tolerance
- MPC with synchronous security and asynchronous responsiveness
- Hybrid consensus: efficient consensus in the permissionless model
- Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages
- On the theoretical gap between synchronous and asynchronous MPC protocols
- On the Power of Hybrid Networks in Multi-Party Computation
Cited In (9)
- Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
- Network agnostic MPC with statistical security
- State machine replication under changing network conditions
- Quick order fairness
- Network-agnostic security comes (almost) for free in DKG and MPC
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Network-agnostic multi-party computation revisited (extended abstract)
- Formalizing delayed adaptive corruptions and the security of flooding networks
- Automata, Languages and Programming
This page was built for publication: \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157530)
