112 search results - page 2 / 23 » Rounds in Communication Complexity Revisited |
EUROCRYPT
2004
Springer
13 years 10 months 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...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
SPAA
2010
ACM
13 years 5 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
STOC
1995
ACM
13 years 8 months ago
1995
ACM
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...