Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
From MaRDI portal
(Redirected from Publication:2695652)
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
Cites work
- scientific article; zbMATH DE number 1302842 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- scientific article; zbMATH DE number 1842487 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- 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
- Asynchronous secure computations with optimal resilience (extended abstract)
- Authenticated Algorithms for Byzantine Agreement
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Constant-round asynchronous multi-party computation based on one-way functions
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Fast asynchronous Byzantine agreement with optimal resilience
- General secure multi-party computation from any linear secret-sharing scheme
- Impossibility of distributed consensus with one faulty process
- MPC with synchronous security and asynchronous responsiveness
- On Expected Constant-Round Protocols for 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
- Sequential composition of protocols without simultaneous termination
- Simple and efficient asynchronous Byzantine agreement with optimal resilience
- Synchronous consensus with optimal asynchronous fallback guarantees
- Synchronous, with a chance of partition tolerance
- The Byzantine Generals Problem
- Thunderella: blockchains with optimistic instant confirmation
- Two round information-theoretic MPC with malicious security
Cited in
(14)- Synchronous consensus with optimal asynchronous fallback guarantees
- All Byzantine agreement problems are expensive
- Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
- Network agnostic MPC with statistical security
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Optimal Byzantine agreement in the presence of message drops
- 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
- \textsf{Juggernaut}: efficient crypto-agnostic Byzantine agreement
- 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)
