Communication-efficient unconditional MPC with guaranteed output delivery
From MaRDI portal
Recommendations
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Communication-efficient MPC for general adversary structures
- Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network
- Optimal control via asynchronous communication channels
- Static output feedback control of uncertain systems over uncertain communication links with guaranteed H∞ performance
- Optimal control of LTI systems over unreliable communication links
- Distributed MPC of polytopic uncertain systems: handling quantised communication and packet dropouts
- On communication-efficient asynchronous MPC with adaptive security
- Communication-based performance bounds in nonlinear coordinated control
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
Cited in
(27)- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- On communication-efficient asynchronous MPC with adaptive security
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- MPC with delayed parties over star-like networks
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- Asymptotically free broadcast in constant expected time via packed VSS
- Network-agnostic security comes (almost) for free in DKG and MPC
- The price of active security in cryptographic protocols
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Guaranteed output delivery comes free in honest majority MPC
- The price of active security in cryptographic protocols
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Perfect asynchronous MPC with linear communication overhead
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Fast large-scale honest-majority MPC for malicious adversaries
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Efficient fully secure computation via distributed zero-knowledge proofs
- MPClan: protocol suite for privacy-conscious computations
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- ATLAS: efficient and scalable MPC in the honest majority setting
This page was built for publication: Communication-efficient unconditional MPC with guaranteed output delivery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2304979)