91 search results - page 6 / 19 » Multiparty Communication Complexity of Disjointness |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. This paper proposes a global escape mechanism which can handle unexpected or unwanted conditions changing the default execution of distributed communicational flows, pres...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
EUROCRYPT
2004
Springer
14 years 28 days ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
CSFW
2009
IEEE
14 years 2 months ago
2009
IEEE
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
SACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...