Showcase: Device-Independent Quantum Cryptography

Federico Grasselli

Stefano Pirandola, Carlo Ottaviani, Gaetana Spedalieri +6 more

최유준, 권오성, 문성욱 +2 more

Ulrik L. Andersen, Tobias Gehring, Christian S. Jacobsen +1 more

Nayana Das, Saikat Basu, Goutam Paul +1 more

Device-Independent Quantum Secure Direct Communication (DI-QSDC) enhances quantum cryptography by enabling secure message transmission without relying on the trustworthiness of the devices involved. This approach mitigates risks associated with compromised or untrusted devices, common in traditional quantum communication. In this paper, we propose the first of its kind DI-QSDC protocol with user identity authentication. This ensures the authenticity of both the sender and receiver prior to message exchange. We then discuss the security of the proposed protocol against common attacks, demonstrating that no eavesdropper gains any information from either the quantum or the classical channel. Next, we implement the protocol on IBM’s quantum hardware and evaluate its performance in a realistic noisy environment. Additionally, by simulating common attack models, we showcase that the protocol is secure against any eavesdropper in the channel. These findings highlight the protocol’s robust security and practical feasibility for real-world secure quantum communication.

Simone Lin, Cameron Foreman, Lluis Masanes

Device-independent (DI) quantum cryptography provides secure cryptography with minimal trust in, or characterisation of, the used quantum devices. An essential component of DI protocols is the use of randomness extractors for privacy amplification, but these typically require an initial seed of randomness that introduces a potential vulnerability. To solve this problem, the security of seedless extractors was proven in Quantum 9, 1654 (2025). The core idea was to use the Bell violation of the raw data, rather than its min-entropy, as the extractor promise. However, the large fluctuations in the Bell inequality used required many rounds to precisely estimate the Bell violation, consuming substantial randomness and making the protocol very inefficient. In this work, we present a new proof technique based on a truncation method that allows the user to estimate the protocol parameters with an asymptotically vanishing fraction of rounds and, as a consequence, achieves the optimal rate of one key bit per singlet. Notably, we prove this result using seedless extractors that can be implemented efficiently.