Sciweavers

686 search results - page 4 / 138
» Secure Two-Party Computation Is Practical
Sort
View
FOCS
2003
IEEE
15 years 2 months ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
EUROCRYPT
2003
Springer
15 years 2 months ago
Fair Secure Two-Party Computation
Abstract Benny Pinkas HP Labs Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any sub...
Benny Pinkas
CTRSA
2008
Springer
134views Cryptology» more  CTRSA 2008»
14 years 11 months ago
An Efficient Protocol for Fair Secure Two-Party Computation
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...
Mehmet S. Kiraz, Berry Schoenmakers
124
Voted
TCC
2012
Springer
245views Cryptology» more  TCC 2012»
13 years 5 months ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
95
Voted
ASIACRYPT
2005
Springer
15 years 3 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov