Paper 2024/139
Efficient Arithmetic in Garbled Circuits
Abstract
Garbled Circuit (GC) techniques usually work with Boolean circuits. Despite intense interest, efficient arithmetic generalizations of GC were only known from heavy assumptions, such as LWE.
We construct arithmetic garbled circuits from circular correlation robust hashes, the assumption underlying the celebrated Free XOR garbling technique. Let
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in EUROCRYPT 2024
- Keywords
- Secure Multiparty ComputationGarbled CircuitsArithmetic Circuits
- Contact author(s)
- daheath @ illinois edu
- History
- 2024-02-02: approved
- 2024-01-31: received
- See all versions
- Short URL
- https://ia.cr/2024/139
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/139, author = {David Heath}, title = {Efficient Arithmetic in Garbled Circuits}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/139}, year = {2024}, url = {https://eprint.iacr.org/2024/139} }