Secure arithmetic computation with constant computational overhead
From MaRDI portal
Publication:1675726
DOI10.1007/978-3-319-63688-7_8zbMath1407.94073OpenAlexW2739769990MaRDI QIDQ1675726
Publication date: 3 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_8
Related Items (19)
Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Two-Round Oblivious Linear Evaluation from Learning with Errors ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Improved private set intersection for sets with small entries ⋮ A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ Amortizing division and exponentiation ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Worst-case subexponential attacks on PRGs of constant degree or constant locality ⋮ Oblivious transfer with constant computational overhead ⋮ Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\) ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Indistinguishability obfuscation ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE ⋮ The price of active security in cryptographic protocols
This page was built for publication: Secure arithmetic computation with constant computational overhead
