Eduardo Soria-Vazquez

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We present a multi-party computation protocol in the case of dishonest majority which has very low round complexity. Our protocol sits philosophically between Gentry's Fully Homomorphic Encryption based protocol and the SPDZ-BMR protocol of Lindell et al (CRYPTO 2015). Our protocol avoids various inefficiencies of the previous two protocols. Compared to(More)
  • 1