Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Quantum Entanglement and the Communication Complexity of the Inner Product Function
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Reversible Space Equals Deterministic Space
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Secure verification of location claims
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Position-based quantum cryptography: impossibility and constructions
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Secure location verification using radio broadcast
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Secure localization and authentication in ultra-wideband sensor networks
IEEE Journal on Selected Areas in Communications - Part 1
Space-bounded communication complexity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Hi-index | 0.00 |
We define a new model of communication complexity, called the garden-hose model. Informally, the garden-hose complexity of a function f:{0,1}n x {0,1}n - {0,1} is given by the minimal number of water pipes that need to be shared between two parties, Alice and Bob, in order for them to compute the function f as follows: Alice connects her ends of the pipes in a way that is determined solely by her input x ∈ {0,1}n and, similarly, Bob connects his ends of the pipes in a way that is determined solely by his input y ∈ {0,1}n. Alice turns on the water tap that she also connected to one of the pipes. Then, the water comes out on Alice's or Bob's side depending on the function value f(x,y). We prove almost-linear lower bounds on the garden-hose complexity for concrete functions like inner product, majority, and equality, and we show the existence of functions with exponential garden-hose complexity. Furthermore, we show a connection to classical complexity theory by proving that all functions computable in log-space have polynomial garden-hose complexity. We consider a randomized variant of the garden-hose complexity, where Alice and Bob hold pre-shared randomness, and a quantum variant, where Alice and Bob hold pre-shared quantum entanglement, and we show that the randomized garden-hose complexity is within a polynomial factor of the deterministic garden-hose complexity. Examples of (partial) functions are given where the quantum garden-hose complexity is logarithmic in n while the classical garden-hose complexity can be lower bounded by nc for constant c0. Finally, we show an interesting connection between the garden-hose model and the (in)security of a certain class of quantum position-verification schemes.