Feb. 2, 2024, 8:42 a.m. |

IACR News www.iacr.org

ePrint Report: Efficient Arithmetic in Garbled Circuits

David Heath


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 $\lambda$ denote a computational security parameter, and consider the integers $\mathbb{Z}_m$ for any $m \geq 2$. Let $\ell = \lceil \log_2 m \rceil$ …

correlation eprint report free hashes interest report techniques work xor

Solution Architect H/F

@ Exotec | Lille, Hauts-de-France, France

Chef de projet Sécurité SI

@ Alter Solutions | Paris, France

Audit Manager / Sr Audit Manager IT - 90379779 - Washington

@ Amtrak | Washington, DC, US, 20002

Auditor IT - 90379778 - Washington

@ Amtrak | Washington, DC, US, 20002

1210/ 1241/ 1155 - Senior Network Engineer

@ Sigma Defense | San Diego, California, United States

SharePoint Cloud Administrator

@ Resource Management Concepts, Inc. | Dahlgren, Virginia, United States