Secure computation with constant communication overhead using multiplication embeddings
From MaRDI portal
Publication:1738071
DOI10.1007/978-3-030-05378-9_20zbMath1407.94090OpenAlexW2811070514MaRDI QIDQ1738071
Hai H. Nguyen, Alexander R. Block, Hemanta K. Maji
Publication date: 29 March 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-05378-9_20
oblivious transfersecure computationrandomness extractorsleakage-resilient cryptographybasis-independent circuit compututationmultiplication embeddings
Related Items (9)
Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ Asymptotically quasi-optimal cryptography ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ Field instruction multiple data ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ 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
This page was built for publication: Secure computation with constant communication overhead using multiplication embeddings
