Cryptology ePrint Archive: Report 2002/140

Universally Composable Two-Party and Multi-Party Secure Computation

Ran Canetti and Yehuda Lindell and Rafail Ostrovsky and Amit Sahai

Abstract: We show how to securely realize any two-party and multi-party functionality in a {\em universally composable} way, regardless of the number of corrupted participants. That is, we consider an asynchronous multi-party network with open communication and an adversary that can adaptively corrupt as many parties as it wishes. In this setting, our protocols allow any subset of the parties (with pairs of parties being a special case) to securely realize any desired functionality of their local inputs, and be guaranteed that security is preserved regardless of the activity in the rest of the network. This implies that security is preserved under concurrent composition of an unbounded number of protocol executions, it implies non-malleability with respect to arbitrary protocols, and more. Our constructions are in the common reference string model and rely on standard intractability assumptions.

Category / Keywords: foundations / two-party and multi-party computation, secure composition of protocols, proofs of security

Publication Info: An extended abstract of this paper appeared in STOC 2002.

Date: received 13 Sep 2002, last revised 14 Jul 2003

Contact author: lindell at us ibm com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: This is a full version of the paper.

Version: 20030714:190611 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]