Douglas Stebila, Michele Mosca, Norbert Lütkenhaus
备注：
12 pages, 1 figure; to appear in proceedings of QuantumComm 2009 Workshop on Quantum and Classical Information Security; version 2 minor content revisions
发表信息：
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, volume 36, page 283--296. Springer, 2010.
Quantum key distribution (QKD) promises secure key agreement by using quantum mechanical systems. We argue that QKD will be an important part of future cryptographic infrastructures. It can provide long-term confidentiality for encrypted information without reliance on computational assumptions. Although QKD still requires authentication to prevent man-in-the-middle attacks, it can make use of either information-theoretically secure symmetric key authentication or computationally secure public key authentication: even when using public key authentication, we argue that QKD still offers stronger security than classical key agreement.
Public-key cryptosystems for quantum messages are considered from two aspects: public-key encryption and public-key authentication. Firstly, we propose a general construction of quantum public-key encryption scheme, and then construct an information-theoretic secure instance. Then, we propose a quantum public-key authentication scheme, which can protect the integrity of quantum messages. This scheme can both encrypt and authenticate quantum messages. It is information-theoretic secure with regard to encryption, and the success probability of tampering decreases exponentially with the security …
We investigate quantum repeaters in the context of quantum key distribution. We optimize the secret key rate per memory per second with respect to different distillation protocols and distillation strategies. For this purpose, we also derive an analytical expression for the average number of entangled pairs created by the quantum repeater, including classical communication times for entanglement swapping and entanglement distillation. We investigate the impact of this classical communication time on the secret key rate. We finally study the effect of the detector efficiency on the secret key r…
A quantum key distribution protocol based on quantum encryption is presented in this Brief Report. In this protocol, the previously shared Einstein-Podolsky-Rosen pairs act as the quantum key to encode and decode the classical cryptography key. The quantum key is reusable and the eavesdropper cannot elicit any information from the particle Alice sends to Bob. The concept of quantum encryption is also discussed.
In the paper [Zhang, Li and Guo, Phys. Rev. A 64, 024302 (2001)], a quantum key distribution protocol based on quantum encryption was proposed, in which the quantum key can be reused. However, it is shown that, if Eve employs a special strategy to attack, this protocol becomes insecure because of the reused quantum key. That is, Eve can elicit partial information about the key bits without being detected. Finally, a possible improvement of the Zhang-Li-Guo protocol is proposed.
A quantum cryptographic protocol based in public key cryptography combinations and private key cryptography is presented. Unlike the BB84 protocol [1] and its many variants [2,3] two quantum channels are used. The present research does not make reconciliation mechanisms of information to derive the key. A three related system of key distribution are described.
We propose a quantum key distribution protocol with quantum based user authentication. Our protocol is the first one in which users can authenticate each other without previously shared secret and then securely distribute a key where the key may not be exposed to even a trusted third party. The security of our protocol is guaranteed by the properties of the entanglement.
A new cryptographic tool, anonymous quantum key technique, is introduced that leads to unconditionally secure key distribution and encryption schemes that can be readily implemented experimentally in a realistic environment. If quantum memory is available, the technique would have many features of public-key cryptography; an identification protocol that does not require a shared secret key is provided as an illustration. The possibility is also indicated for obtaining unconditionally secure quantum bit commitment protocols with this technique.
The security of quantum key distribution protocols hinges upon features of physical systems that are uniquely quantum in nature. We explore the role of quantumness as qualified by quantum contextuality, in quantum key distribution schemes. We present a new quantum key distribution protocol whose security depends uponthe KCBS inequality and contextuality monogamy. We explicitly calculate the key rate, error rate introduced between Alice-Bob communication due to the presence of Eve, and the information-gain by Eve. This protocol provides a new framework for quantum key distribution which has con…
In this paper, we first define the quantum discrete logarithm problem (QDLP)which is similar to classical discrete logarithm problem. But, this problem cannot be solved by Shor's quantum algorithm. Based on quantum discrete logarithm problem, we present a novel quantum secret key encryption algorithm. The receiver constructs his quantum channel using their secret key. Then, the sender can use the receiver's quantum channel to encrypt the message. Finally, the receiver dencrypts the ciphertext by using secret key. In our algorithm, the quantum system will be broken after transferring messages. …
Quantum key distribution is a cryptographic primitive for the distribution of symmetric encryption keys between two parties that possess a pre-shared secret. Since the pre-shared secret is a requirement, quantum key distribution may be viewed as a key growing protocol. We note that the use of pre-shared secrets coupled with access to randomness beacons may enable key growing which, though not secure from an information-theoretic standpoint, remains quantum safe.
Quantum cryptography is a major ingredient of the future quantum internet that promises various secure communication tasks. Quantum conference key agreement (CKA) is an important cryptographic primitive of quantum cryptography, which provides the conference key among multiple users simultaneously. However, quantum CKA is currently far from practical application due to the low conference key rate. Here, we propose a quantum CKA protocol of three users with information-theoretic security. Our protocol only requires phase-randomized weak coherent sources and threshold single-photon detectors, and…
Quantum cryptography is set to become a key technology for future secure communications. However, to get maximum benefit in communication networks, transmission links will need to be shared among several quantum keys for several independent users. Such links will enable switching in quantum network nodes of the quantum keys to their respective destinations. In this paper we present an experimental demonstration of a photonic integrated silicon chip quantum key distribution protocols based on space division multiplexing (SDM), through multicore fiber technology. Parallel and independent quantum…
Quantum key distribution is one of the most fundamental cryptographic protocols. Quantum walks are important primitives for computing. In this paper we take advantage of the properties of quantum walks to design new secure quantum key distribution schemes. In particular, we introduce a secure quantum key-distribution protocol equipped with verification procedures against full man-in-the-middle attacks. Furthermore, we present a one-way protocol and prove its security. Finally, we propose a semi-quantum variation and prove its robustness against eavesdropping.
It is well known that Shor's quantum algorithm for integer factorization can break down the RSA public-key cryptosystem, which is widely used in many cryptographic applications. Thus, public-key cryptosystems in the quantum computational setting are longed for cryptology. In order to define the security notions of public-key cryptosystems, we have to model the power of the sender, receiver, adversary and channel. While we may consider a setting where quantum computers are available only to adversaries, we generally discuss what are the right security notions for (quantum) public-key cryptosyst…
We propose a quantum key distribution scheme by using screening angles and analyzing detectors which enable to notice the presence of Eve who eavesdrops the quantum channel, as the revised protocol of the recent quantum key distribution [Phys. Rev. Lett. 95, 040501 (2005)]. We discuss the security of the proposed quantum key distribution against various attacks including impersonation attack and Trojan Horse attack.
In this paper, we theoretically prove that the Gaussian quantum discord state of optical field can be used to complete continuous variable (CV) quantum key distribution (QKD). The calculation shows that secret key can be distilled with a Gaussian quantum discord state against entangling cloner attack. Secret key rate is increased with the increasing of quantum discord for CV QKD with the Gaussian quantum discord state. Although the calculated results point out that secret key rate using the Gaussian quantum discord state is lower than that using squeezed state and coherent state at the same en…
The interferometry of single-photon pulses has been used to implement quantum technology systems, like quantum key distribution, interaction-free measurement and some other quantum communication protocols. In most of these implementations, Mach-Zehnder, Michelson and Fabry-Perot interferometers are the most used. In this work we present optical setups for interaction-free measurement, quantum key distribution and quantum secret sharing using the Sagnac interferometer. The proposed setups are described as well the quantum protocols using them are explained.
In this Comment we question the security of recently proposed by Degiovanni et al. [Phys. Rev. A 69 (2004) 032310] scheme of quantum dense key distribution.
We analyze various prominent quantum repeater protocols in the context of long-distance quantum key distribution. These protocols are the original quantum repeater proposal by Briegel, Dür, Cirac and Zoller, the so-called hybrid quantum repeater using optical coherent states dispersively interacting with atomic spin qubits, and the Duan-Lukin-Cirac-Zoller-type repeater using atomic ensembles together with linear optics and, in its most recent extension, heralded qubit amplifiers. For our analysis, we investigate the most important experimental parameters of every repeater component and find th…
Quantum key distribution (QKD) has been developed for decades and several different QKD protocols have been proposed. But two difficulties limit the implementation of most QKD protocols. First, the involved participants are required to have heavy quantum capabilities, such as quantum joint operation, quantum register, and so on. Second, a hypothetical authenticated classical channel is used in most of the existing QKD protocols and this assumed channel does not exist in reality. To solve both the above limitations at the same time, this study proposes three lightweight authenticated QKD protoc…
We propose various new techniques in quantum information theory, including a de Finetti style representation theorem for finite symmetric quantum states. As an application, we give a proof for the security of quantum key distribution which applies to arbitrary protocols.
This article provides the unconditional security of a semi quantum key distribution (SQKD) protocol based on 3-dimensional quantum states. By deriving a lower bound for the key rate, in the asymptotic scenario, as a function of the quantum channel's noise, we find that this protocol has improved secret key rate with much more tolerance for noise compared to the previous 2-dimensional SQKD protocol. Our results highlight that, similar to the fully quantum key distribution protocol, increasing the dimension of the system can increase the noise tolerance in the semi-quantum key distribution, as w…
When the 4-state or the 6-state protocol of quantum cryptography is carried out on a noisy (i.e. realistic) quantum channel, then the raw key has to be processed to reduce the information of an adversary Eve down to an arbitrarily low value, providing Alice and Bob with a secret key. In principle, quantum algorithms as well as classical algorithms can be used for this processing. A natural question is: up to which error rate on the raw key is a secret-key agreement at all possible? Under the assumption of incoherent eavesdropping, we find that the quantum and classical limits are precisely the…
A new scheme of Quantum Key Distribution is proposed using three entangled particles in a GHZ state. Alice holds a 3-particle source and sends two particles to Bob, keeping one with herself. Bob uses one particle to generate a secure key, and the other to generate a master-key. This scheme should prove to be harder to break in non-ideal situations as compared to the standard protocols BB84 and Eckert. The scheme uses the concept of Quantum Disentanglement Eraser. Extension to multi-partite scheme has also been investigated.
A quantum key distribution protocol with classical Bob based on polarization entangled photon pairs is presented. It approximates a single photon and exploited the inherent randomness of quantum measurements to attain highly secure keys and high efficiency of the transmission.
We present a quantum key distribution protocol based on four-level particles entanglement. Furthermore, a controlled quantum key distribution protocol is proposed by utilizing three four-level particles. We show that the two protocols are secure.
Due to the capability of tolerating high error rate and generating more key bits per trial, high-dimensional quantum key distribution attracts wide interest. Despite great progresses in high-dimensional quantum key distribution, there are still some gaps between theory and experiment. One of these is that the security of the secret key heavily depends on the number of the emitted signals. So far, the existing security proofs are only suitable in the case with an infinite or unpractically large number of emitted signals. Here, by introducing the idea of "key classification" and developing relev…
For single-photon quantum key generation between two users, it is shown that the use of a shared secret key extended via a pseudo-random number generator may simultaneously enhance the security and efficiency of the cryptosystem. This effect arises from the intrinsic performance difference between quantum detectors with versus without knowledge of the key, a purely quantum effect and a new principle for key generation. No intrusion level estimation is needed and the method is directly applicable to realistic systems with imperfections. Quantum direct encryption is also made possible by such us…
A theorem is proved which states that no classical key generating protocol could ever be provably secure. Consequently, candidates for provably secure protocols must rely on some quantum effect. Theorem relies on the fact that BB84 Quantum key distribution protocol has been proven secure.
We present a quantum no-key protocol for direct and secure transmission of quantum and classical messages based on simple Boolean function computation with several quantum gates and Shamir's interactive idea of classical message encryption. This protocol has inherent personal identification and message authentication. It probably is the first quantum protocol that can resist the man-in-the-middle attack by itself.
Floodlight quantum key distribution (FL-QKD) uses binary phase-shift keying (BPSK) of multiple optical modes to achieve Gbps secret-key rates (SKRs) at metropolitan-area distances. We show that FL-QKD's SKR can be doubled by using 32-ary PSK.
The practical realizations of BB84 quantum key distribution protocol using single-photon or weak coherent states have normally presented low efficiency, in the meaning that most bits sent by Alice are not useful for the final key. In this work, we show an optical setup to improve the transmission rate of useful bits putting together two ideas, parallel quantum key distribution and physical encryption using mesoscopic coherent states. The final result is a four time faster quantum key distribution setup.
We present a quantum public-key cryptosystem based on a classical NP-complete problem related with finding a code word of a given weight in a linear binary code.
As an alternative to the usual key generation by two-way communication in schemes for quantum cryptography, we consider codes for key generation by one-way communication. We study codes that could be applied to the raw key sequences that are ideally obtained in recently proposed scenarios for quantum key distribution, which can be regarded as communication through symmetric four-letter channels.
A semi-quantum key distribution (SQKD) protocol allows a quantum user and a limited "classical" user to establish a shared secret key secure against an all-powerful adversary. In this work, we present a new SQKD protocol where the quantum user is also limited in her measurement capabilities. We describe the protocol, prove its security, and show its noise tolerance is as high as "fully quantum" QKD protocols.
A general mathematical framework for quantum key distribution based on the concepts of quantum channel and Turing machine is suggested. The security for its special case is proved. The assumption is that the adversary can perform only individual (in essence, classical) attacks. For this case an advantage of quantum key distribution over classical one is shown.
In this report we discuss the insecurity with present implementations of the Ekert protocol for quantum-key distribution based on the Wigner Inequality. We propose a modified version of this inequality which guarantees safe quantum-key distribution.
Semi-quantum key distribution is traditionally based on two-level quantum systems. In this paper, an unconditional security of a semi quantum key distribution protocol based on higher-dimensional systems using various mutually unbiased bases is presented. We first consider the three dimensional case using three and four mutually unbiased bases and derive a lower bound for the key rate as a function of the quantum channel's noise. We then generalize the result to a semi-quantum key distribution protocol that employs different number of mutually unbiased bases for four-dimensional states. It is …
In this paper, security of practically decoy state quantum key distribution under fake state attack is considered. If quantum key distribution is insecure under this type of attack, decoy sources can not also provide it with enough security. Strictly analysis shows that Eve should eavesdrop with the aid of photon-number-resolving instruments. In practical implementation of decoy state quantum key distribution where statistical fluctuation is considered, however, Eve can attack it successfully with threshold detectors.
Recently, Yang et al. (Quantum Inf Process 18, 74, 2019) proposed a two-party quantum key agreement protocol over a collective noisy channel. They claimed that their quantum key agreement protocol can ensure both of the participants have equal influence on the final shared key. However, this study shows that the participant who announces the permutation operation can manipulate the final shared key by himself/herself without being detected by the other. To avoid this loophole, an improvement is proposed here.
The security of the previous quantum key distribution protocols, which is guaranteed by the nature of physics law, is based on the legitimate users. However, the impersonation of Alice or Bob by eavesdropper, in practice. will be existed in a large probability. In this paper an improvement scheme for the security quantum key is proposed.
Semiquantum key distribution allows a quantum party to share a random key with a "classical" party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this work, we present a protocol where a secret key can be established between a quantum user and an almost classical user who only needs the quantum ability to access quantum channels, by securely delegating quantum computation to a quantum server. We show the proposed protocol is robust even when the delegated quantum server is a powerful adversary, and is experi…
In conventional quantum key distribution protocols, the secure key is normally extracted from the measurement outcomes of the system. Here, a different approach is proposed, where the secure key is extracted from the measurement bases, rather than outcomes. Compared to the original Bennett-Brassard-1984 protocol, the proposed protocol involves no hardware change but modifications in data postprocessing. We show that this protocol is more robust against detector efficiency attacks and photon-number-splitting attacks when practical detectors and photon sources are used.
Recently, Zhang et al. proposed a single-state semi-quantum key distribution protocol (Int. J. Quantum Inf, 18, 4, 2020) to help a quantum participant to share a secret key with a classical participant. However, this study shows that an eavesdropper can use a double C-NOT attack to obtain parts of the final shared key without being detected by the participants. To avoid this problem, a modification is proposed here.
Quantum Conference Key Agreement (CKA) is a cryptographic effort of multiple parties to establish a shared secret key. While bipartite quantum key distribution protocols are also useful in the context of CKA, multipartite protocols allow for a more efficient generation of the necessary correlations and are therefore viewed favorably in the context of quantum networks. In future quantum networks, generating secret keys in an anonymous way is of tremendous importance for parties that do not only want to keep their shared key secret but also protect their own identity, e.g. in the context of whis…
If an eavesdropper Eve is equipped with quantum computers, she can easily break the public key exchange protocols used today. In this paper we will discuss the post-quantum Diffie-Hellman key exchange and private key exchange protocols.
This paper proposes a new protocol for quantum dense key distribution. This protocol embeds the benefits of a quantum dense coding and a quantum key distribution and is able to generate shared secret keys four times more efficiently than BB84 one. We hereinafter prove the security of this scheme against individual eavesdropping attacks, and we present preliminary experimental results, showing its feasibility.
We suggest that the randomness of the choices of measurement basis by Alice and Bob provides an additional important resource for quantum cryptography. As a specific application, we present a novel protocol for quantum key distribution (QKD) which enhances the BB84 scheme by encrypting the information sent over the classical channel during key sifting. We show that, in the limit of long keys, this process prevents an eavesdropper from reproducing the sifting process carried out by the legitimate users. The inability of the eavesdropper to sift the information gathered by tapping the quantum ch…
