MonZ₂^ka: fast maliciously secure two party computation on Z₂^k

DOI10.1007/978-3-030-45388-6_13MaRDI QIDQ2055698zbMATH OpenOpenAlexFDO

Authors Dario Catalano, Mario Di Raimondo, Dario Fiore, Irene Giacomelli

Publication date 1 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-45388-6_13

Mathematics Subject Classification ID

Computer system organization (68Mxx) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
• Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
• Secure Arithmetic Computation with No Honest Majority
• Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP

Cites work

• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• Efficient cryptosystems from \(2^k\)-th power residue symbols
• Efficient cryptosystems from \(2^k\)-th power residue symbols
• High-throughput secure three-party computation for malicious adversaries and an honest majority
• scientific article; zbMATH DE number 2009982 (Why is no real title available?)
• scientific article; zbMATH DE number 1418291 (Why is no real title available?)
• Multiparty Computation from Somewhat Homomorphic Encryption
• Overdrive: making SPDZ great again
• Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Semi-homomorphic encryption and multiparty computation
• Yet another compiler for active security or: efficient MPC over arbitrary rings

Cited in

(9)

• Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
• Secure multiparty computation with sublinear preprocessing
• Rinocchio: SNARKs for ring arithmetic
• Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
• More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
• Vector commitments over rings and compressed -protocols
• On sigma-protocols and (packed) black-box secret sharing schemes
• Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
• Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \)

This page was built for publication: Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055698)