Position-Based Quantum Cryptography and the Garden-Hose Game
Quantum Physics
2012-10-17 v1 Cryptography and Security
Abstract
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 position-based quantum cryptography to traditional complexity theory.
Keywords
Cite
@article{arxiv.1210.4353,
title = {Position-Based Quantum Cryptography and the Garden-Hose Game},
author = {Florian Speelman},
journal= {arXiv preprint arXiv:1210.4353},
year = {2012}
}
Comments
MSc Thesis for University of Amsterdam, the Netherlands, 2011, 34 pages