71 search results - page 15 / 15 » Round-Optimal Secure Two-Party Computation |
125
click to vote
PODC
2009
ACM
16 years 3 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...