Sciweavers

3 search results - page 1 / 1
» Adaptively Secure Two-Party Computation with Erasures
Sort
View
CTRSA
2009
Springer
179views Cryptology» more  CTRSA 2009»
13 years 10 months ago
Adaptively Secure Two-Party Computation with Erasures
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
Andrew Y. Lindell
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
13 years 9 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
14 years 4 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...