Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
From MaRDI portal
Publication:6587962
Recommendations
- Asynchronous Byzantine agreement with optimal resilience
- Almost-surely terminating asynchronous Byzantine agreement revisited
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- The power of shunning: efficient asynchronous Byzantine agreement revisited
- Communication optimal multi-valued asynchronous Byzantine agreement with optimal resilience
Cites work
- A lower bound for the time to assure interactive consistency
- Adaptively secure broadcast
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- Asynchronous byzantine agreement protocols
- Asynchronous Byzantine agreement with optimal resilience
- Asynchronous consensus and broadcast protocols
- Asynchronous Multi-Party Computation with Quadratic Communication
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Asynchronous secure multiparty computation in constant time
- Authenticated Algorithms for Byzantine Agreement
- Constant-round asynchronous multi-party computation based on one-way functions
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
- Easy impossibility proofs for distributed consensus problems
- Efficient player-optimal protocols for strong and differential consensus
- Expected constant round Byzantine broadcast under dishonest majority
- Fast asynchronous Byzantine agreement with optimal resilience
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- scientific article; zbMATH DE number 1942434 (Why is no real title available?)
- scientific article; zbMATH DE number 4121395 (Why is no real title available?)
- scientific article; zbMATH DE number 1848309 (Why is no real title available?)
- scientific article; zbMATH DE number 1394308 (Why is no real title available?)
- Impossibility of distributed consensus with one faulty process
- Levels of authentication in distributed agreement
- Lower bounds for randomized consensus under a weak adversary
- MPC with synchronous security and asynchronous responsiveness
- On expected constant-round protocols for Byzantine agreement
- On the composition of authenticated Byzantine Agreement
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- On the round complexity of randomized Byzantine agreement
- Probabilistic termination and composability of cryptographic protocols
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Reaching Agreement in the Presence of Faults
- Resilient-optimal interactive consistency in constant time
- Revisiting asynchronous fault tolerant computation with optimal resilience
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Round-optimal Byzantine agreement
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Sequential composition of protocols without simultaneous termination
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Simple constant-time consensus protocols in realistic failure models
- Sublinear-round Byzantine agreement under corrupt majority
- The Byzantine Generals Problem
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- Universally composable security
- Universally composable synchronous computation
Cited in
(8)- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Constant-round asynchronous MPC with optimal resilience and linear communication
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- Is it even possible? On the parallel composition of asynchronous MPC protocols
- Fast and efficient perfectly secure network-agnostic secure computation
- Information-theoretic network-agnostic MPC with polynomial communication
- Perfectly secure network-agnostic MPC comes for free
This page was built for publication: Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587962)
