Rapidchain: Scaling blockchain via full sharding

M Zamani, M Movahedi, M Raykova - Proceedings of the 2018 ACM …, 2018 - dl.acm.org
A major approach to overcoming the performance and scalability limitations of current
blockchain protocols is to use sharding which is to split the overheads of processing …

Sok: Sharding on blockchain

G Wang, ZJ Shi, M Nixon, S Han - … of the 1st ACM Conference on …, 2019 - dl.acm.org
Blockchain is a distributed and decentralized ledger for recording transactions. It is
maintained and shared among the participating nodes by utilizing cryptographic primitives …

Communication complexity of byzantine agreement, revisited

I Abraham, THH Chan, D Dolev, K Nayak… - Proceedings of the …, 2019 - dl.acm.org
As Byzantine Agreement (BA) protocols find application in large-scale decentralized
cryptocurrencies, an increasingly important problem is to design BA protocols with improved …

[PDF][PDF] The blockchain consensus layer and BFT

I Abraham, D Malkhi - Bulletin of EATCS, 2017 - eatcs.org
In this paper, we analyze Blockchain consensus protocols in the lens of the foundations of
distributed computing. Our goal is to present analogies and connections between …

Scalable byzantine reliable broadcast (extended version)

R Guerraoui, P Kuznetsov, M Monti, M Pavlovic… - arXiv preprint arXiv …, 2019 - arxiv.org
Byzantine reliable broadcast is a powerful primitive that allows a set of processes to agree
on a message from a designated sender, even if some processes (including the sender) are …

Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary

V King, J Saia - Journal of the ACM (JACM), 2011 - dl.acm.org
We describe an algorithm for Byzantine agreement that is scalable in the sense that each
processor sends only Õ (√ n) bits, where n is the total number of processors. Our algorithm …

Asynchronous byzantine agreement with subquadratic communication

E Blum, J Katz, CD Liu-Zhang, J Loss - … , NC, USA, November 16–19, 2020 …, 2020 - Springer
Understanding the communication complexity of Byzantine agreement (BA) is a fundamental
problem in distributed computing. In particular, for protocols involving a large number of …

[PDF][PDF] Optimal load-balanced scalable distributed agreement

Y Gelles, I Komargodski - Proceedings of the 56th Annual ACM …, 2024 - dl.acm.org
We consider the fundamental problem of designing classical consensus-related distributed
abstractions for large-scale networks, where the number of parties can be huge. Specifically …

Communication lower bounds for cryptographic broadcast protocols

E Blum, E Boyle, R Cohen, CD Liu-Zhang - Distributed Computing, 2025 - Springer
Broadcast protocols enable a set of n parties to agree on the input of a designated sender,
even facing attacks by malicious parties. In the honest-majority setting, randomization and …

Towards secure and scalable computation in peer-to-peer networks

V King, J Saia, V Sanwalani… - 2006 47th Annual IEEE …, 2006 - ieeexplore.ieee.org
We consider the problems of Byzantine agreement and leader election, where a constant
fraction b< 1/3 of processors are controlled by a malicious adversary. The first problem …