164 search results - page 5 / 33 » Covert two-party computation |
ASIACRYPT
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type...
CRYPTO
2005
Springer
14 years 29 days ago
2005
Springer
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
EUROCRYPT
2010
Springer
14 years 7 days ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
EUROCRYPT
2003
Springer
14 years 19 days ago
2003
Springer
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
ASIACRYPT
2005
Springer
14 years 29 days ago
2005
Springer
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...