Recent improvements to garbled circuits are mainly focused on reducing their size. The state-
of-the-art construction of Rosulek and Roy (Crypto 2021) requires 1.5 κ bits for garbling AND …

Multiparty computation approaches to secure neural network inference commonly rely on
garbled circuits for securely executing nonlinear activation functions. However, garbled …

Garbling schemes are vital primitives for privacy-preserving protocols and secure two-party
computation. This paper presents a projective garbling scheme that assigns values to wires …

Garbled Circuit (GC) is a fundamental tool in cryptography, especially in secure multiparty
computation. Most garbling schemes follow a gate-by-gate paradigm. The communication …

We introduce a general template for building garbled circuits with low communication, under
the decisional composite residuosity (DCR) assumption. For the case of layered Boolean …

We present new techniques for garbling mixed arithmetic and boolean circuits, utilizing the
homomorphic secret sharing scheme introduced by Roy\& Singh (Crypto 2021), along with …