Paper 2013/267
Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction
S. Dov Gordon, Tal Malkin, Mike Rosulek, and Hoeteck Wee
Abstract
Halevi, Lindell, and Pinkas (CRYPTO 2011) recently proposed a model for secure computation that captures communication patterns that arise
in many practical settings, such as secure computation on the web. In their model, each party interacts only once, with a single centralized server. Parties do not interact with each other; in fact, the parties need not even be online simultaneously.
In this work we present a suite of new, simple and efficient protocols for secure computation in this "one-pass" model. We give protocols that obtain optimal privacy for the following general tasks:
-- Evaluating any multivariate polynomial
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Eurocrypt 2013.
- Keywords
- secure computation
- Contact author(s)
- sgordon @ appcomsci com
- History
- 2013-05-13: received
- Short URL
- https://ia.cr/2013/267
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/267, author = {S. Dov Gordon and Tal Malkin and Mike Rosulek and Hoeteck Wee}, title = {Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction}, howpublished = {Cryptology {ePrint} Archive, Paper 2013/267}, year = {2013}, url = {https://eprint.iacr.org/2013/267} }