2026· IEEE Journal on Selected Areas in Communications· Vol 44, pp. 5450-5456· 0 citations· 24 references
Computer Science
TL;DR
This work proves that the security of the proposed scheme can be reduced to that of standard QKD protocols with MUBs and full quantum state preparation, thereby inheriting the established security proofs of existing QKD protocols.
Abstract
Quantum key distribution (QKD) enables information-theoretically secure key exchange between two remote parties. However, practical implementations often are vulnerable to device imperfections, particularly in the state preparation. In this paper, we propose a reconfigurable QKD scheme based on arbitrary pure states. By reducing the number and accuracy of required quantum states, our approach simplifies implementation while enhancing robustness against practical imperfections. Within this framework, the communicating parties can dynamically reconfigure their system, adaptively selecting a subset of states based on the raw key, to implement various QKD protocols. We prove that the security of the proposed scheme can be reduced to that of standard QKD protocols with MUBs and full quantum state preparation, thereby inheriting the established security proofs of existing QKD protocols. To the best of our knowledge, the proposed scheme imposes the loosest and most straightforward requirements on state preparation, making it the most simplified QKD scheme to date. Notably, this reconfiguration provides greater resilience against state preparation flaws and can be seamlessly integrated into current systems without requiring any hardware modifications. Our work bridges the gap between theoretical security and practical implementation, paving the way for more reliable QKD deployments in real-world scenarios.
This paper applies the one‐directional quantum walks on a circle (ODQWC) to the QBM problem for the first time and develops a new distributed QBM protocol that achieves higher qubit efficiency and can serve as a building block for broader multi‐party collaborative computation tasks.
Ran Zhang, Xue Zhang, Jia-Rui He et al.· Advanced Quantum Technologie...· 0 citations
This work presents a security proof for generic prepare-and-measure QKD protocols, including decoy-state BB84, with imperfect and imperfectly characterized sources and detectors using the marginal-constrained entropy accumulation theorem (MEAT).
Jerome Wiesemann, John Burniston, Devashish Tupkary et al.· 0 citations
A circuit-model blind quantum computation protocol that conceals the target quantum computation while decoupling the encryption and decryption keys, and proves the verifiability of the protocol, where verification is achieved by estimating expectation values of randomly chosen Pauli observables, thereby substantially r...
Quantum Key Distribution (QKD) represents a revolutionary advancement in secure communication. It leverages principles of quantum mechanics to establish cryptographic keys between parties with theoretically unbreakable security. Among the various QKD protocols, BB84 (Bennett and Brassard, 1984) and Twin-Field QKD are p...
Y. Jazyah· WSEAS Transactions on Comput...· 0 citations
This paper presents concrete implementations of Zero-Knowledge Arguments (ZKAs), analogous to but distinct from traditional Σ-protocols, and describes two variants: one with dynamic public key encapsulation (CPA-DE) and another that is non-interactive (CPA-NI).
Randy Kuang, Daniel Johnson, D. Panario· Quantum Information Technolo...· 0 citations
A Multi-Qubit Greenberger--Horne--Zeilinger (GHZ) State-based QKD scheme that reduces the number of qubits transmitted over the quantum channel and can be extended to multi-party QKD and server-client deployment.
Tasdiqul Islam, Rasman Mubtasim Swargo, Engin Arslan et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.