13 search results - page 1 / 3 » Multiparty computation unconditionally secure against Q^2 ad... |
CORR
1999
Springer
13 years 4 months ago
1999
Springer
JOC
2000
13 years 4 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...