Distance-bounding (DB) protocols let a verifier upper-bound a prover's physical distance by timing rapid challenge-response exchanges. Quantum communication promises simpler DB protocols with stronger security guarantees, yet existing quantum distance-bounding (QDB) proposals are analysed in ad-hoc models and, to the best of our knowledge, lack a common game-based treatment of standard fraud attacks. We contribute (i) a reusable security framework for QDB that fixes system and timing assumptions, specifies a quantum-capable adversary model, formalises distance-, mafia-, and terrorist-fraud experiments, and includes a simple i.i.d. depolarizing noise model; and (ii) an application of this framework to a published QDB protocol. For this protocol we characterise the honest per-round acceptance probability under noise and lift it to the multi-round setting, yielding explicit completeness guarantees as a function of the number of fast rounds, the acceptance threshold, and the noise parameter. For active adversaries we bound the per-round success probability of distance-fraud attacks and analyse the best known mafia-fraud strategy, deriving corresponding multi-round soundness bounds. We also show that the protocol is inherently insecure against terrorist-fraud in our model. The framework cleanly separates protocol-independent definitions from protocol-specific analysis and can be used to evaluate existing and future QDB protocols on a common basis.
Distance-bounding (DB) protocols let a verifier upper-bound a prover's physical distance by timing rapid challenge-response exchanges. Quantum communication promises simpler DB protocols with stronger security guarantees, yet existing quantum distance-bounding (QDB) proposals are analysed in ad-hoc models and, to the best of our knowledge, lack a common game-based treatment of standard fraud attacks. We contribute (i) a reusable security framework for QDB that fixes system and timing assumptions, specifies a quantum-capable adversary model, formalises distance-, mafia-, and terrorist-fraud experiments, and includes a simple i.i.d. depolarizing noise model; and (ii) an application of this framework to a published QDB protocol. For this protocol we characterise the honest per-round acceptance probability under noise and lift it to the multi-round setting, yielding explicit completeness guarantees as a function of the number of fast rounds, the acceptance threshold, and the noise parameter. For active adversaries we bound the per-round success probability of distance-fraud attacks and analyse the best known mafia-fraud strategy, deriving corresponding multi-round soundness bounds. We also show that the protocol is inherently insecure against terrorist-fraud in our model. The framework cleanly separates protocol-independent definitions from protocol-specific analysis and can be used to evaluate existing and future QDB protocols on a common basis.
Quantum distance-bounding (QDB) protocols let a verifier check that a prover is both genuine and physically nearby. During a timed fast phase of quantum communication, the verifier measures round-trip times to obtain an upper bound on the prover's distance. For a uniform comparison, we isolate the fast phase and study one-round distance-fraud (DF) and mafia-fraud (MF) games. For discrete-variable QDB, we show that these games reduce to convex optimization problems and can therefore be solved exactly with semidefinite programming; each MF value comes with an explicit attack achieving it and a matching certificate that no attack does better. This contrasts with quantum position verification, where an attack is split between two separated parties, so its optimization is nonconvex and analyses rely on relaxations. In our MF game, the cooperating pair collapses to a single sequential strategy, which keeps the game convex and its exact value computable. Across the discrete-variable protocols we examine, the best one-round DF attack succeeds with the same probability (1/2) for every protocol, whereas MF clearly separates the protocols. For continuous-variable QDB, we report estimated attack success probabilities from a calibrated Gaussian attack model. The benchmark covers protocols whose fast phase itself authenticates the prover; designs that follow Brands and Chaum and instead bind the fast phase with a final authenticated message, like the earliest QDB proposal, fall outside it and are treated separately. Of the four protocols studied, two had no previously known one-round attack values, and we report the first ones; for the other two, we find MF attacks with higher success probability than previously reported. Overall, one-round MF resistance depends on whether an attacker can use information revealed early by the prover to answer a fresh challenge from the verifier.
Abstract. Provably secure distance-bounding is a rising subject, yet an unsettled one; indeed, very few distance-bounding protocols, with formal security proofs, have been proposed. In fact, so far only two protocols, namely SKI (by Boureanu et al.) and FO (by Fischlin and Onete), offer all-encompassing security guaranties, i.e., resistance to distance-fraud, mafia-fraud, and terrorist-fraud. Matters like security, alongside with soundness, or added tolerance to noise do not always coexist in the (new) distance-bounding designs. Moreover, as we will show in this paper, efficiency and simultaneous protection against all frauds seem to be rather conflicting matters, leading to proposed solutions which were/are sub-optimal. In fact, in this recent quest for provable security, efficiency has been left in the shadow. Notably, the tradeoffs between the security and efficiency have not been studied. In this paper, we will address these limitations, setting the “security vs. efficiency ” record straight. Concretely, by combining ideas from SKI and FO, we propose symmetric protocols that are efficient, noise-tolerant and—at the same time—provably secure against all known frauds. Indeed, our new distance-bounding solutions outperform the two aforementioned provably secure distance-bounding protocols. For instance, with a noise level of 5%, we obtain the same level of security as those of the pre-existent protocols, but we reduce the number of rounds needed from 181 to 54. 1
Time-of-flight distance-bounding protocols are potentially useful in RFID and NFC environments and are designed to discourage a number of attacks that take advantage of the inherent assumption that a token and reader that manages to communicate are located in close physical proximity to each other. These protocols are dependent on time measurements made at the physical layer of the communication channel, and thus require special high bandwidth channels with low latency. Executing a distance-bound protocol on a suitable channel in a constrained environment would potentially allow for bit errors during communication. Currently, terrorist fraud is discouraged in distance-bounding protocols by ensuring that a prover collaborating with an the attacker in this fraud has to make his secret key known to the attacker. We discuss the effect of making a protocol resistant to bit errors and show that the approach to design protocols against terrorist fraud is significantly weakened by error resistance, as a prover is potentially able to keep his key secret or hinder an attacker from learning his key.
This paper introduces an entanglement-based Quantum Distance Bounding (QDB) protocol, whose security derived from Bell’s inequality violation. This protocol leverages the non-locality of quantum entanglement to enhance the integrity and security of quantum channels, providing device-independent assurances. We present both the theoretical framework and a practical implementation scenario using Qiskit. This study lays the groundwork for rigorous future analyses and the refinement of QDB protocols.
Abstract Quantum computing promises unprecedented computational power, posing fundamental threats and offering novel solutions to modern cryptography and cybersecurity. This survey paper reviews the rapidly evolving landscape of quantum-resistant and quantum-native security protocols. By analyzing foundational computational security models and the unique vulnerabilities introduced by quantum algorithms, this work proposes a structured evaluation framework for assessing the robustness of cryptographic systems. Ultimately, this survey highlights the critical transition from classical cryptographic infrastructures to quantum-secure paradigms, ensuring data confidentiality and integrity in the post-quantum era. Keywords: Quantum Computing, Security Protocol, Vulnerabilities 1.Introduction The emergence of quantum computing represents a paradigm shift in both computational physics and information technology. Quantum algorithms, particularly Shor's and Grover's algorithms, inherently challenge the mathematical foundations of classical public-key cryptography. As a result, securing communication channels against quantum-empowered adversaries has become an urgent priority for global infrastructure and national security. The motivation for this survey stems from the immediate need to bridge the gap between theoretical quantum mechanics and applied cybersecurity, ensuring that secure communications can withstand the computational leaps expected in the next decade. The core problem addressed in this paper is the comprehensive evaluation of security protocols under the threat model of a fully scalable quantum computer. The scope encompasses both post-quantum cryptographic (PQC) protocols and inherently quantum protocols, such as those relying on physical quantum states for key distribution. Existing classical approaches are insufficient for two main reasons. First, classical computational security models often rely on mathematical hardness assumptions (like integer factorization) that are rapidly undermined by theoretical quantum algorithms. Second, current software tools for designing secure classical protocols fail to account for quantum state phenomena, such as superposition and entanglement, rendering classical verification methods inadequate for quantum threat models. To address these structural challenges, this paper presents the following contributions: We provide a comprehensive taxonomy of vulnerabilities in both classical and quantum security protocols, mapping specific algorithmic advantages to protocol failure points. We propose a structured, multi-module framework for simulating, attacking, and verifying the security of hybrid quantum-classical cryptographic architectures. 2.Foundations of Classical Protocol Analysis The rigorous analysis of security protocols has traditionally relied on well-defined computational and symbolic models (Toorani, 2016). Researchers have extensively mapped out the taxonomy of attacks on authenticated key exchange (AKE) protocols and password-authenticated key exchange (PAKE) systems, establishing the mathematical groundwork for secure communication. The core idea of these foundational works is to establish provable security bounds that distinguish between information-theoretic and computational security. While this traditional paradigm offers strong mathematical guarantees against classical adversaries, its primary weakness is the failure to incorporate quantum attack vectors into the adversary's capability profile. Our work builds upon these classical models by explicitly injecting quantum algorithmic capabilities into standard protocol verification routines. 2.1.Quantum Algorithm Development and Simulation A significant body of literature focuses on the theoretical development and computational simulation of quantum algorithms capable of compromising or enhancing network security. Academic overviews have formalized algorithms like Grover's and Shor's, demonstrating their theoretical efficiency over classical counterparts in breaking cryptographic primitives. Furthermore, researchers have developed advanced design automation tools, such as decision diagrams, to simulate and verify complex quantum circuits. The strength of these simulation tools lies in their ability to model complex quantum states without requiring expensive physical hardware. However, a notable weakness is that they often abstract away the physical noise and hardware constraints that exist in real-world cryptographic deployments. This survey contextualizes these simulation techniques specifically within the framework of adversarial security testing, bridging theoretical algorithms with practical protocol defense. 3.Physical Implementations and Hardware Considerations Beyond algorithmic theory, the physical realization of quantum states directly impacts the practical security of any quantum protocol. Research into cavity quantum electrodynamics (QED) has demonstrated the complete mathematical construction of fundamental quantum gates, such as the controlled-controlled NOT gate, operating in the weak coupling regime (Fujii et al., 2005). Additionally, methods like Quantum Computed Moments (QCM) address the hardware constraints and noise typical of Near-Term Intermediate Scale Quantum (NISQ) devices, estimating ground state properties even with suboptimal trial states. The strength of this hardware-focused research is its realism regarding current technological limits; however, it often lacks a direct bridge to high-level network protocol verification. Compared to these purely physical studies, our survey integrates physical noise models into a generalized, software-driven protocol verification framework. 4.Approach To systematically evaluate quantum computing security protocols, we propose a structured Quantum Protocol Verification Framework (QPVF). The first module is the "Threat Modeling Engine," which defines the adversary's capabilities, ranging from classical data interception to full quantum memory manipulation. The second module is the "Quantum Circuit Synthesizer," which leverages decision diagram-based tools to translate high-level cryptographic operations into verifiable quantum circuits. The final module is the "Vulnerability Analyzer," which subjects the synthesized circuits to simulated quantum attacks, effectively distinguishing between idealized computational security and realistic hardware-constrained security. This modular pipeline allows security engineers to isolate specific vulnerabilities at both the abstract algorithmic layer and the simulated physical implementation layer. A key design choice in the QPVF is the utilization of decision diagrams for circuit simulation. This choice is predicated on the fact that decision diagrams efficiently handle the exponential state space of quantum systems during complex verification tasks (Wille et al., 2021). Furthermore, our framework explicitly incorporates noise models derived from current NISQ hardware limitations, ensuring that the security evaluation reflects realistic physical constraints rather than purely idealized environments (Vallury & Hollenberg, 2023). To evaluate this framework, we propose a hypothetical benchmarking plan using an artificially generated dataset of 10,000 hybrid quantum-classical cryptographic key exchanges. We will measure the success rate of simulated Grover-based brute-force attacks against varying key sizes and simulated environmental noise levels. This evaluation will compare the theoretical vulnerability threshold of a protocol against the practical threshold observed when quantum noise severely degrades the adversary's computational capabilities. The operational flow of the QPVF is designed to provide end-to-end security verification for next-generation networks. It bridges the critical gap between abstract protocol design and simulated hardware execution. The methodology can be summarized by the following numbered pipeline: Protocol Ingestion: The classical or quantum protocol is parsed into a standardized symbolic representation. Adversary Assignment: The user assigns a precise computational profile, selecting between traditional classical algorithms or advanced quantum capabilities. Circuit Generation: Protocol steps are mapped to equivalent quantum decision diagrams for scalable software simulation. Execution & Attack: Simulated quantum algorithms are executed against the mapped circuits to test for cryptographic resilience. Output Generation: The system outputs a vulnerability score and highlights specific failure points caused by either algorithmic weaknesses or simulated hardware noise. 5.Discussion The transition to quantum-secure protocols carries profound practical implications for global information infrastructure and enterprise deployment. Deploying these advanced protocols requires immense updates to existing software toolkits, as current digital systems are not fundamentally designed to handle the complexity of quantum states. Furthermore, organizations must consider the massive educational and workforce development efforts needed to train software engineers in quantum cryptography, a requirement already highlighted by international hackathons and educational initiatives. Integrating quantum-resistant protocols into complex domains like high-energy physics networks or global banking systems will require bridging the gap between theoretical quantum mechanics and applied computer engineering. Consequently, practical deployment must occur in hybrid phases, maintaining classical cryptographic wrappers while dedicated quantum infrastructure matures. Despite the robust theoretical design of proposed quantum security frameworks, several limitations and failure modes persist in practical applications. First, physical implementation attacks, such as side-channel attacks on the lasers and cavities used in physical quantum gates can bypass theoretical software security guarant
Abstract. Distance (upper)-bounding (DUB) allows a verifier to know whether a proving party is located within a certain distance bound. DUB protocols have many applications in secure authentication and location based services. We consider the dual problem of distance lower bound-ing (DLB), where the prover proves it is outside a distance bound to the verifier. We motivate this problem through a number of application scenarios, and model security against distance fraud (DF), Man-in-the-Middle (MiM), and collusion fraud (CF) attacks. We prove impossibility of security against these attacks without making physical assumptions. We propose approaches to the construction of secure protocols under reasonable assumptions, and give detailed design of our DLB protocol and prove its security using the above model. This is the first treatment of the DLB problem in the untrusted prover setting, with a number of applications and raising new research questions. We discuss our results and propose directions for future research. 1