Sciweavers

PODC
2015
ACM
8 years 6 months ago
How Fair is Your Protocol?: A Utility-based Approach to Protocol Optimality
In his seminal result, Cleve [STOC’86] established that secure distributed computation— guaranteeing fairness—is impossible in the presence of dishonest majorities. A genero...
Juan A. Garay, Jonathan Katz, Björn Tackmann,...
PODC
2015
ACM
8 years 6 months ago
Algebraic Methods in the Congested Clique
In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multipl...
Keren Censor-Hillel, Petteri Kaski, Janne H. Korho...