Sciweavers

CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Robustness for Free in Unconditional Multi-party Computation
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/...
Martin Hirt, Ueli M. Maurer