Studies in Secure Multiparty Computation and Applications (1996)
Cached
Download Links
- [theory.lcs.mit.edu]
- [theory.lcs.mit.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 72 - 6 self |
BibTeX
@MISC{Canetti96studiesin,
author = {Ran Canetti},
title = {Studies in Secure Multiparty Computation and Applications},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Consider a set of parties who do not trust each other, nor the channels by which they communicate. Still, the parties wish to correctly compute some common function of their local inputs, while keeping their local data as private as possible. This, in a nutshell, is the problem of secure multiparty computation. This problem is fundamental in cryptography and in the study of distributed computations. It takes many different forms, depending on the underlying network, on the function to be computed, and on the amount of distrust the parties have in each other and in the network. We study several aspects of secure multiparty computation. We first present new definitions of this problem in various settings. Our definitions draw from previous ideas and formalizations, and incorporate aspects that were previously overlooked. Next we study the problem of dealing with adaptive adversaries. (Adaptive adversaries are adversaries that corrupt parties during the course of the computation, based on...
