How to Garble Arithmetic Circuits

Cited In (25)

Block cipher invariants as eigenvectors of correlation matrices
Compact FE for unbounded attribute-weighted sums for logspace from SXDH
Candidate iO from homomorphic encryption schemes
On the hardness of learning with rounding over small modulus
Exploring crypto dark matter: new simple PRF candidates and their applications
Garbled circuits as randomized encodings of functions: a primer
Garbling XOR gates ``for free in the standard model
Full-threshold actively-secure multiparty arithmetic circuit garbling
On multiparty garbling of arithmetic circuits
Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
New ways to garble arithmetic circuits
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
Threshold garbled circuits and ad hoc secure computation
Two-round oblivious linear evaluation from learning with errors
Candidate iO from homomorphic encryption schemes
Unbounded multi-party computation from learning with errors
A general framework for lattice-based ABE using evasive inner-product functional encryption
Efficient arithmetic in garbled circuits
How to garble mixed circuits that combine Boolean and arithmetic computations
Toward malicious constant-rate 2PC via arithmetic garbling
(Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
(Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
Scalable multiparty computation from non-linear secret sharing
Encoding functions with constant online rate, or how to compress garbled circuit keys

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 Q5495012)