164 search results - page 3 / 33 » Covert two-party computation |
FOCS
2003
IEEE
13 years 11 months 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...
CTRSA
2009
Springer
14 years 1 months ago
2009
Springer
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...
CRYPTO
2007
Springer
14 years 16 days ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
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...
EUROCRYPT
2003
Springer
13 years 11 months 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...