Sublinear-Round Byzantine Agreement under Corrupt MajorityByzantine Agreement Protocol • February 7th, 2020
Abstract. Although Byzantine Agreement (BA) has been studied for three decades, perhaps somewhat surprisingly, there still exist significant gaps in our understanding regarding its round complexity. A long-standing open question is the following: can we achieve BA with sublinear round complexity under corrupt majority? Due to the beautiful works by Garay et al. (FOCS’07) and Fitzi and Nielsen (DISC’09), we have partial and affirmative answers to this question albeit for the narrow regime f = n/2 + o(n) where f is the number of corrupt nodes and n is the total number of nodes. So far, no positive result is known about the setting f > 0.51n even for static corruption!
Byzantine Agreement, Made TrivialByzantine Agreement Protocol • March 19th, 2018
We present a very simple, cryptographic, Byzantine-agreement protocol that, with n = 3t + 1 players, t of which are malicious, halts in expected 9 rounds.
Artificial Neural Network Based Byzantine Agreement ProtocolByzantine Agreement Protocol • July 5th, 2022
Unconditional Byzantine Agreement with Good MajorityByzantine Agreement Protocol • November 5th, 2007
Abstract. We present a protocol which achieves Byzantine Agreement (BA) if less than half of the processors are faulty and which does not rely on unproved computational assumptions such as the unforgeability of digital signatures. This is the first protocol which achieves this level of security.
Multi-Party Quantum Byzantine Agreement without EntanglementByzantine Agreement Protocol • October 14th, 2020
ALGORAND AGREEMENT: Super-Fast and Partition Resilient Byzantine AgreementByzantine Agreement Protocol • December 6th, 2019
• Fast Agreement: If the network is not partitioned then for all the honest parties can reach the agreement in expected constant number of rounds.
Byzantine Agreement on Steroids Silvio MicaliByzantine Agreement Protocol • March 27th, 2017
Abstract. As insightfully defined by Pease, Shostak, and Lamport, Byzantine agreement (BA) has rightfully received enormous attention, and is one of the most demanding and compelling notions in fault-tolerant and secure computation. Yet, BA protocols are too slow for most practical applications, and often satisfy conditions much weaker than those originally envisaged.
Cob: a Multidimensional Byzantine Agreement Protocol for Asynchronous Incomplete NetworksByzantine Agreement Protocol • August 25th, 2021
Efficient Adaptively-Secure Byzantine Agreement for Long MessagesByzantine Agreement Protocol • October 17th, 2021
Abstract. We investigate the communication complexity of Byzantine agreement protocols for long messages against an adaptive adversary. In this setting, prior results either achieved a com- munication complexity of O(nl· poly(κ)) or O(nl + n2 · poly(κ)) for l-bit long messages. We improve the state of the art by presenting protocols with communication complexity O(nl + n · poly(κ)) in both the synchronous and asynchronous communication models. The synchronous protocol toler- ates t ≤ (1 − ε) n corruptions and assumes a VRF setup, while the asynchronous protocol tolerates t ≤ (1 − ε) corruptions under further cryptographic assumptions. Our protocols are very simple and combine subcommittee election with the recent approach of Nayak et al. (DISC ‘20). Surpris- ingly, the analysis of our protocols is all but simple and involves an interesting new application of Mc Diarmid’s inequality to obtain optimal corruption thresholds.
Byzantine Agreement with Dual Failure Mode forByzantine Agreement Protocol • December 18th, 2006
In a distributed system, the task must achieve an agreement; a Mobile Ad-hoc NETwork (MANET) is trending towards distributed systems that support for mobile computing. The Byzantine Agreement (BA) protocols designed in traditional networks do not perform well in MANET environment. There are several properties in MANET such that MANET can provide processor join to the network or leave anytime with non-infrastructure. A group of multiple processors in MANET is cooperating to achieve some objectives. In order to move up the capability of the faulty tolerance and ensure network security, provide stable distributed system environment, a protocol VSAP (Virtual Subnet Agreement Protocol) to solve the BA problem with malicious and dormant faults (dual failure mode) is proposed. VSAP uses the minimum number of message exchange rounds to make all correct processors agree on a common value and can tolerate the maximum number of allowable faulty components. The proposed protocol is not only solvin
Efficient Adaptively-Secure Byzantine Agreement for Long MessagesByzantine Agreement Protocol • June 6th, 2022
Multi-party Quantum Byzantine Agreement Without Entan- glementByzantine Agreement Protocol • March 23rd, 2020
In this paper we propose a protocol of quantum communication to achieve Byzantine agreement among multiple par- ties. The striking feature of our proposal in comparison to the existing protocols is that we do not use entanglement to achieve the agreement. There are two stages in our protocol. In the first stage, a list of numbers that satisfies some special prop- erties is distributed to every participant by a group of semi-honest list distributors via quantum secure communication. Then, in the second stage those participants ex- change some information to reach agree- ment.
A Simple Byzantine Agreement ProtocolByzantine Agreement Protocol • October 23rd, 2013
Lemma 2 Let t < n/3. If the king is honest in some execution of the phase-king subroutine, then the outputs of all honest parties agree at the end of that subroutine.
Juggernaut: Efficient Crypto-Agnostic Byzantine AgreementByzantine Agreement Protocol • October 9th, 2024
Algorand: Scaling Byzantine Agreements for CryptocurrenciesByzantine Agreement Protocol • September 24th, 2017
Fast Asynchronous Byzantine Agreement with Optimal ResilienceByzantine Agreement Protocol • November 5th, 2007
It is known that, in both asynchronous and synchronous networks, no Byzantine Agreement (BA) protocol for n players exists if d n e of the players are faulty (in other words, no BA protocol
Asynchronous Byzantine Agreement with Optimal Resilience and Linear ComplexityByzantine Agreement Protocol • October 11th, 2018
Given a system with n > 3t + 1 processes, where t is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in O(t) expected running time. This improves the O(n2) expected running time of Abraham, Dolev, and Halpern [1]. Furthermore, if n = (3 + ε)t for any ε > 0, our protocol can reach agreement in O(1/ε) expected running time. This improves the result of Feldman and Micali [7] (with constant expected running time when n > 4t).
Unconditional Byzantine Agreement for any Number of Faulty ProcessorsByzantine Agreement Protocol • November 7th, 2007
Abstract. We present the first Byzantine agreement protocol which tolerates any number of maliciously faulty processors without relying on computational assumptions (such as the unforgeability of digital signatures).
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement usingByzantine Agreement Protocol • August 14th, 2000
Byzantine agreement requires a set of parties in a distributed system to agree on a value even if some parties are corrupted. A new protocol for Byzantine agreement in a completely asynchronous network is presented that makes use of cryptography, specifically of threshold signatures and coin-tossing protocols. These cryptographic protocols have practical and provably secure implementations in the “random oracle” model. In particular, a coin-tossing protocol based on the Diffie-Hellman problem is presented and analyzed.
