Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions

Blum, Erica; Katz, Jonathan; Loss, Julian

doi:10.1007/978-3-030-92075-3_19

Cited by 14 publications

(7 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The parties in Z c may send echo messages for m ′ , where m ′ = m. Similarly, the parties in Z c may send ready messages for m ′ , where m ′ = m. However, since Z c ∈ Z, and since P \ Z c = H ∈ Z, no honest party ever generates a ready message for m ′ , neither in step 3, nor in step 4. 10 This also proves the liveness property.…”

Section: A1 Asynchronous Reliable Broadcast With Weak Synchronous Gua...supporting

confidence: 53%

“…The works of [9] and [11,17] show that the condition 2t s + t a < n is necessary and sufficient for best-of-both-worlds cryptographically-secure BA and MPC respectively, tolerating computationally bounded adversaries. Using the same condition, [10] presents a best-of-bothworlds cryptographically-secure atomic broadcast protocol. The work of [28] studies Byzantine fault tolerance and state machine replication protocols for multiple thresholds, including t s and t a .…”

Section: Other Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees

Appan

Chandramouli

Choudhury

2022

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

In this work, we study perfectly-secure multi-party computation (MPC) against general (non-threshold) adversaries. Known protocols in a synchronous network are secure against Q (3) adversary structures, while in an asynchronous network, known protocols are secure against Q (4) adversary structures. A natural question is whether there exists a single protocol which remains secure against Q (3) and Q (4) adversary structures in a synchronous and in an asynchronous network respectively, where the parties are not aware of the network type. We design the first such best-of-both-worlds protocol against general adversaries. Our result generalizes the result of Appan, Chandramouli and Choudhury (PODC 2022), which presents a best-of-both-worlds perfectly-secure protocol against threshold adversaries. To design our protocol, we present two important building blocks which are of independent interest. The first building block is a best-of-bothworlds perfectly-secure Byzantine agreement (BA) protocol for Q (3) adversary structures, which remains secure both in a synchronous, as well as an asynchronous network. The second building block is a best-of-bothworlds perfectly-secure verifiable secret-sharing (VSS) protocol, which remains secure against Q (3) and Q (4) adversary structures in a synchronous network and an asynchronous network respectively.

show abstract

Section: A1 Asynchronous Reliable Broadcast With Weak Synchronous Gua...supporting

confidence: 53%

Section: Other Related Workmentioning

confidence: 99%

Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees

Appan

Chandramouli

Choudhury

2022

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Network-Agnostic Protocols: A Blueprint. To design an efficient networkagnostic DKG protocol, a natural approach is to follow the template of previous works [BKL19,BLL20,BKL21]. Here, the protocol is divided into two components, a synchronous component Π s and an asynchronous component Π a .…”

Section: Background and Starting Pointmentioning

confidence: 99%

“…We answer these questions in the affirmative. Our contributions are motivated by a series of recent works on network-agnostic protocols for various types of consensus [BKL19,BKL21] and multi-party computation [BLL20,ABKL22a,ACC22a] (MPC). Existing protocols, however, strongly rely on trusted setup, particularly in the form of threshold cryptosystems [BLL20,DHLZ21].…”

mentioning

confidence: 99%

Network-Agnostic Security Comes (Almost) for Free in DKG and MPC

Bacho

Collins

Liu-Zhang

et al. 2023

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

“…Orthogonally, protocols in [1], [45], [46], [47] achieve the respective optimal safety and liveness resiliences under different network conditions (synchrony, asynchrony), but without allowing clients flexibility to choose resilience pairs. Flexible protocols: FBFT [14] allows clients to not only choose resilience pairs, but also choose different network assumptions (synchronous or partially synchronous).…”

Section: Related Workmentioning

confidence: 99%

Longest Chain Consensus Under Bandwidth Constraint

Neu

Sridhar

Yang

et al. 2022

Proceedings of the 4th ACM Conference on Advances in Financial Technologies

View full text Add to dashboard Cite

Classic BFT consensus protocols guarantee safety and liveness for all clients if fewer than one-third of replicas are faulty. However, in applications such as high-value payments, some clients may want to prioritize safety over liveness. Flexible consensus allows each client to opt for a higher safety resilience, albeit at the expense of reduced liveness resilience. We present the first construction that allows optimal safety-liveness tradeoff for every client simultaneously. This construction is modular and is realized as an add-on applied on top of an existing consensus protocol. The add-on consists of an additional round of voting and permanent locking done by the replicas, to sidestep a sub-optimal quorum-intersection-based constraint present in previous solutions. We adapt our construction to the existing Ethereum protocol to derive optimal flexible confirmation rules that clients can adopt unilaterally without requiring systemwide changes. This is possible because existing Ethereum protocol features can double as the extra voting and locking. We demonstrate an implementation using Ethereum's consensus API.

show abstract

Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions

Cited by 14 publications

References 27 publications

Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees

Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees

Network-Agnostic Security Comes (Almost) for Free in DKG and MPC

Longest Chain Consensus Under Bandwidth Constraint

Contact Info

Product

Resources

About