arXiv:0909.3375 · Physical Review Letters

Quantum Cryptography as a Retrodiction Problem

Albert H. Werner, Titus Franz, Reinhard F. Werner

Published Nov 25, 2009• 18 citations

Abstract

We propose a quantum key distribution protocol based on a quantum retrodiction protocol, known as the Mean King problem. The protocol uses a two way quantum channel. We show security against coherent attacks in a transmission-error free scenario, even if Eve is allowed to attack both transmissions. This establishes a connection between retrodiction and key distribution.

DOI: 10.1103/physrevlett.103.220504

Related papers

On the security of the quantum key distribution using the Mean King Problem

M. Yoshida, Takayuki Miyadera, Hideki Imai

It is anticipated that quantum key distribution enable us to share a secret key while guaranteeing unconditionally security. In this paper, we discuss the quantum key distribution using the Mean King Problem which was proposed by J. Bub in 2001. While this two-way quantum protocol is essentially different from the other one-way protocols like the BB84, it has been shown that Eve cannot gain any information without being detected even in this protocol. Assuming two attack scenarios in this protocol, we derive two trade-off inequalities showing that the larger Eve's information gain is, the higher the detectability becomes. These quantitative inequalities enables the legitimate users to estimate Eve's information gain.

International Symposium on Information Theory and its ApplicationsOct 1, 20104 citations

Quantum key distribution based on a quantum retrodiction protocol

Handuo Shi, Yi-Nan Wang, Jing Li +3 more

This paper is withdrawn. We study the quantum key distribution (QKD) protocol based on a quantum retrodiction protocol, namely the so-called mean king problem. The security is analyzed by considering the eavesdropping on both the preparation of the entangled pair and the transmission of the quantum state. This QKD protocol can generate efficiently a bit of raw key in every single run. We find that, for qubit system, it is more secure than the QKD Bennett-Brassard 1984 protocol and the six-state protocol. This QKD protocol works also for higher dimensional system.

arXiv:1205.3556May 16, 20120 citations

Quantum key distribution using Mean King problem with modified measurement schemes

M. Yoshida, Takayuki Miyadera, Hideki Imai

In 2001, Jefferey Bub proposed a quantum key distribution protocol using the Mean King problem. In the protocol, King chooses one of the observables σ x or σ z , while Alice is required to measure an observable that solves the Mean King problem for three observables σ x , σ y and σ z . The observable employed by Alice is thus rather complicated. In this paper, we give other simple solutions of the Mean King problem for two observables and examine the quantum key distribution protocols using them. Our result shows that not all the solutions of the Mean King problem are available to construct a secure protocol. In addition, we consider a protocol that is tolerant with three attack scenarios and derive a trade-off inequality between Eve's information gain and error probability observed by the legitimate users.

International Symposium on Information Theory and its ApplicationsOct 1, 20123 citations

Quantum Key Distribution using Extended Mean King’s Problem

Ayumu Nakayama, M. Yoshida, Jun Cheng

In this paper, we introduce the extended mean king's problem and its solutions. Also, we show a quantum key distribution (QKD) using the extended mean king's problem. By using the quantum key distribution, a sender can share a secret key with each of receivers. Besides, we consider the tolerance to an eavesdropper who makes intercept-resend attacks. As a result, in the case of two receivers, we indicate that the quantum key distribution is robust against the intercept-resend attacks by showing that the error occurs between the secret keys of a sender and receivers.

International Symposium on Information Theory and its ApplicationsOct 1, 20181 citation

Finite Key Size Analysis of Two-Way Quantum Cryptography

Jesni Shamsul Shaari, Stefano Mancini

Quantum cryptographic protocols solve the longstanding problem of distributing a shared secret string to two distant users by typically making use of one-way quantum channel. However, alternative protocols exploiting two-way quantum channel have been proposed for the same goal and with potential advantages. Here, we overview a security proof for two-way quantum key distribution protocols, against the most general eavesdropping attack, that utilize an entropic uncertainty relation. Then, by resorting to the “smooth” version of involved entropies, we extend such a proof to the case of finite key size. The results will be compared to those available for one-way protocols showing some advantages.

arXiv:1503.01498EntropyApr 30, 201511 citations

Quantum Key Distribution for Secure Communication Protocols

Jincheng Zhang

This paper proposes a novel secure communication protocol based on Quantum Key Distribution (QKD). The core claim is to design a protocol capable of completely secure key transmission, resisting eavesdropping and manipulation, thereby guaranteeing communication security. The protocol leverages quantum entanglement to facilitate quantum key transmission and employs cryptographic algorithms for key encryption and decryption. Traditional secure communication protocols relying on classical key exchange are vulnerable to attacks. QKD offers a significantly higher level of security. This document details the protocol's architecture, mathematical formulation of the key exchange process, and the security analysis underpinning its design. The focus is on demonstrating a robust system against known classical and quantum attacks, providing a foundation for future secure communication networks. The system is designed for a two-party communication scenario, aiming for maximal security with reasonable complexity.

Aug 28, 20260 citations