Abstract
In this chapter we prove a fundamental result stating that secure multiparty computation that remains secure under concurrent general composition can be achieved, for any number of corrupted parties. That is, we consider an asynchronous multi-party network and an adversary that can adaptively corrupt as many parties as it wishes. We present protocols that allow any subset of parties in this setting to securely realize any desired functionality of their inputs, and be guaranteed that security is preserved regardless of the activity in the rest of the network. Our protocols are in the common reference string model and rely on standard intractability assumptions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lindell, Y. (2003). 4. Universally Composable Multi-party Computation. In: Composition of Secure Multi-Party Protocols. Lecture Notes in Computer Science, vol 2815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39819-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-39819-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20105-2
Online ISBN: 978-3-540-39819-6
eBook Packages: Springer Book Archive