254 search results - page 7 / 51 » On randomized one-round communication complexity |
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
SODA
2012
ACM
11 years 10 months 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 ...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
COCO
2004
Springer
14 years 1 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...