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
(40)- Constant-overhead unconditionally secure multiparty computation over binary fields
- Guaranteed output delivery comes free in honest majority MPC
- An efficient passive-to-active compiler for honest-majority MPC over rings
- The price of active security in cryptographic protocols
- ATLAS: efficient and scalable MPC in the honest majority setting
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Efficient fully secure computation via distributed zero-knowledge proofs
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- On communication-efficient asynchronous MPC with adaptive security
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Fast large-scale honest-majority MPC for malicious adversaries
- MPClan: protocol suite for privacy-conscious computations
- Asymptotically free broadcast in constant expected time via packed VSS
- Network-agnostic security comes (almost) for free in DKG and MPC
- 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
- The price of active security in cryptographic protocols
- Perfect asynchronous MPC with linear communication overhead
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness
- Peeking into the future: MPC resilient to super-rushing adversaries
- Asymptotically free broadcast in constant expected time via packed VSS
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- Perfectly-secure MPC with constant online communication complexity
- Honest majority GOD MPC with \(O(\operatorname{depth}(C))\) rounds and low online communication
- Perfectly-secure multiparty computation with linear communication complexity over any modulus
- Fast and efficient perfectly secure network-agnostic secure computation
- Perfectly secure network-agnostic MPC comes for free
- New upper and lower bounds for perfectly secure MPC
- When trying to catch cheaters breaks the MPC: breaking and fixing delayed consistency checks in Trident, Fantastic Four, SWIFT, and Quad
- Perfectly secure fluid MPC with abort and linear communication complexity
- Scaling fully secure MPC via robust recursive search and gap amplification
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)
