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

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, round-complexity, and computational assumptions.

Authors

• Huijia Lin
• Rafael Pass
• Muthuramakrishnan Venkitasubramaniam

Keywords

• secure multi-party computation
• non-malleability
• universal composability