Name
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. |
Year | Venue | Field |
|---|---|---|
2012 | CoRR | Quantum complexity theory,No-teleportation theorem,Discrete mathematics,Cryptography,Theoretical computer science,Quantum cryptography,Lattice-based cryptography,Qubit,Quantum channel,Mathematics,Quantum network |
DocType | Volume | Citations |
Journal | abs/1210.4353 | 3 |
PageRank | References | Authors |
0.44 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Florian Speelman | 1 | 44 | 5.61 |