[Resource Topic] 2002/140: Universally Composable Two-Party and Multi-Party Secure Computation

Welcome to the resource topic for 2002/140

Universally Composable Two-Party and Multi-Party Secure Computation

Authors: Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai


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.

ePrint: https://eprint.iacr.org/2002/140

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .