A unified framework for concurrent security: Universal composability from stand-alone non-malleability

Huijia Lin*, Rafael Pass, Muthuramakrishnan Venkitasubramaniam

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a unified framework for obtaining Universally Composable (UC) protocols by relying on stand-alone secure non-malleable commitments. Essentially all results on concurrent secure computation|both in relaxed models (e.g., quasi-polynomial time simulation), or with trusted set-up assumptions (e.g., the CRS model, the imperfect CRS model, or the timing model)- are obtained as special cases of our framework. This not only leads to conceptually simpler solutions, but also to improved set-up assumptions, roundcomplexity, and computational assumptions. Additionally, this framework allows us to consider new relaxed models of security: we show that UC security where the adversary is a uniform PPT but the simulator is allowed to be a non-uniform PPT (i.e., essentially, traditional UC security, but with a non-uniform reduction) is possible without any trusted set-up. This gives the first results on concurrent secure computation without set-up, which can be used for securely computing "computationallysensitive" functionalities (e.g., data-base queries, "proof of work"-protocols, or playing bridge on the Internet).

Original languageEnglish
Title of host publicationSTOC'09 - Proceedings of the 2009 ACM International Symposium on Theory of Computing
Pages179-188
Number of pages10
DOIs
StatePublished - 2009
Externally publishedYes
Event41st Annual ACM Symposium on Theory of Computing, STOC '09 - Bethesda, MD, United States
Duration: 31 May 20092 Jun 2009

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference41st Annual ACM Symposium on Theory of Computing, STOC '09
Country/TerritoryUnited States
CityBethesda, MD
Period31/05/092/06/09

Keywords

  • Non-malleability
  • Secure multi-party computation
  • Universal composability

Fingerprint

Dive into the research topics of 'A unified framework for concurrent security: Universal composability from stand-alone non-malleability'. Together they form a unique fingerprint.

Cite this