A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Dishonest Majority Multi-Party Computation for Binary Circuits
[chapter]
2014
Lecture Notes in Computer Science
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, in the random oracle model, which in turn leads to a more efficient two party protocol than that of Nielsen et al.
doi:10.1007/978-3-662-44381-1_28
fatcat:nmsve4zccfblvctcenwg5x5lza