Authenticated Algorithms for Byzantine Agreement

DOI10.1137/0212045zbMATH Open0524.68021DBLPjournals/siamcomp/DolevS83OpenAlexW2034791526WikidataQ64357328 ScholiaQ64357328MaRDI QIDQ3036697FDOQ3036697

Data encryption (aspects in computer science) (68P25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Cited In (only showing first 100 items - show all)

Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
Stopping times of distributed consensus protocols: a probabilistic analysis
The fault-tolerant cluster-sending problem
Quantum Byzantine agreement for any number of dishonest parties
Order-fairness for Byzantine consensus
Synchronization modulo \(P\) in dynamic networks
MPC with synchronous security and asynchronous responsiveness
Diffusion without false rumors: On propagating updates in a Byzantine environment.
The Firing Squad Problem Revisited.
Unconditional Byzantine agreement for any number of faulty processors
Broadcast-optimal two-round MPC
Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
On the composition of authenticated Byzantine Agreement
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
Broadcast-optimal two round MPC with an honest majority
Probabilistic termination and composability of cryptographic protocols
Message-optimal protocols for Byzantine Agreement
Hundreds of impossibility results for distributed computing
Information-theoretic broadcast with dishonest majority for long messages
A simple Byzantine generals protocol
Knowledge and common knowledge in a Byzantine environment: Crash failures
Characterization of secure multiparty computation without broadcast
On the message complexity of binary Byzantine agreement under crash failures
Agreement under faulty interfaces
Structured Derivation of Semi-Synchronous Algorithms
Cryptography and cryptographic protocols
On the number of authenticated rounds in Byzantine Agreement
On the possibility and impossibility of achieving clock synchronization
Deontic Logic, Contrary to Duty Reasoning and Fault Tolerance
Fast agreement in networks with Byzantine nodes
The Heard-Of model: computing in distributed systems with benign faults
Round-preserving parallel composition of probabilistic-termination cryptographic protocols
A new look at fault-tolerant network routing
Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
Reliable broadcasts and communication models: tradeoffs and lower bounds
Time is not a healer
Characterization of Secure Multiparty Computation Without Broadcast
On expected constant-round protocols for Byzantine agreement
Simultaneity is harder than agreement
Practical provably secure flooding for blockchains
On Verifying Fault Tolerance of Distributed Protocols
Sublinear-round Byzantine agreement under corrupt majority
Title not available (Why is that?)
Efficient constant-round MPC with identifiable abort and public verifiability
Title not available (Why is that?)
On the Computational Overhead of MPC with Dishonest Majority
Probabilistic Termination and Composability of Cryptographic Protocols
Round-optimal Byzantine agreement
Synchronous consensus under hybrid process and link failures
Reverse firewalls for actively secure MPCs
Broadcast (and Round) Efficient Verifiable Secret Sharing
Efficient agreement using fault diagnosis.
Algorand: a secure and efficient distributed ledger
Security against covert adversaries: Efficient protocols for realistic adversaries
The topology of distributed adversaries
Practical quantum Byzantine protocol via nearly optimal entanglement resources
Efficient fully secure computation via distributed zero-knowledge proofs
Fairness versus guaranteed output delivery in secure multiparty computation
A self-adjusting algorithm for Byzantine agreement
Authenticated broadcast with a partially compromised public-key infrastructure
Efficient Secure Multiparty Computation with Identifiable Abort
Gossiping for communication-efficient broadcast
Synchronization Modulo k in Dynamic Networks
PoW-Based Distributed Cryptography with No Trusted Setup
Efficient algorithms for anonymous Byzantine agreement
The firing squad problem revisited
Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
How Byzantine is a send corruption?
Synchronous consensus with optimal asynchronous fallback guarantees
Attaining GOD beyond honest majority with friends and foes
Broadcast from Minicast Secure Against General Adversaries
Levels of authentication in distributed agreement
Byzantine generals in the permissionless setting
Player-replaceability and forensic support are two sides of the same (crypto) coin
Improved extension protocols for Byzantine broadcast and agreement
Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
Broadcast-optimal four-round MPC in the plain model
Network agnostic MPC with statistical security
Memory checking for parallel RAMs
On the round complexity of fully secure solitary MPC with honest majority
Synchronizable fair exchange
On the round complexity of randomized Byzantine agreement
Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults
Synchronous \(t\)-resilient consensus in arbitrary graphs
Byzantine Agreement Using Partial Authentication
Optimistically tuning synchronous Byzantine consensus: another win for null messages
Completeness theorems for adaptively secure broadcast
Network-agnostic security comes (almost) for free in DKG and MPC
Authenticated Byzantine Generals in Dual Failure Model
Proof-of-reputation blockchain with Nakamoto fallback
An algorithm for identification of maliciously faulty units
Optimal extension protocols for Byzantine broadcast and agreement
Network-agnostic multi-party computation revisited (extended abstract)
Byzantine Gathering in Networks with Authenticated Whiteboards
Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
On the Amortized Communication Complexity of Byzantine Broadcast
Title not available (Why is that?)

   Recommendations

Bounds on information exchange for Byzantine agreement 👍 👎
Fast Distributed Agreement 👍 👎
Message-optimal protocols for Byzantine Agreement 👍 👎
Efficient algorithms for anonymous Byzantine agreement 👍 👎
Distributed agreement in the presence of processor and communication faults 👍 👎

This page was built for publication: Authenticated Algorithms for Byzantine Agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3036697)