On the Necessary and Sufficient Assumptions for UC Computation

@article{Damgrd2009OnTN,
  title={On the Necessary and Sufficient Assumptions for UC Computation},
  author={Ivan Damg{\aa}rd and Jesper Buus Nielsen and Claudio Orlandi},
  journal={IACR Cryptology ePrint Archive},
  year={2009},
  volume={2009},
  pages={247}
}
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: – For even the minimal meaningful KRA, where we only assume that the secret key is a value which is hard to compute from the public key, one… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

Similar Papers

Loading similar papers…