Toward Malicious Constant-Rate 2PC via Arithmetic Garbling

ePrint Report: Toward Malicious Constant-Rate 2PC via Arithmetic Garbling

Carmit Hazay, Yibin Yang

A recent work by Ball, Li, Lin, and Liu [Eurocrypt'23] presented a new instantiation of the arithmetic garbling paradigm introduced by Applebaum, Ishai, and Kushilevitz [FOCS'11]. In particular, Ball et al.'s garbling scheme is the first constant-rate garbled circuit over large enough bounded integer computations, inferring the first constant-round constant-rate secure two-party computation (2PC) over bounded integer computations in the presence of semi-honest adversaries.


The main source …

eprint report eurocrypt malicious paradigm rate report work