The garden-hose model

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 c>0. Finally, we show an interesting connection between the garden-hose model and the (in)security of a certain class of quantum position-verification schemes.

[1]  Satoshi Ishizaka,et al.  Quantum teleportation scheme by selecting one of multiple output ports , 2009, 0901.2975.

[2]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[3]  Pierre McKenzie,et al.  Reversible Space Equals Deterministic Space , 2000, J. Comput. Syst. Sci..

[4]  Mikhail Nesterenko,et al.  Secure Location Verification Using Radio Broadcast , 2004, IEEE Transactions on Dependable and Secure Computing.

[5]  Florian Speelman,et al.  Position-Based Quantum Cryptography and the Garden-Hose Game , 2012, ArXiv.

[6]  Robert A. Malaney,et al.  Location-dependent communications using quantum entanglement , 2010, 1003.0949.

[7]  Bart Preneel,et al.  Location verification using secure distance bounding protocols , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[8]  H. Lo,et al.  Insecurity of position-based quantum-cryptography protocols against entanglement attacks , 2010, 1009.2256.

[9]  Srdjan Capkun,et al.  Secure positioning of wireless devices with application to sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[10]  Rafail Ostrovsky,et al.  Position-Based Quantum Cryptography: Impossibility and Constructions , 2011, IACR Cryptol. ePrint Arch..

[11]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[12]  Avi Wigderson,et al.  Quantum vs. classical communication and computation , 1998, STOC '98.

[13]  David A. Wagner,et al.  Secure verification of location claims , 2003, WiSe '03.

[14]  A. Razborov Quantum communication complexity of symmetric predicates , 2002, quant-ph/0204025.

[15]  Periklis A. Papakonstantinou,et al.  Space-bounded communication complexity , 2013, ITCS '13.

[16]  Laurent Bussard Trust establishment protocols for communicating devices , 2004 .

[17]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[18]  Caslav Brukner,et al.  Mutually unbiased binary observable sets on N qubits , 2002 .

[19]  Serge Fehr,et al.  Position-Based Quantum Cryptography , 2011, ERCIM News.

[20]  Srdjan Capkun,et al.  Secure Localization with Hidden and Mobile Base Stations , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[22]  Adrian Kent,et al.  Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints , 2010, ArXiv.

[23]  Harry Buhrman,et al.  Position-Based Quantum Cryptography and the Garden-Hose Game , 2012 .

[24]  Rafail Ostrovsky,et al.  Position-Based Cryptography , 2014, SIAM J. Comput..

[25]  Satoshi Ishizaka,et al.  Asymptotic teleportation scheme as a universal programmable quantum processor. , 2008, Physical review letters.

[26]  Salman Beigi,et al.  Simplified instantaneous non-local quantum computation with applications to position-based cryptography , 2011, 1101.1065.

[27]  Alain Tapp,et al.  Quantum Entanglement and the Communication Complexity of the Inner Product Function , 1997, QCQC.

[28]  Robert A. Malaney,et al.  Quantum Location Verification in Noisy Channels , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[29]  Yuguang Fang,et al.  Secure localization and authentication in ultra-wideband sensor networks , 2006, IEEE Journal on Selected Areas in Communications.

[30]  Ran Raz,et al.  Exponential separations for one-way quantum communication complexity, with applications to cryptography , 2006, STOC '07.