Dishonest majority multi-party computation for binary circuits.(English)Zbl 1335.94064

Garay, Juan A. (ed.) et al., Advances in cryptology – CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17–21, 2014. Proceedings, Part II. Berlin: Springer (ISBN 978-3-662-44380-4/pbk). Lecture Notes in Computer Science 8617, 495-512 (2014).
Summary: We extend the Tiny-OT two party protocol of J. B. Nielsen et al. [Crypto 2012, Lect. Notes Comput. Sci. 7417, 681–700 (2012; Zbl 1296.94134)]. 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.
For the entire collection see [Zbl 1292.94001].

MSC:

 94A60 Cryptography 68P25 Data encryption (aspects in computer science)

Zbl 1296.94134
Full Text: