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. © 2014 International Association for Cryptologic Research.
CITATION STYLE
Larraia, E., Orsini, E., & Smart, N. P. (2014). Dishonest majority multi-party computation for binary circuits. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8617 LNCS, pp. 495–512). Springer Verlag. https://doi.org/10.1007/978-3-662-44381-1_28
Mendeley helps you to discover research relevant for your work.