860 search results - page 5 / 172 » Completeness in two-party secure computation: a computationa... |
EUROCRYPT
2003
Springer
15 years 3 months 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...
EUROCRYPT
2007
Springer
15 years 1 months ago
2007
Springer
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this...
CRYPTO
2005
Springer
15 years 3 months 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 ...
ASIACRYPT
2004
Springer
15 years 3 months 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...
103
click to vote
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. A two-argument function is computed privately by two parties if after the computation, no party should know anything about the other inputs except for what he is able to ...