Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
From MaRDI portal
Publication:2096546
Recommendations
- MPC with synchronous security and asynchronous responsiveness
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Synchronous consensus with optimal asynchronous fallback guarantees
- On communication-efficient asynchronous MPC with adaptive security
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Fully-secure MPC with minimal trust
- MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
- On fully secure MPC with solitary output
- Asynchronous MPC with a strict honest majority using non-equivocation
Cites work
- Advances in Cryptology - CRYPTO 2003
- Asynchronous byzantine agreement protocols
- Asynchronous consensus and broadcast protocols
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Asynchronous secure multiparty computation in constant time
- Authenticated Algorithms for Byzantine Agreement
- Constant-round asynchronous multi-party computation based on one-way functions
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Detectable Byzantine agreement secure against faulty majorities
- Efficient concurrent zero-knowledge in the auxiliary string model
- Fairness versus guaranteed output delivery in secure multiparty computation
- General secure multi-party computation from any linear secret-sharing scheme
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- 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 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 1842487 (Why is no real title available?)
- Hybrid consensus: efficient consensus in the permissionless model
- MPC with synchronous security and asynchronous responsiveness
- Practical threshold signatures
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secure multi-party computation with identifiable abort
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Synchronous consensus with optimal asynchronous fallback guarantees
- Synchronous, with a chance of partition tolerance
- Thunderella: blockchains with optimistic instant confirmation
- Universally composable synchronous computation
Cited in
(17)- 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
- On the theoretical gap between synchronous and asynchronous MPC protocols
- 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
- 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
- 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
- Multi-threshold asynchronous reliable broadcast and consensus
- Peeking into the future: MPC resilient to super-rushing adversaries
- \textsf{Juggernaut}: efficient crypto-agnostic Byzantine agreement
- Randomized agreement, verifiable secret sharing and multi-party computation in granular synchrony
This page was built for publication: Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096546)
