Authenticated Algorithms for Byzantine Agreement
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On expected constant-round protocols for Byzantine agreement
- On the round complexity of Byzantine agreement without initial set-up
- How to cope with faulty processors in a completely connected network of communicating processors
- On the possibility and impossibility of achieving clock synchronization
- Stopping times of distributed consensus protocols: a probabilistic analysis
- A new look at fault-tolerant network routing
- Reliable broadcasts and communication models: tradeoffs and lower bounds
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- On the message complexity of binary Byzantine agreement under crash failures
- A self-adjusting algorithm for Byzantine agreement
- Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
- Efficient agreement using fault diagnosis.
- Information-theoretic broadcast with dishonest majority for long messages
- Fairness versus guaranteed output delivery in secure multiparty computation
- Characterization of secure multiparty computation without broadcast
- Diffusion without false rumors: On propagating updates in a Byzantine environment.
- A simple Byzantine generals protocol
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Sublinear-round Byzantine agreement under corrupt majority
- 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
- On the round complexity of randomized Byzantine agreement
- Broadcast-optimal two round MPC with an honest majority
- Proof-of-reputation blockchain with Nakamoto fallback
- Round-optimal Byzantine agreement
- Synchronous consensus with optimal asynchronous fallback guarantees
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Probabilistic termination and composability of cryptographic protocols
- The firing squad problem revisited
- The Heard-Of model: computing in distributed systems with benign faults
- Algorand: a secure and efficient distributed ledger
- Efficient algorithms for anonymous Byzantine agreement
- Byzantine fault tolerant public key authentication in peer-to-peer systems
- Authenticated broadcast with a partially compromised public-key infrastructure
- Optimal extension protocols for Byzantine broadcast and agreement
- Communication complexity of Byzantine agreement, revisited
- 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
- Characterization of secure multiparty computation without broadcast
- Probabilistic Termination and Composability of Cryptographic Protocols
- Computing (and Life) Is All about Tradeoffs
- Agreement under faulty interfaces
- Broadcast (and round) efficient verifiable secret sharing
- Constant-round asynchronous multi-party computation based on one-way functions
- Byzantine gathering in networks with authenticated whiteboards
- Structured Derivation of Semi-Synchronous Algorithms
- Byzantine Agreement Using Partial Authentication
- Efficient secure multiparty computation with identifiable abort
- The firing squad problem revisited
- Authenticated Byzantine generals in dual failure model
- Broadcast from minicast secure against general adversaries
- On the composition of authenticated Byzantine Agreement
- PoW-based distributed cryptography with no trusted setup
- The topology of distributed adversaries
- A new solution for the Byzantine generals problem
- Distributed agreement in the presence of processor and communication faults
- Reaching approximate agreement in the presence of faults
- Bounds on information exchange for Byzantine agreement
- scientific article; zbMATH DE number 4039274 (Why is no real title available?)
- Fast Distributed Agreement
- scientific article; zbMATH DE number 4085017 (Why is no real title available?)
- Message-optimal protocols for Byzantine Agreement
- scientific article; zbMATH DE number 568828 (Why is no real title available?)
- An algorithm for identification of maliciously faulty units
- scientific article; zbMATH DE number 1154413 (Why is no real title available?)
- Lattice agreement in message passing systems
- Time is not a healer (preliminary version)
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- Hundreds of impossibility results for distributed computing
- Cryptography and cryptographic protocols
- Deontic logic, contrary to duty reasoning and fault tolerance
- On Verifying Fault Tolerance of Distributed Protocols
- On the computational overhead of MPC with dishonest majority
- Synchronous \(t\)-resilient consensus in arbitrary graphs
- scientific article; zbMATH DE number 7774289 (Why is no real title available?)
- On the number of authenticated rounds in Byzantine Agreement
- Gossiping for communication-efficient broadcast
- Must the communication graph of MPC protocols be an expander?
- MPClan: protocol suite for privacy-conscious computations
- A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems
- 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
- Completeness theorems for adaptively secure broadcast
- Network-agnostic security comes (almost) for free in DKG and MPC
- On the Amortized Communication Complexity of Byzantine Broadcast
- Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
- Synchronization Modulo k in Dynamic Networks
- Improved extension protocols for Byzantine broadcast and agreement
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)
