Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)

DOI10.1007/978-3-030-45388-6_13OpenAlexW3021781013MaRDI QIDQ2055698

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

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

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

Related Items (6)

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 \(\varSigma \)-protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
• Overdrive: making SPDZ great again
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• Yet another compiler for active security or: efficient MPC over arbitrary rings
• Efficient cryptosystems from \(2^k\)-th power residue symbols
• Multiparty Computation from Somewhat Homomorphic Encryption
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Semi-homomorphic Encryption and Multiparty Computation
• Efficient Cryptosystems from 2 k -th Power Residue Symbols
• High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority

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