26 search results - page 2 / 6 » Efficient Two Party and Multi Party Computation Against Cove... |
TCC
2009
Springer
14 years 11 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...
IACR
2011
12 years 10 months ago
2011
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit o...
CRYPTO
2001
Springer
14 years 3 months ago
2001
Springer
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
CTRSA
2008
Springer
14 years 19 days 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...
CRYPTO
2010
Springer
13 years 12 months ago
2010
Springer
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...