8
collaborators
2022–2025
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
4 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Quantum position verification in one shot: parallel repetition of the f-BB84 and f-routing protocols | TQC 2025 | regular | Florian Speelman |
| Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss | QIP 2024 | regular | ▸Rene Allerstorfer, Andreas Bluhm, Harry Buhrman, Matthias Christandl, Florian Speelman, Philip Verduyn Lunel |
| Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers | QCRYPT 2023 | regular ▸ presenter | Florian Speelman |
We give a tight characterization of the relation between loss-tolerance and error rate of the most popular protocol for quantum position verification (QPV), which is based on BB84 states, and generalizations of this protocol. Combining it with classical information, we show for the first time a fault-tolerant protocol that is secure against attackers who pre-share a linear amount of entanglement (in the classical information), arbitrarily slow quantum information and that tolerates a certain amount of photon loss. We also extend this analysis to the case of more than two bases, showing even stronger loss-tolerance for that case. Finally, we show that our techniques can be applied to improve the analysis of one-sided device-independent QKD protocols. |
|||
|
Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers ↗
|
TQC 2023 | regular | Florian Speelman |
We give a tight characterization of the relation between loss-tolerance and error rate of the most popular protocol for quantum position verification (QPV), which is based on BB84 states, and generalizations of this protocol. Combining it with classical information, we show for the first time a fault-tolerant protocol that is secure against attackers who pre-share a linear amount of entanglement (in the classical information), arbitrarily slow quantum information and that tolerates a certain amount of photon loss. We also extend this analysis to the case of more than two bases, showing even stronger loss-tolerance for that case. Finally, we show that our techniques can be applied to improve the analysis of one-sided device-independent QKD protocols. |
|||
3 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Security of a Continuous-Variable based Quantum Position Verification Protocol | QIP 2024 | Rene Allerstorfer, Arpan Akash Ray, Boris Skoric, Florian Speelman, Philip Verduyn Lunel |
| Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers | QIP 2023 | Florian Speelman |
| Bounding the influence of loss in quantum position verification and monogamy-of-entanglement games | QCRYPT 2022 | Florian Speelman |
Collaborators
| Co-author | Joint talks |
|---|---|
| Florian Speelman | 7 |
| Philip Verduyn Lunel | 2 |
| Rene Allerstorfer | 2 |
| Andreas Bluhm | 1 |
| Arpan Akash Ray | 1 |
| Boris Skoric | 1 |
| Harry Buhrman | 1 |
| Matthias Christandl | 1 |