Honest majority MPC with abort with minimal online communication
From MaRDI portal
Publication:2146110
DOI10.1007/978-3-030-88238-9_22zbMath1491.94004OpenAlexW3115642088MaRDI QIDQ2146110
Anders Dalskov, Daniel E. Escudero
Publication date: 15 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88238-9_22
Related Items (2)
MPClan: protocol suite for privacy-conscious computations ⋮ Improved single-round secure multiplication using regenerating codes
Cites Work
- Unnamed Item
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- The wonderful world of global random oracles
- Overdrive: making SPDZ great again
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- Efficient fully secure computation via distributed zero-knowledge proofs
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Scalable and Unconditionally Secure Multiparty Computation
- Foundations of Cryptography
- 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: Honest majority MPC with abort with minimal online communication
