Decentralized consensus for edge-centric internet of things: A review, taxonomy, and research issues

K Yeow, A Gani, RW Ahmad, JJPC Rodrigues… - IEEE Access, 2017 - ieeexplore.ieee.org
With the exponential rise in the number of devices, the Internet of Things (IoT) is geared
toward edge-centric computing to offer high bandwidth, low latency, and improved …

A secure sharding protocol for open blockchains

L Luu, V Narayanan, C Zheng, K Baweja… - Proceedings of the …, 2016 - dl.acm.org
Cryptocurrencies, such as Bitcoin and 250 similar alt-coins, embody at their core a
blockchain protocol---a mechanism for a distributed network of computational nodes to …

[PDF][PDF] Scp: A computationally-scalable byzantine consensus protocol for blockchains

L Luu, V Narayanan, K Baweja, C Zheng… - Cryptology ePrint …, 2015 - weusecoins.com
In this paper, we design a new blockchain Byzantine consensus protocol SCP where the
throughput scales nearly linearly with the computation: the more computing power available …

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 …

DARE to agree: Byzantine agreement with optimal resilience and adaptive communication

P Civit, MA Dzulfikar, S Gilbert, R Guerraoui… - Proceedings of the 43rd …, 2024 - dl.acm.org
Byzantine Agreement (BA) enables n processes to reach consensus on a common valid Lo-
bit value, even in the presence of up to t< n faulty processes that can deviate arbitrarily from …

[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 …

All byzantine agreement problems are expensive

P Civit, S Gilbert, R Guerraoui, J Komatovic… - Proceedings of the 43rd …, 2024 - dl.acm.org
Byzantine agreement, arguably the most fundamental problem in distributed computing,
operates among n processes, out of which t< n can exhibit arbitrary failures. The problem …

Large-scale secure computation: Multi-party computation for (parallel) RAM programs

E Boyle, KM Chung, R Pass - Annual Cryptology Conference, 2015 - Springer
We present the first efficient (ie, polylogarithmic overhead) method for securely and privately
processing large data sets over multiple parties with parallel, distributed algorithms. More …

Breaking the O (√ n)-bit barrier: Byzantine agreement with polylog bits per party

E Boyle, R Cohen, A Goel - Proceedings of the 2021 ACM Symposium …, 2021 - dl.acm.org
Byzantine agreement (BA), the task of n parties to agree on one of their input bits in the face
of malicious agents, is a powerful primitive that lies at the core of a vast range of distributed …

Communication locality in secure multi-party computation: how to run sublinear algorithms in a distributed setting

E Boyle, S Goldwasser, S Tessaro - Theory of Cryptography Conference, 2013 - Springer
We devise multi-party computation protocols for general secure function evaluation with the
property that each party is only required to communicate with a small number of dynamically …