## CryptoDB

### Paper: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation

Authors: Yehuda Lindell URL: http://eprint.iacr.org/2001/107 Search ePrint Search Google In this paper we show that any {\em two-party} functionality can be securely computed in a {\em constant number of rounds}, where security is obtained against malicious adversaries that may arbitrarily deviate from the protocol specification. This is in contrast to Yao's constant-round protocol that ensures security only in the face of semi-honest adversaries, and to its malicious adversary version that requires a polynomial number of rounds. In order to obtain our result, we present a constant-round protocol for secure coin-tossing of polynomially many coins (in parallel). We then show how this protocol can be used in conjunction with other existing constructions in order to obtain a constant-round protocol for securely computing any two-party functionality. On the subject of coin-tossing, we also present a constant-round {\em perfect} coin-tossing protocol, where by perfect'' we mean that the resulting coins are guaranteed to be statistically close to uniform (and not just pseudorandom).
##### BibTeX
@misc{eprint-2001-11519,
title={Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / Secure two-party computation, constant-round protocols, coin-tossing},
url={http://eprint.iacr.org/2001/107},
note={An extended abstract appeared at CRYPTO 2001. lindell@wisdom.weizmann.ac.il 12334 received 13 Dec 2001, last revised 9 Oct 2003},
author={Yehuda Lindell},
year=2001
}