Sciweavers

STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 3 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass