Sciweavers

Share
CTRSA
2009
Springer

Adaptively Secure Two-Party Computation with Erasures

11 years 6 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 (like privacy and correctness). An adaptively secure protocol is one in which the security properties are preserved even if an adversary can adaptively and dynamically corrupt parties during a computation. This provides a high level of security, that is arguably necessary in today’s world of active computer break-ins. Until now, the work on adaptively secure multiparty computation has focused almost exclusively on the setting of an honest majority, and very few works have considered the honest minority and two-party cases. In addition, significant computational and communication costs are incurred by most protocols that achieve adaptive security. In this work, we consider the two-party setting and assume that honest parties may erase data. We show that in this model it is possible to securely compute any two...
Andrew Y. Lindell
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where CTRSA
Authors Andrew Y. Lindell
Comments (0)
books