The garden-hose model

ABSTRACT

We define a new model of communication complexity, called the garden-hose model. Informally, the garden-hose complexity of a function f:{0,1}ⁿ x {0,1}ⁿ -> {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}ⁿ and, similarly, Bob connects his ends of the pipes in a way that is determined solely by his input y ∈ {0,1}ⁿ. 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 n^c 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.

References

1. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Foundations of Computer Science, 1986., 27th Annual Symposium on, pages 337--347, 1986.
2. S. Beigi and R. König. Simplified instantaneous non-local quantum computation with applications to position-based cryptography. New Journal of Physics, 13(9):093036, 2011.
3. S. Brands and D. Chaum. Distance-bounding protocols. In EUROCRYPT'93, pages 344--359. Springer, 1994.
4. J. Brody, S. Chen, P. A. Papakonstantinou, H. Song, and X. Sun. Space-bounded communication complexity. to appear at ITCS 2013, 2012.
5. H. Buhrman, N. Chandran, S. Fehr, R. Gelles, V. Goyal, R. Ostrovsky, and C. Schaffner. Position-based quantum cryptography: Impossibility and constructions. In P. Rogaway, editor, Advances in Cryptology - CRYPTO 2011, volume 6841 of Lecture Notes in Computer Science, pages 429--446. Springer Berlin / Heidelberg, 2011.
6. H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, STOC '98, pages 63--68, New York, NY, USA, 1998. ACM.
7. L. Bussard. Trust Establishment Protocols for Communicating Devices. PhD thesis, Eurecom-ENST, 2004.
8. S. Capkun, M. Cagalj, and M. Srivastava. Secure localization with hidden and mobile base stations. In IEEE INFOCOM, 2006.
9. S. Capkun and J.-P. Hubaux. Secure positioning of wireless devices with application to sensor networks. In IEEE INFOCOM, pages 1917--1928, 2005.
10. N. Chandran, S. Fehr, R. Gelles, V. Goyal, and R. Ostrovsky. Position-based quantum cryptography. arXiv:1005.1750v2, May 2010.
11. N. Chandran, V. Goyal, R. Moriarty, and R. Ostrovsky. Position based cryptography. In CRYPTO 2009, pages 391--407. Springer, 2009.
12. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230--261, Apr. 1988.
13. R. Cleve, W. v. Dam, M. Nielsen, and A. Tapp. Quantum entanglement and the communication complexity of the inner product function. In Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications, QCQC '98, pages 61--74. Springer-Verlag, 1998.
14. D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf. Exponential separations for one-way quantum communication complexity, with applications to cryptography. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, STOC '07, pages 516--525, New York, NY, USA, 2007. ACM.
15. S. Ishizaka and T. Hiroshima. Asymptotic teleportation scheme as a universal programmable quantum processor. Phys. Rev. Lett., 101(24):240501, Dec 2008.
16. S. Ishizaka and T. Hiroshima. Quantum teleportation scheme by selecting one of multiple output ports. Phys. Rev. A, 79(4):042306, Apr 2009.
17. A. Kent, W. Munro, T. Spiller, and R. Beausoleil. Tagging systems, 2006. US patent nr 2006/0022832.
18. A. Kent, W. J. Munro, and T. P. Spiller. Quantum tagging: Authenticating location via quantum information and relativistic signaling constraints. Phys. Rev. A, 84:012326, Jul 2011.
19. K.-J. Lange, P. McKenzie, and A. Tapp. Reversible space equals deterministic space. In Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, pages 45--50. IEEE Comput. Soc, Apr. 1997.
20. H.-K. Lau and H.-K. Lo. Insecurity of position-based quantum-cryptography protocols against entanglement attacks. Phys. Rev. A, 83(1):012322, Jan 2011.
21. R. A. Malaney. Location-dependent communications using quantum entanglement. Phys. Rev. A, 81(4):042319, Apr 2010.
22. R. A. Malaney. Quantum location verification in noisy channels. In GLOBECOM'10, pages 1--6, 2010. arXiv:1004.4689v1.
23. O. Margalit and A. Matsliah. Mage - the CDCL SAT solver developed and used by IBM for formal verification http://ibm.co/P7qNpC. personal communication, 2012.
24. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge university press, 2000.
25. K. Pietrzak. personal communication, 2011.
26. A. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya Mathematics, 67(1):145--159, 2003.
27. N. Sastry, U. Shankar, and D. Wagner. Secure verification of location claims. In WiSe'03, pages 1--10, 2003.
28. D. Singelee and B. Preneel. Location verification using secure distance bounding protocols. In IEEE MASS'10, 2005.
29. F. Speelman. Position-based quantum cryptography and the garden-hose game. Master's thesis, University of Amsterdam, 2011. arxiv:1210.4353.
30. A. Vora and M. Nesterenko. Secure location verification using radio broadcast. In OPODIS'04, pages 369--383, 2004.
31. Y. Zhang, W. Liu, Y. Fang, and D. Wu. Secure localization and authentication in ultra-wideband sensor networks. IEEE Journal on Selected Areas in Communications, 24:829--835, 2006.

Index Terms

• Security and privacy

  • Cryptography

    • Mathematical foundations of cryptography

• Theory of computation

  • Computational complexity and cryptography

    • Communication complexity