On the Feasibility of Sliced Garbling

ePrint Report: On the Feasibility of Sliced Garbling

Tomer Ashur, Carmit Hazay, Rahul Satish

Garbling schemes are one of the most fundamental objects in cryptography and have been studied extensively due to their broad applicability. The state-of-the-art is a construction in which XOR gates are free and AND gates require $3\kappa/2+\mathcal{O}(1)$ bits per gate, due to Rosulek and Roy (CRYPTO'21). An important technique in their garbling is slicing, which partitions the labels into two equal-length slices. In this paper, we …

art bits construction cryptography eprint report free report state xor