621 search results - page 5 / 125 » Efficient Secure Multi-party Computation |
EUROCRYPT
2003
Springer
14 years 20 days ago
2003
Springer
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
INDOCRYPT
2003
Springer
14 years 19 days ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
SCN
2008
Springer
13 years 7 months ago
2008
Springer
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
OOPSLA
2010
Springer
13 years 5 months ago
2010
Springer
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...