A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
From MaRDI portal
Publication:2119064
DOI10.1007/978-3-030-64378-2_23zbMath1485.94133OpenAlexW3118045199MaRDI QIDQ2119064
Jaron Skovsted Gundersen, Ignacio Cascudo
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-64378-2_23
information-theoretical securityhonest majorityreverse multiplication friendly embeddingssecure multiparty computation protocol
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Analytic circuit theory (94C05) Authentication, digital signatures and secret sharing (94A62) Boolean functions (94D10)
Related Items (5)
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 ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
This page was built for publication: A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
