CryptoDB
Almost-Asynchronous MPC with Faulty Minority
Authors: | |
---|---|
Download: | |
Abstract: |
Secure multiparty computation (MPC) allows a set of parties to
securely evaluate any agreed function of their inputs, even when up
to $t$ of the $n$ parties are faulty. Protocols for synchronous
networks (where every sent message is assumed to arrive within a
constant time) tolerate up to $t |
BibTeX
@misc{eprint-2008-18118, title={Almost-Asynchronous MPC with Faulty Minority}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / Multiparty computation}, url={http://eprint.iacr.org/2008/416}, note={ buus@daimi.au.dk 14155 received 29 Sep 2008, last revised 3 Oct 2008}, author={Zuzana Beerliová-Trubíniová and Martin Hirt and Jesper Buus Nielsen}, year=2008 }