On the Necessary and Sufficient Assumptions for UC Computation
Lists
Only you see this
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:
BibTeX
@inproceedings{damgard2010necessary,
author = {Ivan Damgård and Jesper Buus Nielsen and Claudio Orlandi},
title = {{On the Necessary and Sufficient Assumptions for UC Computation}},
booktitle = {TCC},
year = {2010},
doi = {10.1007/978-3-642-11799-2\_8},
}