Cryptology ePrint Archive: Report 2014/101

Dishonest Majority Multi-Party Computation for Binary Circuits

Enrique Larraia and Emmanuela Orsini and 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.

Category / Keywords: cryptographic protocols /

Original Publication (with major differences): IACR-CRYPTO-2014

Date: received 11 Feb 2014, last revised 2 Jun 2014

Contact author: Enrique LarraiadeVega at bristol ac uk,Emmanuela Orsini@bristol ac uk,nigel@cs bris ac uk

Available format(s): PDF | BibTeX Citation

Version: 20140602:095034 (All versions of this report)

Short URL: ia.cr/2014/101

Discussion forum: Show discussion | Start new discussion