A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
[chapter]

2010
*
Lecture Notes in Computer Science
*

We study the following two related questions: -What are the minimal computational resources required for general secure multiparty computation in the presence of an honest majority? -What are the minimal resources required for two-party primitives such as zero-knowledge proofs and general secure two-party computation? We obtain a nearly tight answer to the first question by presenting a perfectly secure protocol which allows n players to evaluate an arithmetic circuit of size s by performing a

doi:10.1007/978-3-642-13190-5_23
fatcat:fwuhrsowirfmdli5726lvixrqi