How to Garble Arithmetic Circuits

DOI10.1109/FOCS.2011.40zbMath1292.94186MaRDI QIDQ5495012

Yuval Ishai, Eyal Kushilevitz, Benny Applebaum

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Related Items (19)

Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Garbling XOR gates ``for free in the standard model ⋮ Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Two-Round Oblivious Linear Evaluation from Learning with Errors ⋮ (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin ⋮ New ways to garble arithmetic circuits ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Compact FE for unbounded attribute-weighted sums for logspace from SXDH ⋮ On multiparty garbling of arithmetic circuits ⋮ Candidate iO from homomorphic encryption schemes ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ On the Hardness of Learning with Rounding over Small Modulus ⋮ 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 ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer

This page was built for publication: How to Garble Arithmetic Circuits