71 search results - page 5 / 15 » Round-Optimal Secure Two-Party Computation |
EUROCRYPT
2003
Springer
14 years 2 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...
EUROCRYPT
2007
Springer
13 years 10 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...
AINA
2007
IEEE
14 years 1 months ago
2007
IEEE
CRYPTO
2005
Springer
14 years 12 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 ...
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We consider a new model for online secure computation on encrypted inputs in the presence of malicious adversaries. The inputs are independent of the circuit computed in the sense ...