Mhz2K: MPC from HE over Z₂^k with new packing, simpler reshare, and better ZKP
From MaRDI portal
Publication:2128571
DOI10.1007/978-3-030-84245-1_15zbMATH Open1486.94087OpenAlexW3190737520MaRDI QIDQ2128571FDOQ2128571
Authors: Jung Hee Cheon, Dongwoo Kim, Keewoo Lee 
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_15
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
homomorphic encryptionmulti-party computationzero-knowledge proofpacking methoddishonest majority\(\mathbb{Z}_{2^k} \)-messages
Cites Work
- Bootstrapping for HElib
- (Leveled) fully homomorphic encryption without bootstrapping
- Multiparty Computation from Somewhat Homomorphic Encryption
- Semi-homomorphic encryption and multiparty computation
- A Zero-One Law for Boolean Privacy
- Fully homomorphic SIMD operations
- Secure multiparty computation goes live
- Title not available (Why is that?)
- On the concrete hardness of learning with errors
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Amortized complexity of information-theoretically secure MPC revisited
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- 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
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Overdrive: making SPDZ great again
- On the Amortized Complexity of Zero-Knowledge Protocols
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
Cited In (8)
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- 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)\)
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- Field instruction multiple data
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
Uses Software
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)
