112 search results - page 1 / 23 » Rounds in Communication Complexity Revisited |
STOC
1991
ACM
13 years 8 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
TCC
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Dining cryptographers networks (or DC-nets) are a privacypreserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic D...
SACRYPT
2009
Springer
13 years 11 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...
CRYPTO
2009
Springer
13 years 8 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...