|
Quantum Position Verification Protocols: Security and Practical Considerations| title | Quantum Position Verification Protocols: Security and Practical Considerations |
|---|
| start_date | 2024/11/19 |
|---|
| schedule | 11h |
|---|
| online | no |
|---|
| location_info | salle 3052 |
|---|
| summary | In this talk we will give an overview of the area of position verification protocols. In position verification, the idea is to use an individual's geographical location as a cryptographic credential. In a position-verification protocol, the limitations imposed by the speed of light, as described by special relativity, are used to verify that a party is at their claimed location. This task has been shown to be impossible to implement using only classical information. Initially, the hope was that using quantum information we could construct secure quantum position verification (QPV) protocols. However, it has been shown that any QPV protocol can be broken by attackers that use an amount of entanglement exponential in the input size.
Thus, unconditionally-secure quantum position-verification protocols do not exist. From a practical point of view, not all is lost. The exponential upper bound for a general attack is still astronomically large for only a relatively small input. Thus, we can still hope for practically secure QPV protocols. This raises the problem of designing protocols that are secure in a practical setting. In this talk we will present an overview of the field and present some proposed protocols and discuss their advantages and drawbacks. We will also discuss the best known entanglement bounds. |
|---|
| responsibles | Szabó |
|---|
Workflow history| from state (1) | to state | comment | date |
|---|
| submitted | published | | 2024/11/15 14:50 UTC |
| |
|