Communication lower bounds for statistically secure MPC, with or without preprocessing
From MaRDI portal
Publication:2304978
DOI10.1007/978-3-030-26951-7_3zbMath1478.68091OpenAlexW2966900502MaRDI QIDQ2304978
Jesper Buus Nielsen, Kasper Green Larsen, Ivan B. Damgård
Publication date: 9 March 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26951-7_3
Cryptography (94A60) Networks and circuits as models of computation; circuit complexity (68Q06) Communication complexity, information complexity (68Q11)
Related Items
Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ 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} \)
