Paper 2011/240

Universal Composability from Essentially Any Trusted Setup

Mike Rosulek


It is impossible to securely carry out general multi-party computation in arbitrary network contexts like the Internet, unless protocols have access to some trusted setup. In this work we classify the power of such trusted (2-party) setup functionalities. We show that nearly every setup is either {\bf useless} (ideal access to the setup is equivalent to having no setup at all) or else {\bf complete} (composably secure protocols for {\em all} tasks exist in the presence of the setup). We further argue that those setups which are neither complete nor useless are highly unnatural. The main technical contribution in this work is an almost-total characterization of completeness for 2-party setups. Our characterization treats setup functionalities as black-boxes, and therefore is the first work to classify completeness of {\em arbitrary setup functionalities} (i.e., randomized, reactive, and having behavior that depends on the global security parameter).

Available format(s)
Publication info
Published elsewhere. Extended abstract appears in CRYPTO 2012
universal compositionmulti-party computation
Contact author(s)
mikero @ cs umt edu
2012-05-31: last of 2 revisions
2011-05-18: received
See all versions
Short URL
Creative Commons Attribution


      author = {Mike Rosulek},
      title = {Universal Composability from Essentially Any Trusted Setup},
      howpublished = {Cryptology ePrint Archive, Paper 2011/240},
      year = {2011},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.