6 search results - page 2 / 2 » Parallel Coin-Tossing and Constant-Round Secure Two-Party Co... |
PODC
2009
ACM
14 years 6 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...