Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
From MaRDI portal
Publication:2695652
DOI10.1007/978-3-030-90459-3_21OpenAlexW3216503967MaRDI QIDQ2695652
Martin Hirt, Chen-Da Liu-Zhang, Giovanni Deligios
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_21
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)
Related Items (2)
Network-agnostic security comes (almost) for free in DKG and MPC ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Probabilistic termination and composability of cryptographic protocols
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- MPC with synchronous security and asynchronous responsiveness
- An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
- Authenticated Algorithms for Byzantine Agreement
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Simple and efficient asynchronous byzantine agreement with optimal resilience
- Sequential composition of protocols without simultaneous termination
- Fast asynchronous Byzantine agreement with optimal resilience
- Asynchronous secure computations with optimal resilience (extended abstract)
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Advances in Cryptology - CRYPTO 2003
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- On Expected Constant-Round Protocols for Byzantine Agreement
This page was built for publication: Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
