MonZa: Fast Maliciously Secure Two Party Computation on Z_{2^k}, by Dario Catalano and Mario Di Raimondo and Dario Fiore and Irene Giacomelli

Published: 16/05/2019
MonZa: Fast Maliciously Secure Two Party Computation on Z_{2^k}, by Dario Catalano and Mario Di Raimondo and Dario Fiore and Irene Giacomelli
Source: EPRINT.IACR.ORG

In this paper we present a new 2-party protocol for secure computation over rings of the form $\mathbb{Z}_{2^k}$. As many recent efficient MPC protocols supporting dishonest majority, our protocol consists of a heavier (input-independent) pre-processing phase and a very efficient online stage. Our offline phase is similar to BeDOZa (Bendlin et al. Eurocrypt 2011) but employs Joye-Libert (JL, Euro

Read more
Related news
Comment
Latest in blog
FACEBOOK