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`

.

##
###
Zero-knowledge from secure multiparty computation

2007
*
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07
*

A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multiparty computation allows n mutually suspicious players to jointly compute a function of their local inputs without revealing to any t corrupted players additional information beyond the output of the function. We present a new general connection between these two fundamental notions. Specifically, we present a general

doi:10.1145/1250790.1250794
dblp:conf/stoc/IshaiKOS07
fatcat:hrdpuvtowfe4vic5gqosrel2pe