Network agnostic MPC with statistical security
From MaRDI portal
Recommendations
- Network-agnostic security comes (almost) for free in DKG and MPC
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network
- Secure multi-party computation in large networks
Cites work
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Authenticated Algorithms for Byzantine Agreement
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- Efficient general-adversary multi-party computation
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- scientific article; zbMATH DE number 1950364 (Why is no real title available?)
- scientific article; zbMATH DE number 1952886 (Why is no real title available?)
- Optimal Synchronous Approximate Agreement with Asynchronous Fallback
- Perfectly secure message transmission
- Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees
- Player simulation and general adversary structures in perfect multiparty computation
- Reaching Agreement in the Presence of Faults
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- Synchronous consensus with optimal asynchronous fallback guarantees
Cited in
(6)- Network-agnostic security comes (almost) for free in DKG and MPC
- Network-agnostic multi-party computation revisited (extended abstract)
- Randomized agreement, verifiable secret sharing and multi-party computation in granular synchrony
- Fast and efficient perfectly secure network-agnostic secure computation
- Information-theoretic network-agnostic MPC with polynomial communication
- Perfectly secure network-agnostic MPC comes for free
This page was built for publication: Network agnostic MPC with statistical security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582167)
