Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

111

Voted

TCC
2010
Springer

133views Cryptology» more TCC 2010»

On the Necessary and Sufficient Assumptions for UC Computation

15 years 17 days ago

On the Necessary and Sufficient Assumptions for UC Computation

Download eprint.iacr.org

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:

Ivan Damgård, Jesper Buus Nielsen, Claudio O

Real-time Traffic

Cryptology | KRA Model | Model | TCC 2010 | UC Computation |

claim paper

Related Content

» On Convergence of Concurrent Systems under Regular Interactions

» Identification of Joint Interventional Distributions in Recursive SemiMarkovian Causal Mod...

» Coffee maker patterns and the design of energy feedback artefacts

» On the computing power of fuzzy Turing machines

» SemiSupervised Cross Feature Learning for Semantic Concept Detection in Videos

» A unified framework for the bottleneck analysis of multiclass queueing networks

» A knowledgebased analysis of global function computation

» Optimal Admission Control of Discrete Event Systems with RealTime Constraints

» TelegraphCQ Continuous Dataflow Processing

Post Info
More Details (n/a)

Added	15 Feb 2011
Updated	15 Feb 2011
Type	Journal
Year	2010
Where	TCC
Authors	Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi

Comments (0)