Guaranteed output delivery comes free in honest majority MPC
From MaRDI portal
Publication:2096542
DOI10.1007/978-3-030-56880-1_22zbMath1504.94143OpenAlexW3013421208MaRDI QIDQ2096542
Yifan Song, Vipul Goyal, Chenzhi Zhu
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_22
Related Items (20)
Fluid MPC: secure multiparty computation with dynamic participants ⋮ ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ 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 ⋮ Information-theoretically secure MPC against mixed dynamic adversaries ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Order-C secure multiparty computation for highly repetitive circuits ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ Efficient compiler to covert security with public verifiability for honest majority MPC ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- Secure two-party computation via cut-and-choose oblivious transfer
- Guaranteed output delivery comes free in honest majority MPC
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Communication-efficient unconditional MPC with guaranteed output delivery
- Secure Protocol Transformations
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- A New Approach to Practical Active-Secure Two-Party Computation
- How to share a secret
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Scalable and Unconditionally Secure Multiparty Computation
- Circuits resilient to additive attacks with applications to secure computation
- Perfectly-Secure MPC with Linear Communication Complexity
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
- Theory of Cryptography
This page was built for publication: Guaranteed output delivery comes free in honest majority MPC
