Open AccessPosted Content
Improved Extension Protocols for Byzantine Broadcast and Agreement
Reads0
Chats0
TLDR
This paper presents new protocols with improved communication complexity in almost all settings of BB and BA, i.e., protocols that solve BB/BA with long inputs of $l$ bits using lower costs than single-bit instances.Abstract:
Byzantine broadcast (BB) and Byzantine agreement (BA) are two most fundamental problems and essential building blocks in distributed computing, and improving their efficiency is of interest to both theoreticians and practitioners. In this paper, we study extension protocols of BB and BA, i.e., protocols that solve BB/BA with long inputs of $l$ bits using lower costs than $l$ single-bit instances. We present new protocols with improved communication complexity in almost all settings: authenticated BA/BB with $t<n/2$, authenticated BB with $t<(1-\epsilon)n$, unauthenticated BA/BB with $t<n/3$, and asynchronous reliable broadcast and BA with $t<n/3$. The new protocols are advantageous and significant in several aspects. First, they achieve the best-possible communication complexity of $\Theta(nl)$ for wider ranges of input sizes compared to prior results. Second, the authenticated extension protocols achieve optimal communication complexity given the current best available BB/BA protocols for short messages. Third, to the best of our knowledge, our asynchronous and authenticated protocols in the setting are the first extension protocols in that setting.read more
Citations
More filters
Book ChapterDOI
State Machine Replication under Changing Network Conditions
TL;DR: It is shown that proactively secure SMR using threshold cryp-tography is impossible without some form of synchronization between the parties, and a model where the adversary is limited in the total number of parties it can corrupt over the duration of the protocol is considered.
Proceedings ArticleDOI
Batching, Aggregation, and Zero-Knowledge Proofs in Bilinear Accumulators
TL;DR: In this article , the authors present a zero-knowledge batch proof with constant proof size and constant verification in the Bilinear Pairings (BP) setting and propose protocols that allow a prover to aggregate multiple individual non-membership proofs, in the BP setting, into a single batch proof of constant size.
Book ChapterDOI
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS
TL;DR: In this paper , the authors improved the communication complexity of broadcast in constant expected time to O(nL+n^4 +n^6 log n) using packed verifiable secret sharing.
Near-optimal Balanced Reliable Broadcast and Asynchronous Verifiable Information Dispersal
TL;DR: Lower bound results on communication cost and show that the balanced RBC and AVID protocols have near-optimal communication costs – only an factor of O ( κ ) or O (log n ) gap from the lower bounds.
Journal Article
Byzantine Reliable Broadcast with O(nL+kn+n2 log n) Communication
TL;DR: This paper provides a novel BRB protocol—BRB1, which achieves O ( nL + kn + n 2 log n ) communication, where n, L, and k are the number of replicas, the message length, and the security parameter, respectively.
References
More filters
Journal ArticleDOI
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
Journal ArticleDOI
Impossibility of distributed consensus with one faulty process
TL;DR: In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
Proceedings ArticleDOI
Protocols for secure computations
TL;DR: This paper describes three ways of solving the millionaires’ problem by use of one-way functions (i.e., functions which are easy to evaluate but hard to invert) and discusses the complexity question “How many bits need to be exchanged for the computation”.
Journal ArticleDOI
Polynomial Codes Over Certain Finite Fields
I. S. Reed,G. Solomon +1 more
TL;DR: A mapping of m symbols into 2 symbols will be shown to be (2 m)/2 or ( 2 m 1)/2 symbol correcting, depending on whether m is even or odd.
Book ChapterDOI
Aggregate and verifiably encrypted signatures from bilinear maps
TL;DR: In this article, Boneh, Lynn, and Shacham introduced the concept of an aggregate signature, presented security models for such signatures, and gave several applications for aggregate signatures.