A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
[chapter]
2016
Lecture Notes in Computer Science
All previous constructions of general multiparty computation protocols that are secure against adaptive corruptions in the concurrent setting either require some form of setup or non-standard assumptions. In this paper we provide the first general construction of secure multi-party computation protocol without any setup that guarantees composable security in the presence of an adaptive adversary based on standard polynomial-time assumptions. We prove security under the notion of "UC with
doi:10.1007/978-3-662-53641-4_16
fatcat:7mqiz66zhbax5iugapjuzgdoeq