Authenticated Algorithms for Byzantine Agreement
From MaRDI portal
Publication:3036697
DOI10.1137/0212045zbMath0524.68021DBLPjournals/siamcomp/DolevS83OpenAlexW2034791526WikidataQ64357328 ScholiaQ64357328MaRDI QIDQ3036697
Danny Dolev, H. Raymond Strong
Publication date: 1983
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/38c830bf6192d9e83cf6793d01c54032b63bb8f8
Data encryption (aspects in computer science) (68P25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Related Items (84)
On the round complexity of randomized Byzantine agreement ⋮ On the possibility and impossibility of achieving clock synchronization ⋮ Diffusion without false rumors: On propagating updates in a Byzantine environment. ⋮ Broadcast-optimal two round MPC with an honest majority ⋮ Agreement under faulty interfaces ⋮ Information-theoretic broadcast with dishonest majority for long messages ⋮ Stopping times of distributed consensus protocols: a probabilistic analysis ⋮ Broadcast from Minicast Secure Against General Adversaries ⋮ The Heard-Of model: computing in distributed systems with benign faults ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ PoW-Based Distributed Cryptography with No Trusted Setup ⋮ A new look at fault-tolerant network routing ⋮ Authenticated broadcast with a partially compromised public-key infrastructure ⋮ Proof-of-reputation blockchain with Nakamoto fallback ⋮ Reliable broadcasts and communication models: tradeoffs and lower bounds ⋮ The topology of distributed adversaries ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Round-optimal Byzantine agreement ⋮ Synchronous consensus with optimal asynchronous fallback guarantees ⋮ The Firing Squad Problem Revisited. ⋮ Time is not a healer ⋮ Unconditional Byzantine agreement for any number of faulty processors ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Synchronous \(t\)-resilient consensus in arbitrary graphs ⋮ Message-optimal protocols for Byzantine Agreement ⋮ Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions ⋮ On the number of authenticated rounds in Byzantine Agreement ⋮ Algorand: a secure and efficient distributed ledger ⋮ Gossiping for communication-efficient broadcast ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ An algorithm for identification of maliciously faulty units ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Practical provably secure flooding for blockchains ⋮ Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures ⋮ Fairness versus guaranteed output delivery in secure multiparty computation ⋮ Completeness theorems for adaptively secure broadcast ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Communication complexity of Byzantine agreement, revisited ⋮ On the Amortized Communication Complexity of Byzantine Broadcast ⋮ Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ Efficient fully secure computation via distributed zero-knowledge proofs ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ Knowledge and common knowledge in a Byzantine environment: Crash failures ⋮ Byzantine Gathering in Networks with Authenticated Whiteboards ⋮ Hundreds of impossibility results for distributed computing ⋮ Cryptography and cryptographic protocols ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement ⋮ On the message complexity of binary Byzantine agreement under crash failures ⋮ Optimistically tuning synchronous Byzantine consensus: another win for null messages ⋮ Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs ⋮ Characterization of secure multiparty computation without broadcast ⋮ Efficient algorithms for anonymous Byzantine agreement ⋮ Deontic Logic, Contrary to Duty Reasoning and Fault Tolerance ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ A simple Byzantine generals protocol ⋮ Synchronous consensus under hybrid process and link failures ⋮ Unnamed Item ⋮ Characterization of Secure Multiparty Computation Without Broadcast ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ On expected constant-round protocols for Byzantine agreement ⋮ On Verifying Fault Tolerance of Distributed Protocols ⋮ Sublinear-round Byzantine agreement under corrupt majority ⋮ Simultaneity is harder than agreement ⋮ Structured Derivation of Semi-Synchronous Algorithms ⋮ Byzantine Agreement Using Partial Authentication ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Authenticated Byzantine Generals in Dual Failure Model ⋮ The firing squad problem revisited ⋮ Computing (and Life) Is All about Tradeoffs ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ Reverse firewalls for actively secure MPCs ⋮ How Byzantine is a send corruption? ⋮ Order-fairness for Byzantine consensus ⋮ The fault-tolerant cluster-sending problem ⋮ Practical quantum Byzantine protocol via nearly optimal entanglement resources ⋮ Quantum Byzantine agreement for any number of dishonest parties ⋮ Synchronization modulo \(P\) in dynamic networks ⋮ Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era ⋮ Broadcast-optimal two-round MPC
This page was built for publication: Authenticated Algorithms for Byzantine Agreement
