111 search results - page 12 / 23 » Errors in Computational Complexity Proofs for Protocols |
IM
2007
14 years 11 months ago
2007
Abstract—We investigate the use of gossip protocols for continuous monitoring of network-wide aggregates under crash failures. Aggregates are computed from local management varia...
ICNP
1999
IEEE
15 years 2 months ago
1999
IEEE
Forward Error Correction (FEC) has been proposed as a technique for implementing efficient reliable multicast (RM). However, FEC incurs costs in encode/decode delay and implementa...
ACSC
2008
IEEE
15 years 4 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
119
click to vote
SODA
2012
ACM
13 years 8 days ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
ASIACRYPT
2007
Springer
15 years 1 months ago
2007
Springer
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...