Amortized complexity of information-theoretically secure MPC revisited
From MaRDI portal
Publication:775982
DOI10.1007/978-3-319-96878-0_14zbMath1457.94201OpenAlexW2810304253MaRDI QIDQ775982
Ronald Cramer, Chen Yuan, Ignacio Cascudo, Xing, Chaoping
Publication date: 30 June 2020
Full work available at URL: https://ir.cwi.nl/pub/27943
Related Items (21)
Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ Efficient information-theoretic multi-party computation over non-commutative rings ⋮ Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms ⋮ Asymptotically quasi-optimal cryptography ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ Field instruction multiple data ⋮ Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Improved single-round secure multiplication using regenerating codes ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Circuit amortization friendly encodingsand their application to statistically secure multiparty computation ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings
This page was built for publication: Amortized complexity of information-theoretically secure MPC revisited
