New Ways to Garble Arithmetic Circuits
The beautiful work of Applebaum, Ishai, and Kushilevitz [FOCS’11] initiated the study of arithmetic variants of Yao’s garbled circuits. An arithmetic garbling scheme is an effi-
Abstract The beautiful work of Applebaum, Ishai, and Kushilevitz [FOCS’11] initiated the study of arithmetic variants of Yao’s garbled circuits. An arithmetic garbling scheme is an effi- cient transformation that converts an arithmetic circuit C over a ring R into a garbled circuit C' and an affine functions Li for each input bit xi, such that C' and Li(xi) reveals only the output C(x) and no other information of x. AIK presented the first arithmetic garbling scheme supporting computation over integers from a bounded (possibly exponentially large) range, based on Learning With Errors…
saved by
related reading
- Indistinguishability Obfuscation from Well-Founded Assumptionseprint.iacr.org
- Unclonable Polymers and Their Cryptographic Applicationseprint.iacr.org
- On the Computational Hardness Needed for Quantum Cryptographysimons.berkeley.edu
- A Gentle Introduction to Yao's Garbled Circuitsweb.mit.edu
- 370.pdfeprint.iacr.org
- Weight-Sparse Circuits May Be Interpretable Yet Unfaithful — LessWronglesswrong.com
- Arithmetic Circuits for ZK | RareSkillsrareskills.io
- Towards Automated Circuit Discovery for Mechanistic Interpretabilityarxiv.org
- 293.pdfeprint.iacr.org
- 2402.12875arxiv.org
- Redirecting...cronokirby.com
- Mosaic: Practical Malicious Security for Garbled Circuits on Bitcoineprint.iacr.org