Paper 2012/441
Adaptively Secure Multi-Party Computation with Dishonest Majority
Sanjam Garg and Amit Sahai
Abstract
Adaptively secure multiparty computation is an essential and fundamental notion in cryptography. In this work we focus on the basic question of constructing a multiparty computation protocol secure against a \emph{malicious}, \emph{adaptive} adversary in the \emph{stand-alone} setting without assuming an honest majority, in the plain model. It has been believed that this question can be resolved by composing known protocols from the literature. We show that in fact, this belief is fundamentally mistaken. In particular, we show:
\begin{itemize}
\item[-]\textbf{Round inefficiency is unavoidable when using black-box simulation:} There does not exist any
Note: Full version of CRYPTO 2012 paper.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- adaptive security
- Contact author(s)
- sanjamg @ cs ucla edu
- History
- 2012-08-05: received
- Short URL
- https://ia.cr/2012/441
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/441, author = {Sanjam Garg and Amit Sahai}, title = {Adaptively Secure Multi-Party Computation with Dishonest Majority}, howpublished = {Cryptology {ePrint} Archive, Paper 2012/441}, year = {2012}, url = {https://eprint.iacr.org/2012/441} }