28 search results - page 1 / 6 » An Efficient Protocol for Secure Two-Party Computation in th... |
EUROCRYPT
2007
Springer
13 years 8 months ago
2007
Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
SCN
2008
Springer
13 years 4 months ago
2008
Springer
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
EUROCRYPT
2008
Springer
13 years 6 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...
CTRSA
2008
Springer
13 years 6 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...
TCC
2009
Springer
14 years 5 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...