Adaptive and Concurrent Secure Computation From New Notions of Non-Malleability
The authors present a unified framework for obtaining general secure computation that achieves adaptive-Universally Composable (UC)-security. Their framework captures essentially all previous results on adaptive concurrent secure computation, both in relaxed models (e.g., quasi-polynomial time simulation), as well as trusted setup models (e.g., the CRS model, the imperfect CRS model). This provides conceptual simplicity and insight into what is required for adaptive and concurrent security, as well as yielding improvements to set-up assumptions and/or computational assumptions. Moreover, using their framework they provide first constructions of concurrent secure computation protocols that are adaptively secure in the timing model, and in the non-uniform simulation model.