\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority

DOI10.1007/978-3-319-96881-0_26zbMath1436.94049OpenAlexW2811331976MaRDI QIDQ1784115

Ronald Cramer, Peter Scholl, Xing, Chaoping, Daniel E. Escudero, Ivan B. Damgård

Publication date: 26 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96881-0_26

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Sumcheck arguments and their applications ⋮ Compilation of function representations for secure computing paradigms ⋮ Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Sublinear GMW-style compiler for MPC with preprocessing ⋮ Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ Honest majority MPC with abort with minimal online communication ⋮ Secure multiparty computation with free branching ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings ⋮ MArBLed circuits: mixing arithmetic and Boolean circuits with active security ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato} ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings ⋮ Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\) ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Improved Multiplication Triple Generation over Rings via RLWE-Based AHE ⋮ An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Secure multi-party quantum computation with a dishonest majority ⋮ Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ Actively secure setup for SPDZ ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits ⋮ P2DEX: privacy-preserving decentralized cryptocurrency exchange ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings