Cited in
(36)- Exploring crypto dark matter: new simple PRF candidates and their applications
- On multiparty garbling of arithmetic circuits
- Candidate iO from homomorphic encryption schemes
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Unbounded multi-party computation from learning with errors
- Threshold garbled circuits and ad hoc secure computation
- Full-threshold actively-secure multiparty arithmetic circuit garbling
- On the hardness of learning with rounding over small modulus
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Garbling XOR gates ``for free in the standard model
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Garbled circuits as randomized encodings of functions: a primer
- Two-round oblivious linear evaluation from learning with errors
- Block cipher invariants as eigenvectors of correlation matrices
- (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
- New ways to garble arithmetic circuits
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Candidate iO from homomorphic encryption schemes
- Compact FE for unbounded attribute-weighted sums for logspace from SXDH
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- A general framework for lattice-based ABE using evasive inner-product functional encryption
- Efficient arithmetic in garbled circuits
- Toward malicious constant-rate 2PC via arithmetic garbling
- How to garble mixed circuits that combine Boolean and arithmetic computations
- Scalable multiparty computation from non-linear secret sharing
- (1/ )-rate Boolean garbling scheme from generic groups
- Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR
- On the adaptive security of Free-XOR-based garbling schemes in the plain model
- Breaking the 1/ -rate barrier for arithmetic garbling
- Efficient mixed garbling from homomorphic secret sharing and GGM-tree
- Weakly super-invertible matrices and constant communication dishonest majority MPC
- Rate-1 arithmetic garbling from homomorphic secret sharing
- Towards building efficient SCALES protocols
- Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
- Efficient garbled pseudorandom functions and lookup tables from minimal assumption
- Cryptography with weak privacy
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)
