Yet another compiler for active security or: efficient MPC over arbitrary rings
From MaRDI portal
Publication:1784116
DOI10.1007/978-3-319-96881-0_27zbMath1436.94050OpenAlexW2794500245MaRDI QIDQ1784116
Mark Simkin, Claudio Orlandi, Ivan B. Damgård
Publication date: 26 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96881-0_27
Related Items (8)
Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Secure computation with low communication from cross-checking ⋮ Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings
Cites Work
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Efficient Multiparty Protocols via Log-Depth Threshold Formulae
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
- Semi-homomorphic Encryption and Multiparty Computation
- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
- Founding Cryptography on Oblivious Transfer – Efficiently
- Reaching Agreement in the Presence of Faults
- On the Power of Correlated Randomness in Secure Computation
- Detectable byzantine agreement secure against faulty majorities
- The IPS Compiler: Optimizations, Variants and Concrete Efficiency
- Secure Multiparty Computation and Secret Sharing
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
- Two Round Multiparty Computation via Multi-key FHE
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Yet another compiler for active security or: efficient MPC over arbitrary rings
