83 search results - page 3 / 17 » Efficient Two-Party Secure Computation on Committed Inputs |
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 ...
TCC
2009
Springer
14 years 8 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...
CRYPTO
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
EUROCRYPT
2003
Springer
14 years 23 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...
AC
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...