Paper 2008/465
Secure Arithmetic Computation with No Honest Majority
Yuval Ishai, Manoj Prabhakaran, and Amit Sahai
Abstract
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case of {\em two-party} protocols with security against {\em malicious} parties, our main goals are to: (1) only make black-box calls to the ring operations and standard cryptographic primitives, and (2) minimize the number of such black-box calls as well as the communication overhead.
We present several solutions which differ in their efficiency, generality, and underlying intractability assumptions. These include:
\begin{itemize}
\item An {\em unconditionally secure} protocol in the OT-hybrid model which makes a black-box use of an arbitrary ring
Note: more editorial fixes
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Full version of a paper under submission
- Keywords
- multi-party computationarithmetic circuitsblack-box rings
- Contact author(s)
- mmp @ cs uiuc edu
- History
- 2008-11-10: received
- Short URL
- https://ia.cr/2008/465
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2008/465, author = {Yuval Ishai and Manoj Prabhakaran and Amit Sahai}, title = {Secure Arithmetic Computation with No Honest Majority}, howpublished = {Cryptology {ePrint} Archive, Paper 2008/465}, year = {2008}, url = {https://eprint.iacr.org/2008/465} }