no code implementations • 5 Dec 2019 • Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh
In this work, we present concretely-efficient protocols for secure $3$-party computation (3PC) over a ring of integers modulo $2^{\ell}$ tolerating one corruption, both with semi-honest and malicious security.