Mhz2K: MPC from HE over Z₂^k with new packing, simpler reshare, and better ZKP
From MaRDI portal
Publication:2128571
Recommendations
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Two round multiparty computation via multi-key FHE
Cites work
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A Zero-One Law for Boolean Privacy
- Amortized complexity of information-theoretically secure MPC revisited
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Bootstrapping for HElib
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Fully homomorphic SIMD operations
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- Multiparty Computation from Somewhat Homomorphic Encryption
- On the Amortized Complexity of Zero-Knowledge Protocols
- On the concrete hardness of learning with errors
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Overdrive: making SPDZ great again
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Secure multiparty computation goes live
- Semi-homomorphic encryption and multiparty computation
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
Cited in
(8)- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- On the scaled inverse of \((x^i-x^j)\) modulo cyclotomic polynomial of the form \(\Phi_{p^s}(x)\) or \(\Phi_{p^s q^t}(x)\)
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Field instruction multiple data
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
This page was built for publication: Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128571)
