Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
From MaRDI portal
Publication:6587962
DOI10.1007/978-3-031-48624-1_16zbMATH Open1545.94057MaRDI QIDQ6587962
Vassilis Zikas, Ran Cohen, Pouyan Forghani, Rutvik Patel, Juan A. Garay
Publication date: 15 August 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On expected constant-round protocols for Byzantine agreement
- Easy impossibility proofs for distributed consensus problems
- Asynchronous byzantine agreement protocols
- A lower bound for the time to assure interactive consistency
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Sublinear-round Byzantine agreement under corrupt majority
- Expected constant round Byzantine broadcast under dishonest majority
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- On the round complexity of randomized Byzantine agreement
- Revisiting asynchronous fault tolerant computation with optimal resilience
- Round-optimal Byzantine agreement
- Asynchronous Byzantine agreement with optimal resilience
- Probabilistic termination and composability of cryptographic protocols
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- MPC with synchronous security and asynchronous responsiveness
- Asynchronous Secure Multiparty Computation in Constant Time
- An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
- Efficient player-optimal protocols for strong and differential consensus
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
- Authenticated Algorithms for Byzantine Agreement
- On the composition of authenticated Byzantine Agreement
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Asynchronous Multi-Party Computation with Quadratic Communication
- Adaptively Secure Broadcast
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- Asynchronous consensus and broadcast protocols
- Impossibility of distributed consensus with one faulty process
- Simple constant-time consensus protocols in realistic failure models
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Universally Composable Synchronous Computation
- Universally Composable Security
- Unconditional Byzantine agreement for any number of faulty processors
- Resilient-optimal interactive consistency in constant time
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- Sequential composition of protocols without simultaneous termination
- Fast asynchronous Byzantine agreement with optimal resilience
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Lower Bounds for Randomized Consensus under a Weak Adversary
- Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Reaching consensus for asynchronous distributed key generation
- Levels of authentication in distributed agreement
Related Items (2)
Towards achieving asynchronous MPC with linear communication and optimal resilience ⋮ Linear-communication asynchronous complete secret sharing with optimal resilience
This page was built for publication: Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
