How to garble arithmetic circuits
From MaRDI portal
Recommendations
Cited in
(18)- Computing primitive idempotents in finite commutative rings and applications
- Arithmetic cryptography (extended abstract)
- FE and iO for Turing machines from minimal assumptions
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE
- Garbled circuits as randomized encodings of functions: a primer
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Full-threshold actively-secure multiparty arithmetic circuit garbling
- On multiparty garbling of arithmetic circuits
- Additive randomized encodings and their applications
- New ways to garble arithmetic circuits
- Amortizing Garbled Circuits
- Low-complexity cryptographic hash functions
- Arithmetic garbling from bilinear maps
- Garbled circuit lookup tables with logarithmic number of ciphertexts
- How to garble mixed circuits that combine Boolean and arithmetic computations
- Arithmetic cryptography
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
- A framework with randomized encoding for a fast privacy preserving calculation of non-linear kernels for machine learning applications in precision medicine
This page was built for publication: How to garble arithmetic circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494942)
