Multi-threshold asynchronous reliable broadcast and consensus
From MaRDI portal
Cites work
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- Advances in Cryptology - EUROCRYPT 2004
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Asynchronous byzantine agreement protocols
- Authenticated Algorithms for Byzantine Agreement
- Graceful degradation in multi-party computation. (Extended abstract)
- scientific article; zbMATH DE number 5485432 (Why is no real title available?)
- scientific article; zbMATH DE number 1302842 (Why is no real title available?)
- scientific article; zbMATH DE number 2009948 (Why is no real title available?)
- Hybrid-secure MPC, trading information-theoretic robustness for computational privacy
- Impossibility of distributed consensus with one faulty process
- MPC vs. SFE : Unconditional and Computational Security
- MPC with synchronous security and asynchronous responsiveness
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
- Passive corruption in statistical multi-party computation. (Extended abstract)
- Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages
- Synchronous consensus with optimal asynchronous fallback guarantees
- Synchronous, with a chance of partition tolerance
- The Byzantine Generals Problem
- The correctness proof of Ben-Or's randomized consensus algorithm
- Thunderella: blockchains with optimistic instant confirmation
This page was built for publication: Multi-threshold asynchronous reliable broadcast and consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834051)
