71 search results - page 3 / 15 » Round-Optimal Secure Two-Party Computation |
TCC
2009
Springer
14 years 7 months ago
2009
Springer
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
EUROCRYPT
2008
Springer
13 years 8 months ago
2008
Springer
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
FOCS
2003
IEEE
14 years 4 days ago
2003
IEEE
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...
EUROCRYPT
2003
Springer
14 years 2 days ago
2003
Springer
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...
CTRSA
2008
Springer
13 years 8 months ago
2008
Springer
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...