[Resource Topic] 2014/101: Dishonest Majority Multi-Party Computation for Binary Circuits

Welcome to the resource topic for 2014/101

Title:
Dishonest Majority Multi-Party Computation for Binary Circuits

Authors: Enrique Larraia, Emmanuela Orsini, Nigel P. Smart

Abstract:

We extend the Tiny-OT two party protocol of Nielsen et al (CRYPTO 2012) to the case of n parties in the dishonest majority setting. This is done by presenting a novel way of transferring pairwise authentications into global authentications. As a by product we obtain a more efficient manner of producing globally authenticated shares, which in turn leads to a more efficient two party protocol than that of Nielsen et al.

ePrint: https://eprint.iacr.org/2014/101

Talk: https://www.youtube.com/watch?v=Vc7ATNiY72M

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .