RCC: Resilient Concurrent Consensus for High-Throughput Secure Transaction Processing

Gupta, Suyash; Hellings, Johan; Sadoghi, Mohammad

doi:10.1109/icde51399.2021.00124

Cited by 48 publications

(33 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We use the ResilientDB fabric to implement all the consensus protocols [22,[25][26][27]46]. Prior works have illustrated that Re-silientDB eases the design and deployment of new consensus protocols and achieves high throughputs of the order of 150 k txn/s for even the Pbft protocol.…”

Section: Methodsmentioning

confidence: 99%

“…However, these trust-bft protocols enforce sequential consensus of client requests. In comparison, a majority of existing bft protocols employ several fundamental optimizations: pipelining consensus phases, concurrently ordering multiple client requests, and permitting out-of-order consensus [9,22,25,26]. These bft protocols only enforce request execution in order.…”

Section: Observationsmentioning

confidence: 99%

“…We design two variants of our FlexiTrust protocols: Flexi-BFT and Flexi-ZZ, and implement them on ResilientDB fabric [25,26,46]. To gauge their scalability, we test our FlexiTrust variants on a real-world setup of 97 replicas and up to 80 k clients, and compare them against five protocols: three trust-bft and two bft.…”

Section: Solutionsmentioning

confidence: 99%

“…bft consensus is an age-old problem, for which literature includes several exciting protocols [9,22,25,26,35,59]. The recent surge in interest in these bft protocols can be gauged from the fact that they lie at the core of blockchain technology, which aims to create a tamper-resistant ledger, which can be shared among multiple untrusting parties [29].…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Dissecting BFT Consensus: In Trusted Components we Trust!

Gupta¹,

Rahnama²,

Pandey³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

The growing interest in secure multi-party database applications has led to the widespread adoption of Byzantine Fault-Tolerant (bft) consensus protocols that can handle malicious attacks from byzantine replicas. Existing bft protocols permit byzantine replicas to equivocate their messages. As a result, they need f more replicas than Paxos-style protocols to prevent safety violations due to equivocation. This led to the design of trust-bft protocols, which require each replica to host an independent, trusted component.In this work, we analyze the design of existing trust-bft and make the following observations regarding these protocols: (i) they adopt weaker quorums, which prevents them from providing service in scenarios supported by their bft counterparts, (ii) they rely on the data persistence of trusted components at byzantine replicas, and (iii) they enforce sequential ordering of client requests.To resolve these challenges, we present solutions that facilitate the recovery of trust-bft protocols despite their weak quorums or data persistence dependence. Further, we present the design of lightweight, fast, and flexible protocols (FlexiTrust), which achieve up to 100% more throughput than their trust-bft counterparts.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Observationsmentioning

confidence: 99%

Section: Solutionsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Dissecting BFT Consensus: In Trusted Components we Trust!

Gupta¹,

Rahnama²,

Pandey³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…In either scenario, the performance of the system will be severely impacted. To reduce the latency of global communication, i.e., multiple rounds of cross-cluster message exchange, GeoBFT [30] [31] [32], replicates the entire ledger on every node and establishes consensus on each transaction within only a single cluster. Clusters, however, communicate with each other to multicast their locally-replicated transactions and enable other clusters to far from their initial local area.…”

Section: Introductionmentioning

confidence: 99%

Saguaro: Efficient Processing of Transactions in Wide Area Networks using a Hierarchical Permissioned Blockchain

Amiri¹,

Lai²,

Patel³

et al. 2021

Preprint

View full text Add to dashboard Cite

The next frontier for the Internet leading by innovations in mobile computing, in particular, 5G, together with blockchains' transparency, immutability, provenance, and authenticity, indicates the potentials of running a new generation of applications on the mobile internet. A 5G-enabled blockchain system is structured as a hierarchy and needs to deal with different challenges such as maintaining blockchain ledger at different spatial domains and various levels of the networks, efficient processing of cross-domain transactions, establishing consensus among heterogeneous nodes, and supporting delay-tolerant mobile transactions. In this paper, we present Saguaro, a hierarchical permissioned blockchain designed specifically for Internet-scale mobile networks. Saguaro benefits from the hierarchical structure of mobile network infrastructure to address the aforementioned challenges. Our extensive experimental results demonstrate the high potential of Saguaro being the first 5G-enabled permissioned blockchain system in the community.

show abstract

The Fault-Tolerant Cluster-Sending Problem

Hellings¹,

Sadoghi²

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

RCC: Resilient Concurrent Consensus for High-Throughput Secure Transaction Processing

Cited by 48 publications

References 30 publications

Dissecting BFT Consensus: In Trusted Components we Trust!

Dissecting BFT Consensus: In Trusted Components we Trust!

Saguaro: Efficient Processing of Transactions in Wide Area Networks using a Hierarchical Permissioned Blockchain

The Fault-Tolerant Cluster-Sending Problem

Contact Info

Product

Resources

About