Quantum Key Distribution, as a branch of quantum mechanics in cryptography, can distribute keys between legal communication parties in an unconditionally secure manner, thus can realize in transmitting confidential information with unconditional security. We consider a Phase-Matching Quantum Key Distribution protocol with 3-state systems for the first time, where the phase of the coherent state is 3,thus we propose three different ways to response to every successful detection and two parties gain their raw keys by "flip and flip". The simulation results show that compared with Phase-Matching Quantum Key Distribution protocol where the phase equals 2, the proposed protocol breaks the limit of linear key generation rate in a shorter distance, and the longest practical transmission distance is about 470 $km$, whereas the ones of BB84 protocol is lower than 250 $km$.
The Quantum Key Distribution protocol can encode a single quantum state and implements an information-theoretically secure key distribution protocol in communication. In the actual QKD experimental system, there are usually two encoding methods which are phase encoding and polarization encoding. Ma et al.[Phase-Matching Quantum Key Distribution, Phys. Rev. X., 2018, 8(3)] proposed the phase-matching QKD protocol, which has high transmission and it is an extension of the measurement device independent QKD. This paper successfully gives the polarization scheme of this PM-QKD protocol, the bases …
The presence of noise in quantum computers hinders their effective operation. Even though quantum error correction can theoretically remedy this problem, its practical realization is still a challenge. Testing and benchmarking noisy, intermediate-scale quantum (NISC) computers is therefore of high importance. Here, we suggest the application of the so-called quantum state matching protocol for testing purposes. This protocol was originally proposed to determine if an unknown quantum state falls in a prescribed neighborhood of a reference state. We decompose the unitary specific to the protocol…
We propose a multiple pulses phase-matching quantum key distribution protocol (MPPM-QKD) to exceed the linear key rate bound and to achieve higher error tolerance. In our protocol, Alice and Bob generate at first their own train pulses (each train should contain L pulses) as well as random bit sequences, and also encode each pulse of their trains with a randomized phase and a modulation phase. As the next step, both encoded trains are simultaneously sent to Charlie, who performs an interference detection and may be also an eavesdropper. After a successful detection is announced by Charlie, Ali…
Many quantum computational tasks have inherent symmetries, suggesting a path to enhancing their efficiency and performance. Exploiting this observation, we propose representation matching, a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks, including remote execution of unitary gate arrays, permutation gates and unitary conjugation, as well as the storage and retrieval of unitary gates.
Quantum cryptographic conferencing (QCC) holds promise for distributing information-theoretic secure keys among multiple users over long distance. Limited by the fragility of Greenberger-Horne-Zeilinger (GHZ) state, QCC networks based on directly distributing GHZ states at long distance still face big challenge. Another two potential approaches are measurement device independent QCC and conference key agreement with single-photon interference, which was proposed based on the post-selection of GHZ states and the post-selection of W state, respectively. However, implementations of the former pro…
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.
Variations of phase-matching measurement-device-independent quantum key distribution (PM-MDI QKD) protocols have been investigated before, but it was recently discovered that this type of protocol (under the name of twin-field QKD) can beat the linear scaling of the repeaterless bound on secret key rate capacity. We propose a variation of PM-MDI QKD protocol, which reduces the sifting cost and uses non-phase-randomized coherent states as test states. We provide a security proof in the infinite key limit. Our proof is conceptually simple and gives tight key rates. We obtain an analytical key ra…
In all existing protocols of private communication with encryption and decryption, the pre-shared key can be used for only one time. We give a deterministic quantum key expansion protocol where the pre-shared key can be recycled. Our protocol is exponentially secure. Our protocol costs less qubits and almost zero classical communications with authentication steps being included. Since our protocol can distribute the deterministic bits, it can also be used for direct communication.
We propose an information reconciliation protocol that uses two-way classical communication. In the case of the BB84 protocol and the six-state protocol, the key rates of the quantum key distribution (QKD) protocols that use our proposed information reconciliation protocol are higher than previously known protocols for wide range of error rates. We also clarify the relation between the proposed protocol and known QKD protocols, and the relation between the proposed protocol and entanglement distillation protocols (EDPs).
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…
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 provide a quantum key distribution protocol based on the correlations of the Greenburger-Horne-Zeilinger(GHZ) state. No classical communication is needed in the process of the establishment of the key. Our protocol is useful when an unjammable classical communication channel is unavailable. We prove that the protocol is secure.
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.
We analyze the security of two multipartite quantum key distribution (QKD) protocols, specifically we introduce an $N$-partite version of the BB84 protocol and we discuss the $N$-partite six-state protocol proposed in arXiv:1612.05585v2. The security analysis proceeds from the generalization of known results in bipartite QKD to the multipartite scenario, and takes into account finite resources. In this context we derive a computable expression for the achievable key rate of both protocols by employing the best-known strategies: the uncertainty relation and the postselection technique. We compa…
We propose a new class of quantum key distribution protocol, that ended up to be robust against photon number splitting attacks in the weak laser pulse implementations. This protocol comprises of BB84 protocol and SARG protocol, especially in aspects of controlling classical sifting procedures of two protocols. The protocol is more secure than both of BB84 protocol and SARG protocol, and the ultimate limit of robustness in the proposed protocol expands as well than both of them.
We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic secure. These protocols are designed to resist middleman attack for two parties preshared authentication key, and achieve perfect mutual data origin authentication which ensures the permanent reusing of authentication key. Finally, we simplify the protocol to a 4-round one, and show that any protocol with 3 or less rounds cannot achieve perfect security without consuming preshared key.
We prove the security of a high-capacity quantum key distribution protocol over noisy channels. By using entanglement purification protocol, we construct a modified version of the protocol in which we separate it into two consecutive stages. We prove their securities respectively and hence the security of the whole protocol.
A theoretical framework of quantum no-key (QNK) protocol has been presented. As its applications, we develop three kinds of QNK protocols: the practical QNK protocols, the QNK protocol based on quantum perfect encryption, and the QNK protocols based on Boolean function computing. The security of these protocols is based on the laws of quantum mechanics, other than computational hypothesis.
Quantum key distribution protocols constitute an important part of quantum cryptography, where the security of sensitive information arises from the laws of physics. In this paper we introduce a new family of key distribution protocols and we compare its key with the well-known protocols such as BB84, PBC0 and generation rate to the well-known protocols such as BB84, PBC0 and R04. We also state the security analysis of these protocols based on the entanglement distillation and CSS codes techniques.
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…
Semi-quantum key distribution (SQKD) protocols allow for the establishment of a secret key between two users Alice and Bob, when one of the two users (typically Bob) is limited or "classical" in nature. Recently it was shown that protocols exists when both parties are limited/classical in nature if they utilize the services of a quantum server. These protocols are called mediated SQKD protocols. This server, however, is untrusted and, in fact, adversarial. In this paper, we reconsider a mediated SQKD protocol and derive a new proof of unconditional security for it. In particular, we derive a n…
We discuss long code problems in the Bennett-Brassard 1984 (BB84) quantum key distribution protocol and describe how they can be overcome by concatenation of the protocol. Observing that concatenated modified Lo-Chau protocol finally reduces to the concatenated BB84 protocol, we give the unconditional security of the concatenated BB84 protocol.
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…
We propose a way to retrieve the secure key generated by the coherent one way protocol without reading the information transmitted on the quantum channel.
We present an one-time-pad key communication protocol that allows secure direct communication with entanglement. Alice can send message to Bob in a deterministic manner by using local measurements and public communication. The theoretical efficiency of this protocol is double compared with BB84 protocol. We show this protocol is unconditional secure under arbitrary quantum attack. And we discuss that this protocol can be perfectly implemented with current technologies.
We find that existing multi-party quantum key agreement (MQKA) protocols designed for fairness of the key are, in fact, unfair. Our analysis shows that these protocols are sensitive to collusive attacks; that is, dishonest participants can collaborate to predetermine the key without being detected. In fact, the transmission structures of the quantum particles in those unfair MQKA protocols, three of which have already been analyzed, have much in common. We call these unfair MQKA protocols circle-type MQKA protocols. Likewise, the transmission structures of the quantum particles in MQKA protoco…
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.
Quantum Key Distribution is a practically implementable information-theoretic secure method for transmitting keys to remote partners performing quantum communication. After examining various protocols from the simplest such as QC and BB84 we move on to describe BBM92, DPSK, SARG04 and finally MDI from the largest possible communication distance and highest secret key bitrate. We discuss how any protocol can be optimized by reviewing the various steps and underlying assumptions proper to every protocol with the corresponding consequence in each case.
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 three quantum key distribution protocols using entangled state. In the first two protocols, all Einstein-Podolsky-Rosen pairs are used to distribute a secret key except those chosen for eavesdropping check, because the communication parties measure each of their particles in an invariable measuring basis. The first protocol is based on the ideal of qubit transmission in blocks. Although it need quantum memory, its theoretic efficiency approximates to 100%. The second protocol does not need quantum memory and its efficiency for qubits can achieve 100%. In the third protocol, we prese…
We consider the asymptotic key rates achieved in the simplest quantum key distribution protocols, namely the BB84 and the six-state protocols, when non-uniform noise is present in the system. We first observe that higher qubit error rates do not necessarily imply lower key rates. Secondly, we consider protocols with advantage distillation and show that it can be advantageous to use the basis with higher quantum bit error rate for the key generation. We then discuss the relation between advantage distillation and entanglement distillation protocols. We show that applying advantage distillation …
We propose an easy implementable prepare-and-measure protocol for robust quantum key distribution with photon polarization. The protocol is fault tolerant against collective random unitary channel noise. The protocol does not need any collective quantum measurement or quantum memory. A security proof and a specific linear optical realization using spontaneous parametric down conversion are given.
Recently proposed quantum key distribution protocols are shown to be vulnerable to a classic man-in-the-middle attack using entangled pairs created by Eve. It appears that the attack could be applied to any protocol that relies on manipulation and return of entangled qubits to create a shared key. The protocols that are cryptanalyzed in this paper were proven secure with respect to some eavesdropping approaches, and results reported here do not invalidate these proofs. Rather, they suggest that quantum cryptographic protocols, like conventional protocols, may be vulnerable to methods of attack…
We study the equivalence between a realistic quantum key distribution protocol using coherent states and homodyne detection and a formal entanglement purification protocol. Maximally-entangled qubit pairs that one can extract in the formal protocol correspond to secret key bits in the realistic protocol. More specifically, we define a qubit encoding scheme that allows the formal protocol to produce more than one entangled qubit pair per coherent state, or equivalently for the realistic protocol, more than one secret key bit. The entanglement parameters are estimated using quantum tomography. W…
We propose a quantum key distribution (QKD) protocol that enables three parties agree at once on a shared common random bit string in presence of an eavesdropper without use of entanglement. We prove its unconditional security and analyze the key rate.
We study cryptography based on operator theory, and propose quantum no-key (QNK) protocols from the perspective of operator theory, then present a framework of QNK protocols. The framework is expressed in two forms: trace-preserving quantum operators and natural presentations. Then we defined the information-theoretical security of QNK protocols and the security of identification keys. Two kinds of QNK protocols are also proposed. The first scheme is constructed based on unitary transformation, and the other is constructed based on two multiplicative commutative sets.
We show that replacing the usual sifting step of the standard quantum-key-distribution protocol BB84 by a one-way reverse reconciliation procedure increases its robustness against photon-number-splitting (PNS) attacks to the level of the SARG04 protocol while keeping the raw key-rate of BB84. This protocol, which uses the same state and detection than BB84, is the m=4 member of a protocol-family using m polarization states which we introduce here. We show that the robustness of these protocols against PNS attacks increases exponentially with m, and that the effective keyrate of optimized weak …
It has been shown that in the asymptotic case of infinite-key length the 2-decoy state QKD protocol outperforms the 1-decoy state protocol. Here, we present a finite-key analysis of the 1-decoy method. Interestingly, we find that for practical block sizes of up to $10^8$ bits, the 1-decoy protocol achieves for almost all experimental settings higher secret key rates than the 2-decoy protocol. Since using only one decoy is also easier to implement, we conclude that it is the best choice for practical QKD.
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.
We prove the security of the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution. We first give a key distribution protocol based on entanglement purification, which can be proven secure using methods from Lo and Chau's proof of security for a similar protocol. We then show that the security of this protocol implies the security of BB84. The entanglement-purification based protocol uses Calderbank-Shor-Steane (CSS) codes, and properties of these codes are used to remove the use of quantum computation from the Lo-Chau protocol.
Two-way quantum key distribution protocols utilize bi-directional quantum communication to establish a shared secret key. Due to the increased attack surface, security analyses remain challenging. Here we investigate a high-dimensional variant of the Ping Pong protocol and perform an information theoretic security analysis in the finite-key setting. Our methods may be broadly applicable to other QKD protocols, especially those relying on two-way channels. Along the way, we show some fascinating benefits to high-dimensional quantum states applied to two-way quantum communication.
The sending-or-not-sending (SNS) protocol of the twin-field quantum key distribution (TFQKD) can tolerant large misalignment error and its key rate can exceed the bound of repeaterless QKD. But the original SNS protocol requires the two users to use the same source parameters. Here we propose a general protocol with asymmetric source parameters and give the security proof of this protocol. Our general protocol has a much better performance than that of the original SNS protocol when the channel of the system is asymmetric.
In all papers on the BB84 protocol, the transmission probability of each bit value is usually set to be equal. In this paper, we show that by assigning different transmission probability to each transmitted qubit within a single polarization basis, we can generally improve the key generation rate of the BB84 protocol and achieve a higher key rate.
Secure key rate of decoy-state quantum key distribution protocols has been improved with biased basis choice, however, the security standards and parameters of current protocols are different. As a result, we cannot give an accurate key rate comparison between different kinds of protocols. Taking the schemes based on different formula of secure key rate as examples, we give a fair comparison between typical protocols under universal composable security standard. Through analyzing the relationship of security parameters in post-processing stage and final secure key, we achieve the unified quant…
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.
Quantum key agreement requires all participants to recover the shared key together, so it is crucial to resist the participant attack. In this paper, we propose a verifiable multi-party quantum key agreement protocol based on the six-qubit cluster states. A verifiable distributor who preserves some subsequences of the six-qubit cluster states is introduced into this protocol, thus the participants can not obtain the shared key in advance. Besides, the correctness and simultaneity of the shared key are guaranteed by the trusted design combiner and homomorphic hash function. Furthermore, the sec…
Two orthogonal-state-based protocols of quantum key agreement (QKA) are proposed. The first protocol of QKA proposed here is designed for two-party QKA, whereas the second protocol is designed for multi-party QKA. Security of these orthogonal-state-based protocols arise from monogamy of entanglement. This is in contrast to the existing protocols of QKA where security arises from the use of non-orthogonal state (non-commutativity principle). Further, it is shown that all the quantum systems that are useful for implementation of quantum dialogue and most of the protocols of secure direct quantum…
We use the noisy entanglement-assisted classical capacity formula [arXiv:1609.08592] to create a coherent-attack security framework for Gaussian two-way quantum key distribution protocols in the asymptotic region.
Recently spherical codes were introduced as potentially more capable ensembles for quantum key distribution. Here we develop specific key creation protocols for the two qubit-based spherical codes, the trine and tetrahedron, and analyze them in the context of a suitably-tailored intercept/resend attack, both in standard form, and a ``gentler'' version whose back-action on the quantum state is weaker. When compared to the standard unbiased basis protocols, BB84 and six-state, two distinct advantages are found. First, they offer improved tolerance of eavesdropping, the trine besting its counterp…
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.
Quantum transducers play a crucial role in hybrid quantum networks. A good quantum transducer can faithfully convert quantum signals from one mode to another with minimum decoherence. Most investigations of quantum transduction are based on the protocol of direct mode conversion. However, the direct protocol requires the matching condition, which in practice is not always feasible. Here we propose an adaptive protocol for quantum transducers, which can convert quantum signals without requiring the matching condition. The adaptive protocol only consists of Gaussian operations, feasible in vario…
A continuous-variable quantum key distribution protocol based on squeezed states and heterodyne detection is introduced and shown to attain higher secret key rates over a noisy line than any other one-way Gaussian protocol. This increased resistance to channel noise can be understood as resulting from purposely adding noise to the signal that is converted into the secret key. This notion of noise-enhanced tolerance to noise also provides a better physical insight into the poorly understood discrepancies between the previously defined families of Gaussian protocols.
In this paper, we consider continuous-variable quantum key distribution (QKD) protocols which use non-Gaussian modulations. These specific modulation schemes are compatible with very efficient error correction procedures, hence allowing the protocols to outperform previous protocols in terms of achievable range. In their simplest implementation, these protocols are secure for any linear quantum channels (hence against Gaussian attacks). We also show how the use of decoy states makes the protocols secure against arbitrary collective attacks, which implies their unconditional security in the asy…
Two-way Gaussian protocols have the potential to increase quantum key distribution (QKD) protocols' secret-key rates by orders of magnitudes~[Phys.~Rev.~A {\bf 94}, 012322 (2016)]. Security proofs for two-way protocols, however, are underdeveloped at present. In this paper, we establish a security proof framework for the general coherent attack on two-way Gaussian protocols in the asymptotic regime. We first prove that coherent-attack security can be reduced to collective-attack security for all two-way QKD protocols. Next, we identify two different constraints that each provide intrusion para…
We introduce a new relativistic orthogonal states quantum key distribution protocol which leverages the properties of both quantum mechanics and special relativity to securely encode multiple bits onto the spatio-temporal modes of a single photon. If the protocol is implemented using a single photon source, it can have a key generation rate faster than the repetition rate of the source, enabling faster secure communication than is possible with existing protocols. Further, we provide a proof that the protocol is secure and give a method of implementing the protocol using line-of-sight and fibe…
Semi-quantum key distribution protocols are designed to allow two users to establish a secure secret key when one of the two users is limited to performing certain "classical" operations. There have been several such protocols developed recently, however, due to their reliance on a two-way quantum communication channel (and thus, the attacker's opportunity to interact with the qubit twice), their security analysis is difficult and little is known concerning how secure they are compared to their fully quantum counterparts. In this paper we prove the unconditional security of a particular semi-q…
