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
- A Gentle Introduction to Yao's Garbled Circuitsweb.mit.edu
- A High-Level Technical Overview of Fully Homomorphic Encryption || Math ∩ Programmingjeremykun.com
- Redirecting...cronokirby.com
- Arithmetic Circuits for ZK | RareSkillsrareskills.io
- Secure multi-party computation - Wikipediaen.wikipedia.org
- VROOM: Accelerating (Almost All) Number-Theoretic Cryptography Using Vectorization and the Residue Number Systemeprint.iacr.org
- Homomorphic encryption - Wikipediaen.wikipedia.org
- Mosaic: Practical Malicious Security for Garbled Circuits on Bitcoineprint.iacr.org
- ch3-fundamentalprotocols.pdfsecurecomputation.org
- Pearl Whitepaperpearlresearch.ai
- Honey I SNARKED the GPT - EZKL Blogblog.ezkl.xyz