← Latest papers
⚛️ quantum physics

On the Role of Quantum Communication and Loss in Attacks on Quantum Position Verification

This paper investigates the impact of quantum communication and loss on Quantum Position Verification (QPV) security by presenting a protocol vulnerable to single-round quantum communication despite being secure against classical communication, establishing a general transformation for security gaps, proving the loss-tolerant security of Bell state discrimination against quantum attacks, and demonstrating that high loss enables linear-entanglement attacks on multi-round protocols.

Original author: Rene Allerstorfer, Harry Buhrman, Florian Speelman, Philip Verduyn Lunel

Published 2026-11-19
📖 5 min read🧠 Deep dive

Original author: Rene Allerstorfer, Harry Buhrman, Florian Speelman, Philip Verduyn Lunel

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the author. For technical accuracy, refer to the original paper. Read full disclaimer

In the world of cryptography, trust is often built on who you are or what you know. But what if the most important credential is simply where you are? This is the premise of position-based cryptography, a field dedicated to proving that a message truly originated from a specific location, such as a secure government bunker or a remote server farm. The challenge lies in verifying this location without the person being tested being able to trick the system. In a classical world, where information travels as electrical signals or light pulses, this task is impossible to guarantee; a clever adversary can always intercept a message, process it, and forward it fast enough to fake their location. However, the laws of quantum physics offer a new set of rules. By using particles of light that can exist in delicate, interconnected states, scientists have proposed ways to verify position that are theoretically unbreakable, provided the attackers do not have access to certain powerful resources.

The core difficulty in these quantum tests is the speed of light. To verify a position, two trusted stations send signals to a prover in the middle, who must perform a specific quantum operation and send the answer back before the signals could possibly have traveled to a different location and returned. If the prover is not actually there, attackers positioned between the stations and the true location must intercept the signals, figure out what to do, and send the correct reply. The critical question for security is what tools these attackers are allowed to use. For years, researchers assumed that if attackers could not share a pre-existing, mysterious connection known as entanglement, they would be limited to sending classical information—like simple bits of data—to each other. This paper investigates what happens if we allow those attackers to use quantum communication, sending actual quantum particles between them, instead of just classical bits.

The researchers constructed a specific scenario to test this boundary. They designed a game where two stations send pairs of quantum particles to a prover and ask whether the pairs are in a "symmetric" or "antisymmetric" state. If the attackers are restricted to classical communication, they can only guess the answer correctly about 94 percent of the time. However, the paper demonstrates that if the attackers are allowed to send a single round of quantum particles to each other, they can solve the problem perfectly, achieving a 100 percent success rate. This finding is significant because it proves that quantum communication offers a distinct and powerful advantage over classical communication, even when the attackers do not share any pre-existing entanglement. It shows that allowing quantum particles to travel between attackers can break security in a way that simply sharing entanglement does not.

Despite this vulnerability, the authors show that the situation is not hopeless. They developed a method to transform a protocol that is vulnerable to quantum communication into a new one that is secure against it. Their argument relies on a recursive process: if a quantum attack works on a protocol, it essentially splits the problem into two smaller, new protocols. By repeating this splitting process, they proved that eventually, the quantum information becomes so diluted that it behaves like classical information, and a secure protocol emerges. This means that while a specific, initial protocol might fail, the underlying principles of quantum position verification can be adjusted to withstand these advanced attacks.

The paper then moves to a more robust test: distinguishing between four specific types of quantum states known as Bell states. In this task, an honest prover can identify the state perfectly. The researchers proved that attackers using only local operations and a single round of quantum communication cannot do this perfectly. They established a strict upper limit on the attackers' success rate, showing it cannot exceed 75 percent. This result holds even if the attackers are allowed to claim that the signal was lost or corrupted in some rounds, a common tactic in real-world scenarios where signals fade. By proving that no strategy can ever achieve a perfect success rate, even with the ability to discard failed attempts, the authors identified the first fully loss-tolerant protocol that remains secure against quantum communication attacks.

Finally, the study addresses the practical reality of signal loss in long-distance communication. The researchers observed that if the rate of signal loss is high enough, attackers can use a strategy involving a linear amount of pre-shared entanglement to break almost any multi-round protocol. They explained that attackers can attempt to teleport the quantum information, guess the necessary corrections, and only claim the signal was lost if their guess was wrong. This implies that creating a protocol that is both fully loss-tolerant and secure against attackers with significant entanglement is impossible. The paper concludes that for quantum position verification to be practical, we must carefully balance the amount of loss we can tolerate with the amount of entanglement we assume the attackers might possess, accepting that perfect security in all conditions may be out of reach.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →