The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography

Details The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography

2011-09-12

arxiv.org/abs/1109.2563v2

Physics

Quantum Physics

19 pages, 1 figure, accepted at QCRYPT 2011. v2: fixed problem with missing references, no changes in content

Scientific paper

We study position-based cryptography in the quantum setting. We examine a class of protocols that only require the communication of a single qubit and 2n bits of classical information. To this end, we define a new model of communication complexity, the garden-hose model, which enables us to prove upper bounds on the number of EPR pairs needed to attack such schemes. This model furthermore opens up a way to link the security of quantum position-based cryptography to traditional complexity theory.

Affiliated with

Also associated with

No associations

Rating

The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-60687