Paper 2014/101 Original: eprint.iacr.org/2014/101 ↗
Dishonest Majority Multi-Party Computation for Binary Circuits
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2014-06-02: last updated
- 2014-02-14: published
- Short URL
- https://ia.cr/2014/101
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/101,
author = {Enrique Larraia and Emmanuela Orsini and Nigel P. Smart},
title = {Dishonest Majority Multi-Party Computation for Binary Circuits},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/101},
year = {2014},
url = {https://eprint.iacr.org/2014/101}
}