Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
From MaRDI portal
Publication:2096546
DOI10.1007/978-3-030-56880-1_25zbMath1504.94004OpenAlexW3037776643MaRDI QIDQ2096546
Erica Blum, Chen-Da Liu-Zhang, Julian Loss
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_25
Related Items (6)
State machine replication under changing network conditions ⋮ \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asynchronous byzantine agreement protocols
- Thunderella: blockchains with optimistic instant confirmation
- Fairness versus guaranteed output delivery in secure multiparty computation
- Synchronous consensus with optimal asynchronous fallback guarantees
- Synchronous, with a chance of partition tolerance
- MPC with synchronous security and asynchronous responsiveness
- Asynchronous Secure Multiparty Computation in Constant Time
- Secure Multi-Party Computation with Identifiable Abort
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
- Authenticated Algorithms for Byzantine Agreement
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Asynchronous consensus and broadcast protocols
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Universally Composable Synchronous Computation
- Detectable byzantine agreement secure against faulty majorities
- Asynchronous secure computation
- 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
This page was built for publication: Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
