On the Necessary and Sufficient Assumptions for UC Computation

Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common reference string model, the uniform random string model and the key-registration authority model (KRA), and provide new results for all of them. Perhaps most interestingly we show that:

• Type: Journal
• Year: 2010
• Where: TCC
• Authors: Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi
• Keywords: Cryptology, KRA Model, Model, TCC 2010, UC Computation