Sciweavers

CRYPTO
2001
Springer
144views Cryptology» more  CRYPTO 2001»
13 years 8 months ago
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
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...
Yehuda Lindell