Authenticated Algorithms for Byzantine Agreement
From MaRDI portal
(Redirected from Publication:3036697)
Recommendations
Cited in
(only showing first 100 items - show all)- Early stopping for any number of corruptions
- Proof-of-work-based consensus in expected-constant time
- Closing the efficiency gap between synchronous and network-agnostic consensus
- scientific article; zbMATH DE number 7774289 (Why is no real title available?)
- Reverse firewalls for actively secure MPCs
- On the round complexity of Byzantine agreement without initial set-up
- Efficient agreement using fault diagnosis.
- Sublinear message bounds of authenticated implicit Byzantine agreement
- Detecting causality in the presence of Byzantine processes: the case of synchronous systems
- Reaching approximate agreement in the presence of faults
- Algorand: a secure and efficient distributed ledger
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Trust at scale: the economic limits of cryptocurrencies and blockchains
- The topology of distributed adversaries
- Broadcast from minicast secure against general adversaries
- Good things come to those who wait. Dishonest-majority coin-flipping requires delay functions
- Asymptotically optimal early termination for dishonest majority broadcast
- \textsf{Juggernaut}: efficient crypto-agnostic Byzantine agreement
- How to cope with faulty processors in a completely connected network of communicating processors
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- Practical quantum Byzantine protocol via nearly optimal entanglement resources
- Communication complexity of Byzantine agreement, revisited
- Efficient fully secure computation via distributed zero-knowledge proofs
- Deontic logic, contrary to duty reasoning and fault tolerance
- Computing (and Life) Is All about Tradeoffs
- Fairness versus guaranteed output delivery in secure multiparty computation
- Must the communication graph of MPC protocols be an expander?
- Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
- Round efficient Byzantine agreement from VDFs
- Scalable agreement protocols with optimal optimistic efficiency
- Synchronous t-resilient consensus in arbitrary graphs
- scientific article; zbMATH DE number 4039274 (Why is no real title available?)
- Expected constant round Byzantine broadcast under dishonest majority
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- A self-adjusting algorithm for Byzantine agreement
- Brief announcement: Multi-threshold asynchronous reliable broadcast and consensus
- From partial to global asynchronous reliable broadcast
- Authenticated broadcast with a partially compromised public-key infrastructure
- MPClan: protocol suite for privacy-conscious computations
- Constant-round asynchronous multi-party computation based on one-way functions
- Gossiping for communication-efficient broadcast
- On the computational overhead of MPC with dishonest majority
- Efficient algorithms for anonymous Byzantine agreement
- Synchronization Modulo k in Dynamic Networks
- Distributed agreement in the presence of processor and communication faults
- Time is not a healer (preliminary version)
- The firing squad problem revisited
- A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems
- The firing squad problem revisited
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- How Byzantine is a send corruption?
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- Synchronous consensus with optimal asynchronous fallback guarantees
- Stopping times of distributed consensus protocols: a probabilistic analysis
- Lattice agreement in message passing systems
- Consensus in the presence of overlapping faults and total omission
- The fault-tolerant cluster-sending problem
- Quantum Byzantine agreement for any number of dishonest parties
- Attaining GOD beyond honest majority with friends and foes
- Order-fairness for Byzantine consensus
- Early stopping Byzantine agreement in (1+ ) f rounds
- Synchronization modulo P in dynamic networks
- Brief announcement: Communication-optimal convex agreement
- On the communication complexity of secure multi-party computation with aborts
- DRAGON: decentralization at the cost of representation after arbitrary GrOupiNg and its applications to sub-cubic DKG and interactive consistency
- Nearly-optimal consensus tolerating adaptive omissions: why a lot of randomness is needed?
- TetraBFT: reducing latency of unauthenticated, responsive BFT consensus
- All Byzantine agreement problems are expensive
- MPC with synchronous security and asynchronous responsiveness
- Authenticated Byzantine generals in dual failure model
- Diffusion without false rumors: On propagating updates in a Byzantine environment.
- On-chain timestamps are accurate
- Accountable safety implies finality (short paper)
- Broadcast-optimal two-round MPC
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- 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
- Broadcast-optimal two round MPC with an honest majority
- On the composition of authenticated Byzantine Agreement
- Probabilistic termination and composability of cryptographic protocols
- Improved extension protocols for Byzantine broadcast and agreement
- On the round complexity of randomized Byzantine 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
- Message-optimal protocols for Byzantine Agreement
- Hundreds of impossibility results for distributed computing
- Information-theoretic broadcast with dishonest majority for long messages
- Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
- Communication lower bounds for cryptographic broadcast protocols
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- A simple Byzantine generals protocol
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
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)
