Universally composable two-party and multi-party secure computation

Ran Canetti*, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

Abstract

We show how to securely realize any multi-party functionality in a universally composable way, regardless of the number of corrupted participants. That is, we consider a 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 make general intractability assumptions.

Original languageEnglish
Pages (from-to)494-503
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - 2002
Externally publishedYes
EventProceedings of the 34th Annual ACM Symposium on Theory of Computing - Montreal, Que., Canada
Duration: 19 May 200221 May 2002

Fingerprint

Dive into the research topics of 'Universally composable two-party and multi-party secure computation'. Together they form a unique fingerprint.

Cite this