Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
From MaRDI portal
Publication:2695652
DOI10.1007/978-3-030-90459-3_21OpenAlexW3216503967MaRDI QIDQ2695652FDOQ2695652
Authors: Giovanni Deligios, Martin Hirt, Chen-Da Liu-Zhang 
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_21
Recommendations
- Synchronous consensus with optimal asynchronous fallback guarantees
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Constant-round asynchronous multi-party computation based on one-way functions
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Distributed systems (68M14)
Cites Work
- General secure multi-party computation from any linear secret-sharing scheme
- Authenticated Algorithms for Byzantine Agreement
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Title not available (Why is that?)
- Sequential composition of protocols without simultaneous termination
- Advances in Cryptology - CRYPTO 2003
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Title not available (Why is that?)
- Asynchronous secure computations with optimal resilience (extended abstract)
- An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
- Simple and efficient asynchronous byzantine agreement with optimal resilience
- Fast asynchronous Byzantine agreement with optimal resilience
- Probabilistic termination and composability of cryptographic protocols
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Title not available (Why is that?)
- On Expected Constant-Round Protocols for Byzantine Agreement
- Thunderella: blockchains with optimistic instant confirmation
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Synchronous consensus with optimal asynchronous fallback guarantees
- Synchronous, with a chance of partition tolerance
- Two round information-theoretic MPC with malicious security
- MPC with synchronous security and asynchronous responsiveness
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
Cited In (9)
- Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
- Network agnostic MPC with statistical security
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Network-agnostic security comes (almost) for free in DKG and MPC
- Network-agnostic multi-party computation revisited (extended abstract)
- Closing the efficiency gap between synchronous and network-agnostic consensus
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
This page was built for publication: Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695652)
