2012/10/16 by Florian Speelman, Speelman, Florian
Computer Science · Physics and Astronomy · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #cs.CR #quant-ph
paper · pdf · doi:10.48550/arxiv.1210.4353
MSc Thesis for University of Amsterdam, the Netherlands, 2011, 34 pages
arxiv created 2012/10/16 · openalex publication_date 2012/10/16 · arxiv updated 2012/10/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.