Quantum key distribution protocol using random bases
NASA Astrophysics Data System (ADS)
Meslouhi, A.; Amellal, H.; Hassouni, Y.; El Baz, M.; El Allati, A.
2016-04-01
In order to enhance the quantum key distribution (QKD) security, a new protocol, “QKDPRB” based on random bases is proposed. It consists of using standard encoding bases moving circularly with a variable rotational angle α which depends on angular velocity ω(t); thus, the traditional bases turn into relative ones. To prove the security and the efficiency of the protocol, we present a universal demonstration which proves a high level security of the proposed protocol, even in the presence of the intercept and resend attack. Finally, the QKDPRB may improve the security of QKD.
An improved quantum key distribution protocol
NASA Astrophysics Data System (ADS)
Wu, Ting-wan; Wu, Guo-hua
2008-08-01
This paper presented an improved quantum key distribution protocol of the quantum cryptology. Using the same measure polarizer as BB84 protocol, the improved protocol we designed with not any classical channel, but a new looped quantum channel instead, so the job of sending and receiving can be finished only by one same person. It brings several good points: the utilization ratio of photons 100% in perfect condition, at least twice over other protocols, or even higher; the public channel easy to be attacked is avoided. Further, the improved protocol authenticates the legal communicators with pre-share information, so that no attacker can jump over the progress of authentication. Be alien from the protocol of BB84, the improved protocol uses message summary to detect whether messages intercepted by attacker. Because the message summary is encrypted by one-time-pad method using pre-share information, attacker could not alter the message summary and that not to be discovered. Moreover, some theoretical analysis to the improved protocol given with information theory: we used the measure channel concept for quantum detection, and calculated the information quantity obtained by attacker in the quantum secrecy communication. The analysis results provide the theory criterion for the legal communicators and the attackers.
A Contextuality Based Quantum Key Distribution Protocol
NASA Astrophysics Data System (ADS)
Troupe, James
In 2005 Spekkens presented a generalization of noncontextuality that applies to imperfect measurements (POVMs) by allowing the underlying hidden variable model to be indeterministic. In addition, unlike traditional Bell-Kochen-Specker noncontextuality, HV models of a single qubit were shown to be contextual under this definition. Thus, not all single qubit POVM measurement outcomes can be modeled classically. Recently M. Pusey showed that, under certain conditions, exhibiting an anomalous weak value (i.e. values outside the eigenspectrum of the observable) implies contextuality. We will present a new single qubit prepare and measure QKD protocol that uses observation of anomalous weak values of particular observables to estimate the quantum channel error rate and certify the security of the channel. We also argue that it is the ``degree'' of contextuality of the noisy qubits exiting the channel that fundamentally determine the secure key rate. A benefit of this approach is that the security does not depend on the fair sampling assumption, and so is not compromised by Eve controlling Bob's measurement devices. Thus, it retains much of the benefit of ``Measurement Device Independent'' QKD protocols while only using single photon preparations and measurements. Supported by the Office of Naval Research under Grant N00014-15-1-2225.
Authenticated semi-quantum key distribution protocol using Bell states
NASA Astrophysics Data System (ADS)
Yu, Kun-Fei; Yang, Chun-Wei; Liao, Ci-Hong; Hwang, Tzonelih
2014-06-01
This study presents the first authenticated semi-quantum key distribution (ASQKD) protocols without using authenticated classical channels. By pre-sharing a master secret key between two communicants, a sender with advanced quantum devices can transmit a working key to a receiver, who can merely perform classical operations. The idea of ASQKD enables establishment of a key hierarchy in security systems that also eases the key management problem. The proposed protocols are free from several well-known attacks
Multiparty quantum-key-distribution protocol without use of entanglement
Matsumoto, Ryutaroh
2007-12-15
We propose a quantum-key-distribution protocol that enables three parties to agree at once on a shared common random bit string in the presence of an eavesdropper without use of entanglement. We prove its unconditional security and analyze the key rate.
Self-Referenced Continuous-Variable Quantum Key Distribution Protocol
NASA Astrophysics Data System (ADS)
Soh, Daniel B. S.; Brif, Constantin; Coles, Patrick J.; Lütkenhaus, Norbert; Camacho, Ryan M.; Urayama, Junji; Sarovar, Mohan
2015-10-01
We introduce a new continuous-variable quantum key distribution (CV-QKD) protocol, self-referenced CV-QKD, that eliminates the need for transmission of a high-power local oscillator between the communicating parties. In this protocol, each signal pulse is accompanied by a reference pulse (or a pair of twin reference pulses), used to align Alice's and Bob's measurement bases. The method of phase estimation and compensation based on the reference pulse measurement can be viewed as a quantum analog of intradyne detection used in classical coherent communication, which extracts the phase information from the modulated signal. We present a proof-of-principle, fiber-based experimental demonstration of the protocol and quantify the expected secret key rates by expressing them in terms of experimental parameters. Our analysis of the secret key rate fully takes into account the inherent uncertainty associated with the quantum nature of the reference pulse(s) and quantifies the limit at which the theoretical key rate approaches that of the respective conventional protocol that requires local oscillator transmission. The self-referenced protocol greatly simplifies the hardware required for CV-QKD, especially for potential integrated photonics implementations of transmitters and receivers, with minimum sacrifice of performance. As such, it provides a pathway towards scalable integrated CV-QKD transceivers, a vital step towards large-scale QKD networks.
Self-referenced continuous-variable quantum key distribution protocol
Soh, Daniel B. S.; Brif, Constantin; Coles, Patrick J.; Lutkenhaus, Norbert; Camacho, Ryan M.; Urayama, Junji; Sarovar, Mohan
2015-10-21
Here, we introduce a new continuous-variable quantum key distribution (CV-QKD) protocol, self-referenced CV-QKD, that eliminates the need for transmission of a high-power local oscillator between the communicating parties. In this protocol, each signal pulse is accompanied by a reference pulse (or a pair of twin reference pulses), used to align Alice’s and Bob’s measurement bases. The method of phase estimation and compensation based on the reference pulse measurement can be viewed as a quantum analog of intradyne detection used in classical coherent communication, which extracts the phase information from the modulated signal. We present a proof-of-principle, fiber-based experimental demonstration ofmore » the protocol and quantify the expected secret key rates by expressing them in terms of experimental parameters. Our analysis of the secret key rate fully takes into account the inherent uncertainty associated with the quantum nature of the reference pulse(s) and quantifies the limit at which the theoretical key rate approaches that of the respective conventional protocol that requires local oscillator transmission. The self-referenced protocol greatly simplifies the hardware required for CV-QKD, especially for potential integrated photonics implementations of transmitters and receivers, with minimum sacrifice of performance. As such, it provides a pathway towards scalable integrated CV-QKD transceivers, a vital step towards large-scale QKD networks.« less
Self-referenced continuous-variable quantum key distribution protocol
Soh, Daniel B. S.; Brif, Constantin; Coles, Patrick J.; Lutkenhaus, Norbert; Camacho, Ryan M.; Urayama, Junji; Sarovar, Mohan
2015-10-21
Here, we introduce a new continuous-variable quantum key distribution (CV-QKD) protocol, self-referenced CV-QKD, that eliminates the need for transmission of a high-power local oscillator between the communicating parties. In this protocol, each signal pulse is accompanied by a reference pulse (or a pair of twin reference pulses), used to align Alice’s and Bob’s measurement bases. The method of phase estimation and compensation based on the reference pulse measurement can be viewed as a quantum analog of intradyne detection used in classical coherent communication, which extracts the phase information from the modulated signal. We present a proof-of-principle, fiber-based experimental demonstration of the protocol and quantify the expected secret key rates by expressing them in terms of experimental parameters. Our analysis of the secret key rate fully takes into account the inherent uncertainty associated with the quantum nature of the reference pulse(s) and quantifies the limit at which the theoretical key rate approaches that of the respective conventional protocol that requires local oscillator transmission. The self-referenced protocol greatly simplifies the hardware required for CV-QKD, especially for potential integrated photonics implementations of transmitters and receivers, with minimum sacrifice of performance. As such, it provides a pathway towards scalable integrated CV-QKD transceivers, a vital step towards large-scale QKD networks.
Numerical analysis of decoy state quantum key distribution protocols
Harrington, Jim W; Rice, Patrick R
2008-01-01
Decoy state protocols are a useful tool for many quantum key distribution systems implemented with weak coherent pulses, allowing significantly better secret bit rates and longer maximum distances. In this paper we present a method to numerically find optimal three-level protocols, and we examine how the secret bit rate and the optimized parameters are dependent on various system properties, such as session length, transmission loss, and visibility. Additionally, we show how to modify the decoy state analysis to handle partially distinguishable decoy states as well as uncertainty in the prepared intensities.
Practical quantum key distribution protocol without monitoring signal disturbance.
Sasaki, Toshihiko; Yamamoto, Yoshihisa; Koashi, Masato
2014-05-22
Quantum cryptography exploits the fundamental laws of quantum mechanics to provide a secure way to exchange private information. Such an exchange requires a common random bit sequence, called a key, to be shared secretly between the sender and the receiver. The basic idea behind quantum key distribution (QKD) has widely been understood as the property that any attempt to distinguish encoded quantum states causes a disturbance in the signal. As a result, implementation of a QKD protocol involves an estimation of the experimental parameters influenced by the eavesdropper's intervention, which is achieved by randomly sampling the signal. If the estimation of many parameters with high precision is required, the portion of the signal that is sacrificed increases, thus decreasing the efficiency of the protocol. Here we propose a QKD protocol based on an entirely different principle. The sender encodes a bit sequence onto non-orthogonal quantum states and the receiver randomly dictates how a single bit should be calculated from the sequence. The eavesdropper, who is unable to learn the whole of the sequence, cannot guess the bit value correctly. An achievable rate of secure key distribution is calculated by considering complementary choices between quantum measurements of two conjugate observables. We found that a practical implementation using a laser pulse train achieves a key rate comparable to a decoy-state QKD protocol, an often-used technique for lasers. It also has a better tolerance of bit errors and of finite-sized-key effects. We anticipate that this finding will give new insight into how the probabilistic nature of quantum mechanics can be related to secure communication, and will facilitate the simple and efficient use of conventional lasers for QKD. PMID:24848060
Key rate for calibration robust entanglement based BB84 quantum key distribution protocol
Gittsovich, O.; Moroder, T.
2014-12-04
We apply the approach of verifying entanglement, which is based on the sole knowledge of the dimension of the underlying physical system to the entanglement based version of the BB84 quantum key distribution protocol. We show that the familiar one-way key rate formula holds already if one assumes the assumption that one of the parties is measuring a qubit and no further assumptions about the measurement are needed.
Simple proof of security of the BB84 quantum key distribution protocol
Shor; Preskill
2000-07-10
We prove that the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution is secure. 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 codes, and properties of these codes are used to remove the use of quantum computation from the Lo-Chau protocol. PMID:10991303
Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
Shor, Peter W.; Preskill, John
2000-07-10
We prove that the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution is secure. 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 codes, and properties of these codes are used to remove the use of quantum computation from the Lo-Chau protocol. (c) 2000 The American Physical Society.
A hybrid quantum key distribution protocol based on extended unitary operations and fountain codes
NASA Astrophysics Data System (ADS)
Lai, Hong; Xue, Liyin; Orgun, Mehmet A.; Xiao, Jinghua; Pieprzyk, Josef
2015-02-01
In 1984, Bennett and Brassard designed the first quantum key distribution protocol, whose security is based on quantum indeterminacy. Since then, there has been growing research activities, aiming in designing new, more efficient and secure key distribution protocols. The work presents a novel hybrid quantum key distribution protocol. The key distribution is derived from both quantum and classical data. This is why it is called hybrid. The protocol applies extended unitary operations derived from four basic unitary operations and distributed fountain codes. Compared to other protocols published so far, the new one is more secure (provides authentication of parties and detection of eavesdropping) and efficient. Moreover, our protocol still works over noisy and lossy channels.
Molotkov, S. N.
2012-05-15
The fundamental quantum mechanics prohibitions on the measurability of quantum states allow secure key distribution between spatially remote users to be performed. Experimental and commercial implementations of quantum cryptography systems, however, use components that exist at the current technology level, in particular, one-photon avalanche photodetectors. These detectors are subject to the blinding effect. It was shown that all the known basic quantum key distribution protocols and systems based on them are vulnerable to attacks with blinding of photodetectors. In such attacks, an eavesdropper knows all the key transferred, does not produce errors at the reception side, and remains undetected. Three protocols of quantum key distribution stable toward such attacks are suggested. The security of keys and detection of eavesdropping attempts are guaranteed by the internal structure of protocols themselves rather than additional technical improvements.
A practical protocol for three-party authenticated quantum key distribution
NASA Astrophysics Data System (ADS)
Guan, D. J.; Wang, Yuan-Jiun; Zhuang, E. S.
2014-06-01
Recently, Hwang et al. proposed two three-party authenticated quantum key distribution protocols for two communicating parties to establish a session key via a trusted center. They also showed their protocols were secure by using random oracle model. However, their protocols were designed to run in an ideal world. In this paper, we present a more practical protocol by considering some issues, which have not been addressed in their protocols. These issues include (1) session key consistence, (2) online guessing attack, and (3) noise in quantum channels. To deal with these issues, we use error correction code and key evolution. We also give a formal proof for the security of our protocols by using standard reduction, instead of the random oracle model.
Secure coherent-state quantum key distribution protocols with efficient reconciliation
Assche, G. van; Cerf, N.J.
2005-05-15
We study the equivalence of a realistic quantum key distribution protocol using coherent states and homodyne detection with 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 entangled oscillator pair or, equivalently for the realistic protocol, more than one secret key bit per coherent state. The entanglement parameters are estimated using quantum tomography. We analyze the properties of the encoding scheme and investigate the resulting secret key rate in the important case of the attenuation channel.
Finite-size key in the Bennett 1992 quantum-key-distribution protocol for Rényi entropies
NASA Astrophysics Data System (ADS)
Mafu, Mhlambululi; Garapo, Kevin; Petruccione, Francesco
2013-12-01
A realistic quantum-key-distribution protocol necessarily runs with finite resources. Usually, security proofs for existing quantum key distribution are asymptotic in the sense that certain parameters are exceedingly large compared to practical realistic values. In this paper, we derive bounds on the secret key rates for the Bennett 1992 protocol, which includes a preprocessing step. The derivation for a finite-size key is expressed as an optimization problem by using results from the uncertainty relations and the smooth Rényi entropies.
Continuous-variable quantum-key-distribution protocols with a non-Gaussian modulation
Leverrier, Anthony; Grangier, Philippe
2011-04-15
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 asymptotic limit.
Finite-key-size security of the Phoenix-Barnett-Chefles 2000 quantum-key-distribution protocol
NASA Astrophysics Data System (ADS)
Mafu, Mhlambululi; Garapo, Kevin; Petruccione, Francesco
2014-09-01
The postselection technique was introduced by Christandl, König, and Renner [Phys. Rev. Lett. 102, 020504 (2009), 10.1103/PhysRevLett.102.020504] in order to simplify the security of quantum-key-distribution schemes. Here, we present how it can be applied to study the security of the Phoenix-Barnett-Chefles 2000 trine-state protocol, a symmetric version of the Bennett 1992 protocol.
Security of six-state quantum key distribution protocol with threshold detectors
Kato, Go; Tamaki, Kiyoshi
2016-01-01
The security of quantum key distribution (QKD) is established by a security proof, and the security proof puts some assumptions on the devices consisting of a QKD system. Among such assumptions, security proofs of the six-state protocol assume the use of photon number resolving (PNR) detector, and as a result the bit error rate threshold for secure key generation for the six-state protocol is higher than that for the BB84 protocol. Unfortunately, however, this type of detector is demanding in terms of technological level compared to the standard threshold detector, and removing the necessity of such a detector enhances the feasibility of the implementation of the six-state protocol. Here, we develop the security proof for the six-state protocol and show that we can use the threshold detector for the six-state protocol. Importantly, the bit error rate threshold for the key generation for the six-state protocol (12.611%) remains almost the same as the one (12.619%) that is derived from the existing security proofs assuming the use of PNR detectors. This clearly demonstrates feasibility of the six-state protocol with practical devices. PMID:27443610
Security of six-state quantum key distribution protocol with threshold detectors.
Kato, Go; Tamaki, Kiyoshi
2016-01-01
The security of quantum key distribution (QKD) is established by a security proof, and the security proof puts some assumptions on the devices consisting of a QKD system. Among such assumptions, security proofs of the six-state protocol assume the use of photon number resolving (PNR) detector, and as a result the bit error rate threshold for secure key generation for the six-state protocol is higher than that for the BB84 protocol. Unfortunately, however, this type of detector is demanding in terms of technological level compared to the standard threshold detector, and removing the necessity of such a detector enhances the feasibility of the implementation of the six-state protocol. Here, we develop the security proof for the six-state protocol and show that we can use the threshold detector for the six-state protocol. Importantly, the bit error rate threshold for the key generation for the six-state protocol (12.611%) remains almost the same as the one (12.619%) that is derived from the existing security proofs assuming the use of PNR detectors. This clearly demonstrates feasibility of the six-state protocol with practical devices. PMID:27443610
Security of six-state quantum key distribution protocol with threshold detectors
NASA Astrophysics Data System (ADS)
Kato, Go; Tamaki, Kiyoshi
2016-07-01
The security of quantum key distribution (QKD) is established by a security proof, and the security proof puts some assumptions on the devices consisting of a QKD system. Among such assumptions, security proofs of the six-state protocol assume the use of photon number resolving (PNR) detector, and as a result the bit error rate threshold for secure key generation for the six-state protocol is higher than that for the BB84 protocol. Unfortunately, however, this type of detector is demanding in terms of technological level compared to the standard threshold detector, and removing the necessity of such a detector enhances the feasibility of the implementation of the six-state protocol. Here, we develop the security proof for the six-state protocol and show that we can use the threshold detector for the six-state protocol. Importantly, the bit error rate threshold for the key generation for the six-state protocol (12.611%) remains almost the same as the one (12.619%) that is derived from the existing security proofs assuming the use of PNR detectors. This clearly demonstrates feasibility of the six-state protocol with practical devices.
Hwang, Won-Young; Matsumoto, Keiji; Imai, Hiroshi; Kim, Jaewan; Lee, Hai-Woong
2003-02-01
We discuss a long code problem in the Bennett-Brassard 1984 (BB84) quantum-key-distribution protocol and describe how it 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.
NASA Astrophysics Data System (ADS)
Ma, Xiang-Chun; Sun, Shi-Hai; Jiang, Mu-Sheng; Liang, Lin-Mei
2013-05-01
We present the wavelength attack on a practical continuous-variable quantum-key-distribution system with a heterodyne protocol, in which the transmittance of beam splitters at Bob's station is wavelength dependent. Our strategy is proposed independent of but analogous to that of Huang [arXiv:1206.6550v1 [quant-ph
Attacks on quantum key distribution protocols that employ non-ITS authentication
NASA Astrophysics Data System (ADS)
Pacher, C.; Abidin, A.; Lorünser, T.; Peev, M.; Ursin, R.; Zeilinger, A.; Larsson, J.-Å.
2016-01-01
We demonstrate how adversaries with large computing resources can break quantum key distribution (QKD) protocols which employ a particular message authentication code suggested previously. This authentication code, featuring low key consumption, is not information-theoretically secure (ITS) since for each message the eavesdropper has intercepted she is able to send a different message from a set of messages that she can calculate by finding collisions of a cryptographic hash function. However, when this authentication code was introduced, it was shown to prevent straightforward man-in-the-middle (MITM) attacks against QKD protocols. In this paper, we prove that the set of messages that collide with any given message under this authentication code contains with high probability a message that has small Hamming distance to any other given message. Based on this fact, we present extended MITM attacks against different versions of BB84 QKD protocols using the addressed authentication code; for three protocols, we describe every single action taken by the adversary. For all protocols, the adversary can obtain complete knowledge of the key, and for most protocols her success probability in doing so approaches unity. Since the attacks work against all authentication methods which allow to calculate colliding messages, the underlying building blocks of the presented attacks expose the potential pitfalls arising as a consequence of non-ITS authentication in QKD post-processing. We propose countermeasures, increasing the eavesdroppers demand for computational power, and also prove necessary and sufficient conditions for upgrading the discussed authentication code to the ITS level.
A Large-alphabet Quantum Key Distribution Protocol Using Orbital Angular Momentum Entanglement
NASA Astrophysics Data System (ADS)
Zhao, Sheng-Mei; Gong, Long-Yan; Li, Yong-Qiang; Yang, Hua; Sheng, Yu-Bo; Cheng, Wei-Wen
2013-06-01
We experimentally demonstrate a quantum key distribution protocol using entangled photon pairs in orbital angular momentum (OAM). Here Alice uses a fixed phase hologram to modulate her OAM state on one photon with a spatial light modulator (SLM), while Bob uses the designed N different phase holograms for his N-based keys on the other photon with his SLM. With coincidences, Alice can fully retrieve the keys sent by Bob without reconciliation. We report the experiment results with N = 3 and OAM eigenmodes |l = ±1>, and discuss the security from the light path and typical attacks.
Towards secure quantum key distribution protocol for wireless LANs: a hybrid approach
NASA Astrophysics Data System (ADS)
Naik, R. Lalu; Reddy, P. Chenna
2015-12-01
The primary goals of security such as authentication, confidentiality, integrity and non-repudiation in communication networks can be achieved with secure key distribution. Quantum mechanisms are highly secure means of distributing secret keys as they are unconditionally secure. Quantum key distribution protocols can effectively prevent various attacks in the quantum channel, while classical cryptography is efficient in authentication and verification of secret keys. By combining both quantum cryptography and classical cryptography, security of communications over networks can be leveraged. Hwang, Lee and Li exploited the merits of both cryptographic paradigms for provably secure communications to prevent replay, man-in-the-middle, and passive attacks. In this paper, we propose a new scheme with the combination of quantum cryptography and classical cryptography for 802.11i wireless LANs. Since quantum cryptography is premature in wireless networks, our work is a significant step forward toward securing communications in wireless networks. Our scheme is known as hybrid quantum key distribution protocol. Our analytical results revealed that the proposed scheme is provably secure for wireless networks.
NASA Astrophysics Data System (ADS)
Grazioso, Fabio; Grosshans, Frédéric
2013-11-01
We propose a family of sifting-less quantum-key-distribution protocols which use reverse reconciliation, and are based on weak coherent pulses (WCPs) polarized along m different directions. When m=4, the physical part of the protocol is identical to most experimental implementations of BB84 [Bennett and Brassard, in Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing (IEEE, New York, 1984)] and SARG04 [Scarani, Acín, Ribordy, and Gisin, Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.92.057901 92, 057901 (2004); Acín, Gisin, and Scarani, Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.69.012309 69, 012309 (2004)] protocols and they differ only in classical communications and data processing. We compute their total key rate as a function of the channel transmission T, using general information theoretical arguments, and we show that they have a higher key rate than the more standard protocols, both for fixed and optimized average photon number of the WCPs. When no decoy-state protocols (DSPs) [Hwang, Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.91.057901 91, 057901 (2003); Lo, Ma, and Chen, Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.94.230504 94, 230504 (2005); Wang, Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.72.012322 72, 012322 (2005)] are applied, the scaling of the key rate with transmission is improved from T2 for BB84 to T1+(1)/(m-2). If a DSP is applied, we show how the key rates scale linearly with T, with an improvement of the prefactor by 75.96% for m=4. High values of m allow one to asymptotically approach the key rate obtained with ideal single-photon pulses. The fact that the key rates of these sifting-less protocols are higher compared to those of the aforementioned more standard protocols show that the latter are not optimal, since they do not extract all the available secret keys from the experimental correlations.
NASA Astrophysics Data System (ADS)
Henao, C. Ivan; Serra, Roberto M.
2015-11-01
Within the broad research scenario of quantum secure communication, two-way quantum key distribution (TWQKD) is a relatively new proposal for sharing secret keys that is not yet fully explored. We analyze the security of TWQKD schemes that use qubits prepared in nonorthogonal states to transmit the key. Investigating protocols that employ an arbitrary number of bases for the channel preparation, we show, in particular, that the security of the LM05 protocol cannot be improved by the use of more than two preparation bases. We also provide an alternative proof of unconditional security for a deterministic TWQKD protocol recently proposed in Beaudry et al., Phys. Rev. A 88, 062302 (2013), 10.1103/PhysRevA.88.062302. In addition, we introduce a deterministic protocol named "TWQKD six-state" and compute an analytical lower bound (which can be tightened) for the maximum amount of information that an eavesdropper could extract in this case. An interesting advantage of our approach to the security analysis of TWQKD is the great simplicity and transparency of the derivations.
Practical private database queries based on a quantum-key-distribution protocol
Jakobi, Markus; Simon, Christoph; Gisin, Nicolas; Bancal, Jean-Daniel; Branciard, Cyril; Walenta, Nino; Zbinden, Hugo
2011-02-15
Private queries allow a user, Alice, to learn an element of a database held by a provider, Bob, without revealing which element she is interested in, while limiting her information about the other elements. We propose to implement private queries based on a quantum-key-distribution protocol, with changes only in the classical postprocessing of the key. This approach makes our scheme both easy to implement and loss tolerant. While unconditionally secure private queries are known to be impossible, we argue that an interesting degree of security can be achieved by relying on fundamental physical principles instead of unverifiable security assumptions in order to protect both the user and the database. We think that the scope exists for such practical private queries to become another remarkable application of quantum information in the footsteps of quantum key distribution.
Some physics and system issues in the security analysis of quantum key distribution protocols
NASA Astrophysics Data System (ADS)
Yuen, Horace P.
2014-10-01
In this paper, we review a number of issues on the security of quantum key distribution (QKD) protocols that bear directly on the relevant physics or mathematical representation of the QKD cryptosystem. It is shown that the cryptosystem representation itself may miss out many possible attacks, which are not accounted for in the security analysis and proofs. Hence, the final security claims drawn from such analysis are not reliable, apart from foundational issues about the security criteria that are discussed elsewhere. The cases of continuous-variable QKD and multi-photon sources are elaborated upon.
Trojan horse attack free fault-tolerant quantum key distribution protocols
NASA Astrophysics Data System (ADS)
Yang, Chun-Wei; Hwang, Tzonelih
2013-11-01
This work proposes two quantum key distribution (QKD) protocols—each of which is robust under one kind of collective noises—collective-dephasing noise and collective-rotation noise. Due to the use of a new coding function which produces error-robust codewords allowing one-time transmission of quanta, the proposed QKD schemes are fault-tolerant and congenitally free from Trojan horse attacks without having to use any extra hardware. Moreover, by adopting two Bell state measurements instead of a 4-GHZ state joint measurement for decoding, the proposed protocols are practical in combating collective noises.
Security bound of two-basis quantum-key-distribution protocols using qudits
Nikolopoulos, Georgios M.; Alber, Gernot
2005-09-15
We investigate the security bounds of quantum-cryptographic protocols using d-level systems. In particular, we focus on schemes that use two mutually unbiased bases, thus extending the Bennett-Brassard 1984 quantum-key-distribution scheme to higher dimensions. Under the assumption of general coherent attacks, we derive an analytic expression for the ultimate upper security bound of such quantum-cryptography schemes. This bound is well below the predictions of optimal cloning machines. The possibility of extraction of a secret key beyond entanglement distillation is discussed. In the case of qutrits we argue that any eavesdropping strategy is equivalent to a symmetric one. For higher dimensions such an equivalence is generally no longer valid.
Performance of a quantum key distribution protocol with dual-rail displaced photon states
Podoshvedov, S. A.
2010-04-15
We propose a scheme for a quantum key distribution (QKD) protocol with dual-rail displaced photon states. Displaced single-photon states with different amplitudes carry bit values of code that may be extracted, while coherent states carry nothing and only provide an inconclusive outcome. A real resource of single photons is used, involving imperfections associated with experimental technique that result in a photon state with an admixture of the vacuum state. The protocol is robust against the loss of a single photon and the inefficiency of the detectors. Pulses with large amplitudes, unlike the conventional QKD relying on faint laser pulses, are used that may approximate it to standard telecommunication and may show resistance to eaves-dropping even in settings with high attenuation. Information leakage to the eavesdropper is determined from comparison of the output distributions of the outcomes with ideal ones that are defined by two additional parameters accessible to only those send the pulses. Robustness to some possible eavesdropping attacks is shown.
NASA Astrophysics Data System (ADS)
Sych, Denis V.; Grishanin, Boris A.; Zadkov, Victor N.
2005-06-01
Possibilities of improving characteristics of quantum key distribution (QKD) protocols via variation of character set in quantum alphabets are investigated. QKD protocols with discrete alphabets letters of which form regular polyhedrons on the Bloch sphere (tetrahedron octahedron cube icosahedron and dodecahedron which have 4, 6, 8, 12, and 20 vertexes) and QKD protocol with continuous alphabet which corresponds to the limiting case of a polyhedron with infinitive number of vertexes are considered. Stability of such QKD protocols to the interceptresend and optimal eavesdropping strategies at the individual attacks is studied in detail. It is shown that in case of optimal eavesdropping strategy after safety bases reconciliation critical error rate of the QKD protocol with continuous alphabet surpasses all other protocols. Without basis reconciliation the highest critical error rate have the protocol with tetrahedron-type alphabet.
NASA Astrophysics Data System (ADS)
Mizutani, Akihiro; Imoto, Nobuyuki; Tamaki, Kiyoshi
2015-12-01
Recently, a new type of quantum key distribution, called the round-robin differential-phase-shift (RRDPS) protocol [T. Sasaki et al., Nature (London) 509, 475 (2014), 10.1038/nature13303], was proposed, where the security can be guaranteed without monitoring any statistics. In this Rapid Communication, we investigate source imperfections and side-channel attacks on the source of this protocol. We show that only three assumptions are needed for the security, and no detailed characterizations of the source or the side-channel attacks are needed. This high robustness is another striking advantage of the RRDPS protocol over other protocols.
Curty, Marcos; Ma Xiongfeng; Luetkenhaus, Norbert; Lo, Hoi-Kwong
2010-11-15
Most experimental realizations of quantum key distribution are based on the Bennett-Brassard 1984 (the so-called BB84) protocol. In a typical optical implementation of this scheme, the sender uses an active source to produce the required BB84 signal states. While active state preparation of BB84 signals is a simple and elegant solution in principle, in practice passive state preparation might be desirable in some scenarios, for instance, in those experimental setups operating at high transmission rates. Passive schemes might also be more robust against side-channel attacks than active sources. Typical passive devices involve parametric down-conversion. In this paper, we show that both coherent light and practical single-photon sources are also suitable for passive generation of BB84 signal states. Our method does not require any externally driven element, but only linear optical components and photodetectors. In the case of coherent light, the resulting key rate is similar to the one delivered by an active source. When the sender uses practical single-photon sources, however, the distance covered by a passive transmitter might be longer than that of an active configuration.
Unstructured quantum key distribution
NASA Astrophysics Data System (ADS)
Coles, Patrick; Metodiev, Eric; Lutkenhaus, Norbert
Quantum key distribution (QKD) allows for communication with security guaranteed by quantum theory. The main theoretical problem in QKD is to calculate the secret key rate for a given protocol. Analytical formulas are known for protocols with a high degree of symmetry, since symmetry simplifies the analysis. However, experimental imperfections break symmetries, hence the effect of imperfections on key rates is difficult to estimate. Furthermore, it is an interesting question whether (intentionally) asymmetric protocols could outperform symmetric ones. In this work, we develop a robust numerical approach for calculating the key rate for arbitrary discrete-variable QKD protocols. Ultimately this will allow researchers to study ``unstructured'' protocols, i.e., those that lack symmetry. Our approach relies on transforming the key rate calculation to the dual optimization problem, which dramatically reduces the number of parameters and hence the calculation time. We illustrate our method by investigating some unstructured protocols for which the key rate was previously unknown.
Shapiro, Jeffrey H.
2011-09-15
The effect of scintillation, arising from propagation through atmospheric turbulence, on the sift and error probabilities of a quantum key distribution (QKD) system that uses the weak-laser-pulse version of the Bennett-Brassard 1984 (BB84) protocol is evaluated. Two earth-space scenarios are examined: satellite-to-ground and ground-to-satellite transmission. Both lie in the far-field power-transfer regime. This work complements previous analysis of turbulence effects in near-field terrestrial BB84 QKD [J. H. Shapiro, Phys. Rev. A 67, 022309 (2003)]. More importantly, it shows that scintillation has virtually no impact on the sift and error probabilities in earth-space BB84 QKD, something that has been implicitly assumed in prior analyses for that application. This result contrasts rather sharply with what is known for high-speed laser communications over such paths, in which deep, long-lived scintillation fades present a major challenge to high-reliability operation.
Yu, Wen-Kai; Li, Shen; Yao, Xu-Ri; Liu, Xue-Feng; Wu, Ling-An; Zhai, Guang-Jie
2013-11-20
We present a protocol for the amplification and distribution of a one-time-pad cryptographic key over a point-to-multipoint optical network based on computational ghost imaging (GI) and compressed sensing (CS). It is shown experimentally that CS imaging can perform faster authentication and increase the key generation rate by an order of magnitude compared with the scheme using computational GI alone. The protocol is applicable for any number of legitimate user, thus, the scheme could be used in real intercity networks where high speed and high security are crucial. PMID:24513737
Two-Party secret key distribution via a modified quantum secret sharing protocol
Grice, Warren P.; Evans, Philip G.; Lawrie, Benjamin; Legré, M.; Lougovski, P.; Ray, William R.; Williams, Brian P.; Qi, B.; Smith, A. M.
2015-01-01
We present and demonstrate a method of distributing secret information based on N-party single-qubit Quantum Secret Sharing (QSS) in a modied plug-and-play two-party Quantum Key Distribution (QKD) system with N 2 intermediate nodes and compare it to both standard QSS and QKD. Our setup is based on the Clavis2 QKD system built by ID Quantique but is generalizable to any implementation. We show that any two out of N parties can build a secret key based on partial information from each other and with collaboration from the remaining N 2 parties. This method signicantly reduces the number of resources (singlemore » photon detectors, lasers and dark ber connections) needed to implement QKD on the grid.« less
Two-Party secret key distribution via a modified quantum secret sharing protocol
Grice, Warren P.; Evans, Philip G.; Lawrie, Benjamin; Legré, M.; Lougovski, P.; Ray, William R.; Williams, Brian P.; Qi, B.; Smith, A. M.
2015-01-01
We present and demonstrate a method of distributing secret information based on N-party single-qubit Quantum Secret Sharing (QSS) in a modied plug-and-play two-party Quantum Key Distribution (QKD) system with N 2 intermediate nodes and compare it to both standard QSS and QKD. Our setup is based on the Clavis2 QKD system built by ID Quantique but is generalizable to any implementation. We show that any two out of N parties can build a secret key based on partial information from each other and with collaboration from the remaining N 2 parties. This method signicantly reduces the number of resources (single photon detectors, lasers and dark ber connections) needed to implement QKD on the grid.
Cryptographic robustness of practical quantum cryptography: BB84 key distribution protocol
Molotkov, S. N.
2008-07-15
In real fiber-optic quantum cryptography systems, the avalanche photodiodes are not perfect, the source of quantum states is not a single-photon one, and the communication channel is lossy. For these reasons, key distribution is impossible under certain conditions for the system parameters. A simple analysis is performed to find relations between the parameters of real cryptography systems and the length of the quantum channel that guarantee secure quantum key distribution when the eavesdropper's capabilities are limited only by fundamental laws of quantum mechanics while the devices employed by the legitimate users are based on current technologies. Critical values are determined for the rate of secure real-time key generation that can be reached under the current technology level. Calculations show that the upper bound on channel length can be as high as 300 km for imperfect photodetectors (avalanche photodiodes) with present-day quantum efficiency ({eta} {approx} 20%) and dark count probability (p{sub dark} {approx} 10{sup -7})
NASA Astrophysics Data System (ADS)
Wang, Le; Zhao, Sheng-Mei; Gong, Long-Yan; Cheng, Wei-Wen
2015-12-01
In this paper, we propose a measurement-device-independent quantum-key-distribution (MDI-QKD) protocol using orbital angular momentum (OAM) in free space links, named the OAM-MDI-QKD protocol. In the proposed protocol, the OAM states of photons, instead of polarization states, are used as the information carriers to avoid the reference frame alignment, the decoy-state is adopted to overcome the security loophole caused by the weak coherent pulse source, and the high efficient OAM-sorter is adopted as the measurement tool for Charlie to obtain the output OAM state. Here, Charlie may be an untrusted third party. The results show that the authorized users, Alice and Bob, could distill a secret key with Charlie’s successful measurements, and the key generation performance is slightly better than that of the polarization-based MDI-QKD protocol in the two-dimensional OAM cases. Simultaneously, Alice and Bob can reduce the number of flipping the bits in the secure key distillation. It is indicated that a higher key generation rate performance could be obtained by a high dimensional OAM-MDI-QKD protocol because of the unlimited degree of freedom on OAM states. Moreover, the results show that the key generation rate and the transmission distance will decrease as the growth of the strength of atmospheric turbulence (AT) and the link attenuation. In addition, the decoy states used in the proposed protocol can get a considerable good performance without the need for an ideal source. Project supported by the National Natural Science Foundation of China (Grant Nos. 61271238 and 61475075), the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20123223110003), the Natural Science Research Foundation for Universities of Jiangsu Province of China (Grant No. 11KJA510002), the Open Research Fund of Key Laboratory of Broadband Wireless Communication and Sensor Network Technology, Ministry of Education, China (Grant No. NYKL2015011), and the
Gleim, A V; Egorov, V I; Nazarov, Yu V; Smirnov, S V; Chistyakov, V V; Bannik, O I; Anisimov, A A; Kynev, S M; Ivanova, A E; Collins, R J; Kozlov, S A; Buller, G S
2016-02-01
A quantum key distribution system based on the subcarrier wave modulation method has been demonstrated which employs the BB84 protocol with a strong reference to generate secure bits at a rate of 16.5 kbit/s with an error of 0.5% over an optical channel of 10 dB loss, and 18 bits/s with an error of 0.75% over 25 dB of channel loss. To the best of our knowledge, these results represent the highest channel loss reported for secure quantum key distribution using the subcarrier wave approach. A passive unidirectional scheme has been used to compensate for the polarization dependence of the phase modulators in the receiver module, which resulted in a high visibility of 98.8%. The system is thus fully insensitive to polarization fluctuations and robust to environmental changes, making the approach promising for use in optical telecommunication networks. Further improvements in secure key rate and transmission distance can be achieved by implementing the decoy states protocol or by optimizing the mean photon number used in line with experimental parameters. PMID:26906834
NASA Astrophysics Data System (ADS)
Jacak, Monika; Jacak, Janusz; Jóźwiak, Piotr; Jóźwiak, Ireneusz
2016-06-01
The overview of the current status of quantum cryptography is given in regard to quantum key distribution (QKD) protocols, implemented both on nonentangled and entangled flying qubits. Two commercial R&D platforms of QKD systems are described (the Clavis II platform by idQuantique implemented on nonentangled photons and the EPR S405 Quelle platform by AIT based on entangled photons) and tested for feasibility of their usage in commercial TELECOM fiber metropolitan networks. The comparison of systems efficiency, stability and resistivity against noise and hacker attacks is given with some suggestion toward system improvement, along with assessment of two models of QKD.
NASA Astrophysics Data System (ADS)
Wei, Chun-Yan; Gao, Fei; Wen, Qiao-Yan; Wang, Tian-Yin
2014-12-01
Until now, the only kind of practical quantum private query (QPQ), quantum-key-distribution (QKD)-based QPQ, focuses on the retrieval of a single bit. In fact, meaningful message is generally composed of multiple adjacent bits (i.e., a multi-bit block). To obtain a message from database, the user Alice has to query l times to get each ai. In this condition, the server Bob could gain Alice's privacy once he obtains the address she queried in any of the l queries, since each ai contributes to the message Alice retrieves. Apparently, the longer the retrieved message is, the worse the user privacy becomes. To solve this problem, via an unbalanced-state technique and based on a variant of multi-level BB84 protocol, we present a protocol for QPQ of blocks, which allows the user to retrieve a multi-bit block from database in one query. Our protocol is somewhat like the high-dimension version of the first QKD-based QPQ protocol proposed by Jacobi et al., but some nontrivial modifications are necessary.
Wei, Chun-Yan; Gao, Fei; Wen, Qiao-Yan; Wang, Tian-Yin
2014-01-01
Until now, the only kind of practical quantum private query (QPQ), quantum-key-distribution (QKD)-based QPQ, focuses on the retrieval of a single bit. In fact, meaningful message is generally composed of multiple adjacent bits (i.e., a multi-bit block). To obtain a message from database, the user Alice has to query l times to get each ai. In this condition, the server Bob could gain Alice's privacy once he obtains the address she queried in any of the l queries, since each ai contributes to the message Alice retrieves. Apparently, the longer the retrieved message is, the worse the user privacy becomes. To solve this problem, via an unbalanced-state technique and based on a variant of multi-level BB84 protocol, we present a protocol for QPQ of blocks, which allows the user to retrieve a multi-bit block from database in one query. Our protocol is somewhat like the high-dimension version of the first QKD-based QPQ protocol proposed by Jacobi et al., but some nontrivial modifications are necessary. PMID:25518810
Secret Public Key Protocols Revisited
NASA Astrophysics Data System (ADS)
Lim, Hoon Wei; Paterson, Kenneth G.
Password-based protocols are important and popular means of providing human-to-machine authentication. The concept of secret public keys was proposed more than a decade ago as a means of securing password-based authentication protocols against off-line password guessing attacks, but was later found vulnerable to various attacks. In this paper, we revisit the concept and introduce the notion of identity-based secret public keys. Our new identity-based approach allows secret public keys to be constructed in a very natural way using arbitrary random strings, eliminating the structure found in, for example, RSA or ElGamal keys. We examine identity-based secret public key protocols and give informal security analyses, indicating that they are secure against off-line password guessing and other attacks.
Trojan Horse Attack Free Fault-Tolerant Quantum Key Distribution Protocols Using GHZ States
NASA Astrophysics Data System (ADS)
Chang, Chih-Hung; Yang, Chun-Wei; Hwang, Tzonelih
2016-04-01
Recently, Yang and Hwang (Quantum Inf. Process. 13(3): 781-794, 19) proposed two fault-tolerant QKD protocols based on their proposed coding functions for resisting the collective noise, and their QKD protocols are free from Trojan horse attack without employing any specific detecting devices (e.g., photon number splitter (PNS) and wavelength filter). By using four-particle Greenberger-Horne-Zeilinger (GHZ) state and four-particle GHZ-like state in their proposed coding functions, Yang and Hwang's QKD protocols can resist each kind of the collective noise-collective-dephasing noise, collective-rotation noise. However, their proposed coding function can be improved by the utilization of three-particle GHZ state (three-particle GHZ-like state) instead of four-particle GHZ state (four-particle GHZ-like state) that will eventually reduce the consumption of the qubits. As a result, this study proposed the improved version of Yang and Hwang's coding functions to enhance the qubit efficiency of their schemes from 20 % to 22 %.
Trojan Horse Attack Free Fault-Tolerant Quantum Key Distribution Protocols Using GHZ States
NASA Astrophysics Data System (ADS)
Chang, Chih-Hung; Yang, Chun-Wei; Hwang, Tzonelih
2016-09-01
Recently, Yang and Hwang (Quantum Inf. Process. 13(3): 781-794, 19) proposed two fault-tolerant QKD protocols based on their proposed coding functions for resisting the collective noise, and their QKD protocols are free from Trojan horse attack without employing any specific detecting devices (e.g., photon number splitter (PNS) and wavelength filter). By using four-particle Greenberger-Horne-Zeilinger (GHZ) state and four-particle GHZ-like state in their proposed coding functions, Yang and Hwang's QKD protocols can resist each kind of the collective noise-collective-dephasing noise, collective-rotation noise. However, their proposed coding function can be improved by the utilization of three-particle GHZ state (three-particle GHZ-like state) instead of four-particle GHZ state (four-particle GHZ-like state) that will eventually reduce the consumption of the qubits. As a result, this study proposed the improved version of Yang and Hwang's coding functions to enhance the qubit efficiency of their schemes from 20 % to 22 %.
Zhang Shengli; Zou Xubo; Li Ke; Guo Guangcan; Jin Chenhui
2007-10-15
For the Bennett-Brassard 1984 (BB84) quantum key distribution, longer distance and higher key generating rate is shown with a heralded single-photon source (HSPS) [Phys. Rev. A. 73, 032331 (2006)]. In this paper, the performance of the Scarani-Acin-Ribordy-Gisim (SARG) protocol utilizing the HSPS sources is considered and the numerical simulation turns out that still a significant improvement in secret key generating rate can also be observed. It is shown that the security distance for HSPS+SARG is 120 km. However, compared with the HSPS+BB84 protocols, the HSPS+SARG protocol has a lower secret key rate and a shorter distance. Thus we show the HSPS+BB84 implementation is a preferable protocol for long distance transmittance.
Nikolopoulos, Georgios M.; Ranade, Kedar S.; Alber, Gernot
2006-03-15
We investigate the error tolerance of quantum cryptographic protocols using d-level systems. In particular, we focus on prepare-and-measure schemes that use two mutually unbiased bases and a key-distillation procedure with two-way classical communication. For arbitrary quantum channels, we obtain a sufficient condition for secret-key distillation which, in the case of isotropic quantum channels, yields an analytic expression for the maximally tolerable error rate of the cryptographic protocols under consideration. The difference between the tolerable error rate and its theoretical upper bound tends slowly to zero for sufficiently large dimensions of the information carriers.
On quantum key distribution using ququarts
Kulik, S. P. Shurupov, A. P.
2007-05-15
A comparative analysis of quantum key distribution protocols using qubits and ququarts as information carriers is presented. Several schemes of incoherent attacks that can be used by an eavesdropper to obtain secret information are considered. The errors induced by the eavesdropper are analyzed for several key distribution protocols.
Protocols for distributive scheduling
NASA Technical Reports Server (NTRS)
Richards, Stephen F.; Fox, Barry
1993-01-01
The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of space shuttle mission planning.
Numerical approach for unstructured quantum key distribution
Coles, Patrick J.; Metodiev, Eric M.; Lütkenhaus, Norbert
2016-01-01
Quantum key distribution (QKD) allows for communication with security guaranteed by quantum theory. The main theoretical problem in QKD is to calculate the secret key rate for a given protocol. Analytical formulas are known for protocols with symmetries, since symmetry simplifies the analysis. However, experimental imperfections break symmetries, hence the effect of imperfections on key rates is difficult to estimate. Furthermore, it is an interesting question whether (intentionally) asymmetric protocols could outperform symmetric ones. Here we develop a robust numerical approach for calculating the key rate for arbitrary discrete-variable QKD protocols. Ultimately this will allow researchers to study ‘unstructured' protocols, that is, those that lack symmetry. Our approach relies on transforming the key rate calculation to the dual optimization problem, which markedly reduces the number of parameters and hence the calculation time. We illustrate our method by investigating some unstructured protocols for which the key rate was previously unknown. PMID:27198739
Numerical approach for unstructured quantum key distribution.
Coles, Patrick J; Metodiev, Eric M; Lütkenhaus, Norbert
2016-01-01
Quantum key distribution (QKD) allows for communication with security guaranteed by quantum theory. The main theoretical problem in QKD is to calculate the secret key rate for a given protocol. Analytical formulas are known for protocols with symmetries, since symmetry simplifies the analysis. However, experimental imperfections break symmetries, hence the effect of imperfections on key rates is difficult to estimate. Furthermore, it is an interesting question whether (intentionally) asymmetric protocols could outperform symmetric ones. Here we develop a robust numerical approach for calculating the key rate for arbitrary discrete-variable QKD protocols. Ultimately this will allow researchers to study 'unstructured' protocols, that is, those that lack symmetry. Our approach relies on transforming the key rate calculation to the dual optimization problem, which markedly reduces the number of parameters and hence the calculation time. We illustrate our method by investigating some unstructured protocols for which the key rate was previously unknown. PMID:27198739
Numerical approach for unstructured quantum key distribution
NASA Astrophysics Data System (ADS)
Coles, Patrick J.; Metodiev, Eric M.; Lütkenhaus, Norbert
2016-05-01
Quantum key distribution (QKD) allows for communication with security guaranteed by quantum theory. The main theoretical problem in QKD is to calculate the secret key rate for a given protocol. Analytical formulas are known for protocols with symmetries, since symmetry simplifies the analysis. However, experimental imperfections break symmetries, hence the effect of imperfections on key rates is difficult to estimate. Furthermore, it is an interesting question whether (intentionally) asymmetric protocols could outperform symmetric ones. Here we develop a robust numerical approach for calculating the key rate for arbitrary discrete-variable QKD protocols. Ultimately this will allow researchers to study `unstructured' protocols, that is, those that lack symmetry. Our approach relies on transforming the key rate calculation to the dual optimization problem, which markedly reduces the number of parameters and hence the calculation time. We illustrate our method by investigating some unstructured protocols for which the key rate was previously unknown.
A novel protocol for multiparty quantum key management
NASA Astrophysics Data System (ADS)
Xu, Gang; Chen, Xiu-Bo; Dou, Zhao; Yang, Yi-Xian; Li, Zongpeng
2015-08-01
Key management plays a fundamental role in the field of cryptography. In this paper, we propose a novel multiparty quantum key management (QKM) protocol. Departing from single-function quantum cryptography protocols, our protocol has a salient feature in that it accomplishes a complete QKM process. In this process, we can simultaneously realize the functions of key generation, key distribution and key backup by executing the protocol once. Meanwhile, for the first time, we propose the idea of multi-function QKM. Firstly, the secret key is randomly generated by managers via the quantum measurements in -level Bell basis. Then, through entanglement swapping, the secret key is successfully distributed to users. Under circumstances of urgent requirement, all managers can cooperate to recover the users' secret key, but neither of them can recover it unilaterally. Furthermore, this protocol is further generalized into the multi-manager and multi-user QKM scenario. It has clear advantages in the burgeoning area of quantum security group communication. In this system, all group members share the same group key, and group key management is the foundation of secure group communication and hence an important subject of study.
Two-layer quantum key distribution
NASA Astrophysics Data System (ADS)
Pinheiro, Paulo Vinícius Pereira; Ramos, Rubens Viana
2015-06-01
Recently a new quantum key distribution protocol using coherent and thermal states was proposed. In this work, this kind of two-layer QKD protocol is formalized and its security against the most common attacks, including external control and Trojan horse attacks, is discussed.
Unidimensional continuous-variable quantum key distribution
NASA Astrophysics Data System (ADS)
Usenko, Vladyslav C.; Grosshans, Frédéric
2015-12-01
We propose the continuous-variable quantum key distribution protocol based on the Gaussian modulation of a single quadrature of the coherent states of light, which is aimed to provide simplified implementation compared to the symmetrically modulated Gaussian coherent-state protocols. The protocol waives the necessity in one of the quadrature modulations and the corresponding channel transmittance estimation. The security of the protocol against collective attacks in a generally phase-sensitive Gaussian channel is analyzed and is shown achievable upon certain conditions. Robustness of the protocol to channel imperfections is compared to that of the symmetrical coherent-state protocol. The simplified unidimensional protocol is shown possible at a reasonable quantitative cost in terms of key rate and of tolerable channel excess noise.
Finite key analysis for symmetric attacks in quantum key distribution
Meyer, Tim; Kampermann, Hermann; Kleinmann, Matthias; Bruss, Dagmar
2006-10-15
We introduce a constructive method to calculate the achievable secret key rate for a generic class of quantum key distribution protocols, when only a finite number n of signals is given. Our approach is applicable to all scenarios in which the quantum state shared by Alice and Bob is known. In particular, we consider the six state protocol with symmetric eavesdropping attacks, and show that for a small number of signals, i.e., below n{approx}10{sup 4}, the finite key rate differs significantly from the asymptotic value for n{yields}{infinity}. However, for larger n, a good approximation of the asymptotic value is found. We also study secret key rates for protocols using higher-dimensional quantum systems.
Security of Quantum Key Distribution
NASA Astrophysics Data System (ADS)
Lütkenhaus, Norbert
2007-03-01
Quantum Key Distribution (QKD) is the most advanced application of Quantum Information Science. It allows extending secret keys over some distances in such a way that the security of the resulting key material can be guaranteed by the laws of quantum mechanics. In contrast to presently used encryption techniques, the security of QKD can be proven in terms of information-theoretic measures. The resulting key can then be used for many tasks, including exchanging secret messages. QKD has been developed in the language of abstract two-level systems, the qubits. They cannot be easily implemented in optical signals. It took some time to bring the protocols and theory of QKD to the point where they fit to the realities of fiber-optical or free-space applications, including lossy channels. Today, QKD schemes can be implemented reliably using standard off-the-shelf components. Information theoretic security is a theoretical concept. Naturally, it is impossible to demonstrate directly that a given experimental set-up indeed creates a secret key. What one can do is to show that the experiment can give data within a certain parameters regime, such as error rate and loss rate, for which a security proof exists. I will discuss what parameter regime gives provable secure key and which parameter regime cannot lead to secret key. It is desirable to prove `unconditional security,' as it is termed in the world of classical cryptography: no assumption is made about the attacks of an eavesdropper on the quantum channel. However, one has to assume that the signal structure and the measurement device are correctly described by the adopted model and that no eavesdropper can intrude the sender or receiver unit. In this talk I will briefly introduce the concept of QKD and optical implementations. Especially I will discuss security aspects of modern approaches of QKD schemes that allow us to increase the covered distance and the achievable rate.
Counterfactual attack on counterfactual quantum key distribution
NASA Astrophysics Data System (ADS)
Zhang, Sheng; Wnang, Jian; Tang, Chao Jing
2012-05-01
It is interesting that counterfactual quantum cryptography protocols allow two remotely separated parties to share a secret key without transmitting any signal particles. Generally, these protocols, expected to provide security advantages, base their security on a translated no-cloning theorem. Therefore, they potentially exhibit unconditional security in theory. In this letter, we propose a new Trojan horse attack, by which an eavesdropper Eve can gain full information about the key without being noticed, to real implementations of a counterfactual quantum cryptography system. Most importantly, the presented attack is available even if the system has negligible imperfections. Therefore, it shows that the present realization of counterfactual quantum key distribution is vulnerable.
Reference-frame-independent quantum key distribution
Laing, Anthony; Rarity, John G.; O'Brien, Jeremy L.; Scarani, Valerio
2010-07-15
We describe a quantum key distribution protocol based on pairs of entangled qubits that generates a secure key between two partners in an environment of unknown and slowly varying reference frame. A direction of particle delivery is required, but the phases between the computational basis states need not be known or fixed. The protocol can simplify the operation of existing setups and has immediate applications to emerging scenarios such as earth-to-satellite links and the use of integrated photonic waveguides. We compute the asymptotic secret key rate for a two-qubit source, which coincides with the rate of the six-state protocol for white noise. We give the generalization of the protocol to higher-dimensional systems and detail a scheme for physical implementation in the three-dimensional qutrit case.
Finite-key security analysis for multilevel quantum key distribution
NASA Astrophysics Data System (ADS)
Brádler, Kamil; Mirhosseini, Mohammad; Fickler, Robert; Broadbent, Anne; Boyd, Robert
2016-07-01
We present a detailed security analysis of a d-dimensional quantum key distribution protocol based on two and three mutually unbiased bases (MUBs) both in an asymptotic and finite-key-length scenario. The finite secret key rates (in bits per detected photon) are calculated as a function of the length of the sifted key by (i) generalizing the uncertainly relation-based insight from BB84 to any d-level 2-MUB QKD protocol and (ii) by adopting recent advances in the second-order asymptotics for finite block length quantum coding (for both d-level 2- and 3-MUB QKD protocols). Since the finite and asymptotic secret key rates increase with d and the number of MUBs (together with the tolerable threshold) such QKD schemes could in principle offer an important advantage over BB84. We discuss the possibility of an experimental realization of the 3-MUB QKD protocol with the orbital angular momentum degrees of freedom of photons.
Distributed simulation of network protocols
NASA Technical Reports Server (NTRS)
Paterra, Frank; Overstreet, C. Michael; Maly, Kurt J.
1990-01-01
Simulations of high speed network protocols are very CPU intensive operations requiring very long run times. Very high speed network protocols (Gigabit/sec rates) require longer simulation runs in order to reach a steady state, while at the same time requiring additional CPU processing for each unit of time because of the data rates for the traffic being simulated. As protocol development proceeds and simulations provide insights into any problems associated with the protocol, the simulation model often must be changed to generate additional or finer statistical performance information. Iterating on this process is very time consuming due to the required run times for the simulation models. The results of the efforts to distribute a high speed ring network protocol, Carrier Sensed Multiple Access/Ring Network (CSMA/RN), are presented.
One Step Quantum Key Distribution Based on EPR Entanglement
Li, Jian; Li, Na; Li, Lei-Lei; Wang, Tao
2016-01-01
A novel quantum key distribution protocol is presented, based on entanglement and dense coding and allowing asymptotically secure key distribution. Considering the storage time limit of quantum bits, a grouping quantum key distribution protocol is proposed, which overcomes the vulnerability of first protocol and improves the maneuverability. Moreover, a security analysis is given and a simple type of eavesdropper’s attack would introduce at least an error rate of 46.875%. Compared with the “Ping-pong” protocol involving two steps, the proposed protocol does not need to store the qubit and only involves one step. PMID:27357865
One Step Quantum Key Distribution Based on EPR Entanglement.
Li, Jian; Li, Na; Li, Lei-Lei; Wang, Tao
2016-01-01
A novel quantum key distribution protocol is presented, based on entanglement and dense coding and allowing asymptotically secure key distribution. Considering the storage time limit of quantum bits, a grouping quantum key distribution protocol is proposed, which overcomes the vulnerability of first protocol and improves the maneuverability. Moreover, a security analysis is given and a simple type of eavesdropper's attack would introduce at least an error rate of 46.875%. Compared with the "Ping-pong" protocol involving two steps, the proposed protocol does not need to store the qubit and only involves one step. PMID:27357865
Quantum key distribution based on quantum dimension and independent devices
NASA Astrophysics Data System (ADS)
Li, Hong-Wei; Yin, Zhen-Qiang; Chen, Wei; Wang, Shuang; Guo, Guang-Can; Han, Zheng-Fu
2014-03-01
In this paper, we propose a quantum key distribution (QKD) protocol based on only a two-dimensional Hilbert space encoding a quantum system and independent devices between the equipment for state preparation and measurement. Our protocol is inspired by the fully device-independent quantum key distribution (FDI-QKD) protocol and the measurement-device-independent quantum key distribution (MDI-QKD) protocol. Our protocol only requires the state to be prepared in the two-dimensional Hilbert space, which weakens the state preparation assumption in the original MDI-QKD protocol. More interestingly, our protocol can overcome the detection loophole problem in the FDI-QKD protocol, which greatly limits the application of FDI-QKD. Hence our protocol can be implemented with practical optical components.
General quantum key distribution in higher dimension
NASA Astrophysics Data System (ADS)
Xiong, Zhao-Xi; Shi, Han-Duo; Wang, Yi-Nan; Jing, Li; Lei, Jin; Mu, Liang-Zhu; Fan, Heng
2012-01-01
We study a general quantum key distribution protocol in higher dimension. In this protocol, quantum states in arbitrary g+1 (1≤g≤d) out of all d+1 mutually unbiased bases in a d-dimensional system can be used for the key encoding. This provides a natural generalization of the quantum key distribution in higher dimension and recovers the previously known results for g=1 and d. In our investigation, we study Eve's attack by two slightly different approaches. One is considering the optimal cloner of Eve, and the other, defined as the optimal attack, is maximizing Eve's information. We derive results for both approaches and show the deviation of the optimal cloner from the optimal attack. With our systematic investigation of the quantum key distribution protocols in higher dimension, one may balance the security gain and the implementation cost by changing the number of bases in the key encoding. As a side product, we also prove the equivalency between the optimal phase covariant quantum cloning machine and the optimal cloner for the g=d-1 quantum key distribution.
A secure key agreement protocol based on chaotic maps
NASA Astrophysics Data System (ADS)
Wang, Xing-Yuan; Luan, Da-Peng
2013-11-01
To guarantee the security of communication in the public channel, many key agreement protocols have been proposed. Recently, Gong et al. proposed a key agreement protocol based on chaotic maps with password sharing. In this paper, Gong et al.'s protocol is analyzed, and we find that this protocol exhibits key management issues and potential security problems. Furthermore, the paper presents a new key agreement protocol based on enhanced Chebyshev polynomials to overcome these problems. Through our analysis, our key agreement protocol not only provides mutual authentication and the ability to resist a variety of common attacks, but also solve the problems of key management and security issues existing in Gong et al.'s protocol.
Secret key generation via a modified quantum secret sharing protocol
NASA Astrophysics Data System (ADS)
Smith, A. M.; Evans, P. G.; Lawrie, B.; Legré, M.; Lougovski, P.; Ray, W.; Williams, B. P.; Qi, B.; Grice, W. P.
2015-05-01
We present and experimentally show a novel protocol for distributing secret information between two and only two parties in a N-party single-qubit Quantum Secret Sharing (QSS) system. We demonstrate this new algorithm with N = 3 active parties over ~6km of telecom. fiber. Our experimental device is based on the Clavis2 Quantum Key Distribution (QKD) system built by ID Quantique but is generalizable to any implementation. We show that any two out of the N parties can build secret keys based on partial information from each other and with collaboration from the remaining N - 2 parties. This algorithm allows for the creation of two-party secret keys were standard QSS does not and significantly reduces the number of resources needed to implement QKD on a highly connected network such as the electrical grid.
Secret Key Generation via a Modified Quantum Secret Sharing Protocol
Smith IV, Amos M; Evans, Philip G; Lawrie, Benjamin J; Legre, Matthieu; Lougovski, Pavel; Ray, William R; Williams, Brian P; Qi, Bing; Grice, Warren P
2015-01-01
We present and experimentally show a novel protocol for distributing secret information between two and only two parties in a N-party single-qubit Quantum Secret Sharing (QSS) system. We demonstrate this new algorithm with N = 3 active parties over 6km of telecom. ber. Our experimental device is based on the Clavis2 Quantum Key Distribution (QKD) system built by ID Quantique but is generalizable to any implementation. We show that any two out of the N parties can build secret keys based on partial information from each other and with collaboration from the remaining N > 2 parties. This algorithm allows for the creation of two-party secret keys were standard QSS does not and signicantly reduces the number of resources needed to implement QKD on a highly connected network such as the electrical grid.
Calculation of key reduction for B92 QKD protocol
NASA Astrophysics Data System (ADS)
Mehic, Miralem; Partila, Pavol; Tovarek, Jaromir; Voznak, Miroslav
2015-05-01
It is well known that Quantum Key Distribution (QKD) can be used with the highest level of security for distribution of the secret key, which is further used for symmetrical encryption. B92 is one of the oldest QKD protocols. It uses only two non-orthogonal states, each one coding for one bit-value. It is much faster and simpler when compared to its predecessors, but with the idealized maximum efficiencies of 25% over the quantum channel. B92 consists of several phases in which initial key is significantly reduced: secret key exchange, extraction of the raw key (sifting), error rate estimation, key reconciliation and privacy amplification. QKD communication is performed over two channels: the quantum channel and the classical public channel. In order to prevent a man-in-the-middle attack and modification of messages on the public channel, authentication of exchanged values must be performed. We used Wegman-Carter authentication because it describes an upper bound for needed symmetric authentication key. We explained the reduction of the initial key in each of QKD phases.
Secure key storage and distribution
Agrawal, Punit
2015-06-02
This disclosure describes a distributed, fault-tolerant security system that enables the secure storage and distribution of private keys. In one implementation, the security system includes a plurality of computing resources that independently store private keys provided by publishers and encrypted using a single security system public key. To protect against malicious activity, the security system private key necessary to decrypt the publication private keys is not stored at any of the computing resources. Rather portions, or shares of the security system private key are stored at each of the computing resources within the security system and multiple security systems must communicate and share partial decryptions in order to decrypt the stored private key.
Semiquantum-key distribution using less than four quantum states
Zou Xiangfu; Qiu Daowen; Li Lvzhou; Wu Lihua; Li Lvjun
2009-05-15
Recently Boyer et al. [Phys. Rev. Lett. 99, 140501 (2007)] suggested the idea of semiquantum key distribution (SQKD) in which Bob is classical and they also proposed a semiquantum key distribution protocol (BKM2007). To discuss the security of the BKM2007 protocol, they proved that their protocol is completely robust. This means that nonzero information acquired by Eve on the information string implies the nonzero probability that the legitimate participants can find errors on the bits tested by this protocol. The BKM2007 protocol uses four quantum states to distribute a secret key. In this paper, we simplify their protocol by using less than four quantum states. In detail, we present five different SQKD protocols in which Alice sends three quantum states, two quantum states, and one quantum state, respectively. Also, we prove that all the five protocols are completely robust. In particular, we invent two completely robust SQKD protocols in which Alice sends only one quantum state. Alice uses a register in one SQKD protocol, but she does not use any register in the other. The information bit proportion of the SQKD protocol in which Alice sends only one quantum state but uses a register is the double as that in the BKM2007 protocol. Furthermore, the information bit rate of the SQKD protocol in which Alice sends only one quantum state and does not use any register is not lower than that of the BKM2007 protocol.
A protocol for quantum energy distribution
NASA Astrophysics Data System (ADS)
Hotta, Masahiro
2008-08-01
In this Letter, a protocol called quantum energy distribution (QED) is proposed in which multi-parties can simultaneously extract positive energy on average from spin chains by use of common secret keys shared by an energy supplier. QED is robust against impersonation. An adversary, who does not have common secret keys and attempts to get energy, cannot obtain but give energy to spin chains. Total amount of energy transfer gives a lower bound of residual energy of a local cooling process by the energy supplier.
Entangled free-space quantum key distribution
NASA Astrophysics Data System (ADS)
Weihs, Gregor; Erven, Christopher
2007-09-01
We have constructed an entanglement based quantum key distribution system that links three buildings, covering a largest distance of 1575 m. The photons are transmitted via telescopes through free space. In this paper, we give a detailed description of our system and the protocol that we implemented. We analyze system components and design considerations. Some preliminary results of a one-link experiment are presented.
A Biometric Authenticated Key Agreement Protocol for Secure Token
NASA Astrophysics Data System (ADS)
Yoon, Eun-Jun; Yoo, Kee-Young
This letter proposes a robust biometric authenticated key agreement (BAKA) protocol for a secure token to provide strong security and minimize the computation cost of each participant. Compared with other related protocols, the proposed BAKA protocol not only is secure against well-known cryptographical attacks but also provides various functionality and performance requirements.
All-photonic intercity quantum key distribution
NASA Astrophysics Data System (ADS)
Azuma, Koji; Tamaki, Kiyoshi; Munro, William J.
2015-12-01
Recent field demonstrations of quantum key distribution (QKD) networks hold promise for unconditionally secure communication. However, owing to loss in optical fibres, the length of point-to-point links is limited to a hundred kilometers, restricting the QKD networks to intracity. A natural way to expand the QKD network in a secure manner is to connect it to another one in a different city with quantum repeaters. But, this solution is overengineered unless such a backbone connection is intercontinental. Here we present a QKD protocol that could supersede even quantum repeaters for connecting QKD networks in different cities below 800 km distant. Nonetheless, in contrast to quantum repeaters, this protocol uses only a single intermediate node with optical devices, requiring neither quantum memories nor quantum error correction. Our all-photonic `intercity' QKD protocol bridges large gaps between the conventional intracity QKD networks and the future intercontinental quantum repeaters, conceptually and technologically.
All-photonic intercity quantum key distribution
Azuma, Koji; Tamaki, Kiyoshi; Munro, William J.
2015-01-01
Recent field demonstrations of quantum key distribution (QKD) networks hold promise for unconditionally secure communication. However, owing to loss in optical fibres, the length of point-to-point links is limited to a hundred kilometers, restricting the QKD networks to intracity. A natural way to expand the QKD network in a secure manner is to connect it to another one in a different city with quantum repeaters. But, this solution is overengineered unless such a backbone connection is intercontinental. Here we present a QKD protocol that could supersede even quantum repeaters for connecting QKD networks in different cities below 800 km distant. Nonetheless, in contrast to quantum repeaters, this protocol uses only a single intermediate node with optical devices, requiring neither quantum memories nor quantum error correction. Our all-photonic ‘intercity' QKD protocol bridges large gaps between the conventional intracity QKD networks and the future intercontinental quantum repeaters, conceptually and technologically. PMID:26671044
Authenticated semi-quantum key distributions without classical channel
NASA Astrophysics Data System (ADS)
Li, Chuan-Ming; Yu, Kun-Fei; Kao, Shih-Hung; Hwang, Tzonelih
2016-04-01
Yu et al. have proposed the first authenticated semi-quantum key distribution (ASQKD) without using an authenticated classical channel. This study further proposes two advanced ASQKD protocols. Compared to Yu et al.'s schemes, the proposed protocols ensure better qubit efficiency and require fewer pre-shared keys. Security analyses show that the proposed ASQKD protocols also can be secure against several well-known outside eavesdropper's attacks.
Authenticated semi-quantum key distributions without classical channel
NASA Astrophysics Data System (ADS)
Li, Chuan-Ming; Yu, Kun-Fei; Kao, Shih-Hung; Hwang, Tzonelih
2016-07-01
Yu et al. have proposed the first authenticated semi-quantum key distribution (ASQKD) without using an authenticated classical channel. This study further proposes two advanced ASQKD protocols. Compared to Yu et al.'s schemes, the proposed protocols ensure better qubit efficiency and require fewer pre-shared keys. Security analyses show that the proposed ASQKD protocols also can be secure against several well-known outside eavesdropper's attacks.
A Public-Key Based Authentication and Key Establishment Protocol Coupled with a Client Puzzle.
ERIC Educational Resources Information Center
Lee, M. C.; Fung, Chun-Kan
2003-01-01
Discusses network denial-of-service attacks which have become a security threat to the Internet community and suggests the need for reliable authentication protocols in client-server applications. Presents a public-key based authentication and key establishment protocol coupled with a client puzzle protocol and validates it through formal logic…
Detector-decoy quantum key distribution without monitoring signal disturbance
NASA Astrophysics Data System (ADS)
Yin, Hua-Lei; Fu, Yao; Mao, Yingqiu; Chen, Zeng-Bing
2016-02-01
The round-robin differential phase-shift quantum key distribution protocol provides a secure way to exchange private information without monitoring conventional disturbances and still maintains a high tolerance of noise, making it desirable for practical implementations of quantum key distribution. However, photon number resolving detectors are required to ensure that the detected signals are single photons in the original protocol. Here, we adopt the detector-decoy method and give the bounds to the fraction of detected events from single photons. Utilizing the advantages of the protocol, we provide a practical method of performing the protocol with desirable performances requiring only threshold single-photon detectors.
A complete classification of quantum public-key encryption protocols
NASA Astrophysics Data System (ADS)
Wu, Chenmiao; Yang, Li
2015-10-01
We present a classification of quantum public-key encryption protocols. There are six elements in quantum public-key encryption: plaintext, ciphertext, public-key, private-key, encryption algorithm and decryption algorithm. According to the property of each element which is either quantum or classical, the quantum public-key encryption protocols can be divided into 64 kinds. Among 64 kinds of protocols, 8 kinds have already been constructed, 52 kinds can be proved to be impossible to construct and the remaining 4 kinds have not been presented effectively yet. This indicates that the research on quantum public-key encryption protocol should be focus on the existed kinds and the unproposed kinds.
Fully device-independent quantum key distribution.
Vazirani, Umesh; Vidick, Thomas
2014-10-01
Quantum cryptography promises levels of security that are impossible to replicate in a classical world. Can this security be guaranteed even when the quantum devices on which the protocol relies are untrusted? This central question dates back to the early 1990s when the challenge of achieving device-independent quantum key distribution was first formulated. We answer this challenge by rigorously proving the device-independent security of a slight variant of Ekert's original entanglement-based protocol against the most general (coherent) attacks. The resulting protocol is robust: While assuming only that the devices can be modeled by the laws of quantum mechanics and are spatially isolated from each other and from any adversary's laboratory, it achieves a linear key rate and tolerates a constant noise rate in the devices. In particular, the devices may have quantum memory and share arbitrary quantum correlations with the eavesdropper. The proof of security is based on a new quantitative understanding of the monogamous nature of quantum correlations in the context of a multiparty protocol. PMID:25325625
Quantum key distribution with finite resources: Secret key rates via Renyi entropies
Abruzzo, Silvestre; Kampermann, Hermann; Mertz, Markus; Bruss, Dagmar
2011-09-15
A realistic quantum key distribution (QKD) protocol necessarily deals with finite resources, such as the number of signals exchanged by the two parties. We derive a bound on the secret key rate which is expressed as an optimization problem over Renyi entropies. Under the assumption of collective attacks by an eavesdropper, a computable estimate of our bound for the six-state protocol is provided. This bound leads to improved key rates in comparison to previous results.
Trojan horse attacks on counterfactual quantum key distribution
NASA Astrophysics Data System (ADS)
Yang, Xiuqing; Wei, Kejin; Ma, Haiqiang; Sun, Shihai; Du, Yungang; Wu, Lingan
2016-04-01
There has been much interest in "counterfactual quantum cryptography" (T.-G. Noh, 2009 [10]). It seems that the counterfactual quantum key distribution protocol without any photon carrier through the quantum channel provides practical security advantages. However, we show that it is easy to break counterfactual quantum key distribution systems in practical situations. We introduce the two types of Trojan horse attacks that are available for the two-way protocol and become possible for practical counterfactual systems with our eavesdropping schemes.
Device-independent quantum key distribution
NASA Astrophysics Data System (ADS)
Hänggi, Esther
2010-12-01
In this thesis, we study two approaches to achieve device-independent quantum key distribution: in the first approach, the adversary can distribute any system to the honest parties that cannot be used to communicate between the three of them, i.e., it must be non-signalling. In the second approach, we limit the adversary to strategies which can be implemented using quantum physics. For both approaches, we show how device-independent quantum key distribution can be achieved when imposing an additional condition. In the non-signalling case this additional requirement is that communication is impossible between all pairwise subsystems of the honest parties, while, in the quantum case, we demand that measurements on different subsystems must commute. We give a generic security proof for device-independent quantum key distribution in these cases and apply it to an existing quantum key distribution protocol, thus proving its security even in this setting. We also show that, without any additional such restriction there always exists a successful joint attack by a non-signalling adversary.
On the Security of a Simple Three-Party Key Exchange Protocol without Server's Public Keys
Nam, Junghyun; Choo, Kim-Kwang Raymond; Park, Minkyu; Paik, Juryon; Won, Dongho
2014-01-01
Authenticated key exchange protocols are of fundamental importance in securing communications and are now extensively deployed for use in various real-world network applications. In this work, we reveal major previously unpublished security vulnerabilities in the password-based authenticated three-party key exchange protocol according to Lee and Hwang (2010): (1) the Lee-Hwang protocol is susceptible to a man-in-the-middle attack and thus fails to achieve implicit key authentication; (2) the protocol cannot protect clients' passwords against an offline dictionary attack; and (3) the indistinguishability-based security of the protocol can be easily broken even in the presence of a passive adversary. We also propose an improved password-based authenticated three-party key exchange protocol that addresses the security vulnerabilities identified in the Lee-Hwang protocol. PMID:25258723
On the security of a simple three-party key exchange protocol without server's public keys.
Nam, Junghyun; Choo, Kim-Kwang Raymond; Park, Minkyu; Paik, Juryon; Won, Dongho
2014-01-01
Authenticated key exchange protocols are of fundamental importance in securing communications and are now extensively deployed for use in various real-world network applications. In this work, we reveal major previously unpublished security vulnerabilities in the password-based authenticated three-party key exchange protocol according to Lee and Hwang (2010): (1) the Lee-Hwang protocol is susceptible to a man-in-the-middle attack and thus fails to achieve implicit key authentication; (2) the protocol cannot protect clients' passwords against an offline dictionary attack; and (3) the indistinguishability-based security of the protocol can be easily broken even in the presence of a passive adversary. We also propose an improved password-based authenticated three-party key exchange protocol that addresses the security vulnerabilities identified in the Lee-Hwang protocol. PMID:25258723
Security proof for quantum key distribution using qudit systems
Sheridan, Lana; Scarani, Valerio
2010-09-15
We provide security bounds against coherent attacks for two families of quantum key distribution protocols that use d-dimensional quantum systems. In the asymptotic regime, both the secret key rate for fixed noise and the robustness to noise increase with d. The finite key corrections are found to be almost insensitive to d < or approx. 20.
Secure quantum key distribution using squeezed states
Gottesman, Daniel; Preskill, John
2001-02-01
We prove the security of a quantum key distribution scheme based on transmission of squeezed quantum states of a harmonic oscillator. Our proof employs quantum error-correcting codes that encode a finite-dimensional quantum system in the infinite-dimensional Hilbert space of an oscillator, and protect against errors that shift the canonical variables p and q. If the noise in the quantum channel is weak, squeezing signal states by 2.51 dB (a squeeze factor e{sup r}=1.34) is sufficient in principle to ensure the security of a protocol that is suitably enhanced by classical error correction and privacy amplification. Secure key distribution can be achieved over distances comparable to the attenuation length of the quantum channel.
Efficient multiparty quantum key agreement protocol based on commutative encryption
NASA Astrophysics Data System (ADS)
Sun, Zhiwei; Huang, Jiwu; Wang, Ping
2016-05-01
A secure multiparty quantum key agreement protocol using single-qubit states is proposed. The agreement key is computed by performing exclusive-OR operation on all the participants' secret keys. Based on the commutative property of the commutative encryption, the exclusive-OR operation can be performed on the plaintext in the encrypted state without decrypting it. Thus, it not only protects the final shared key, but also reduces the complexity of the computation. The efficiency of the proposed protocol, compared with previous multiparty QKA protocols, is also improved. In the presented protocol, entanglement states, joint measurement and even the unitary operations are not needed, and only rotation operations and single-state measurement are required, which are easier to be realized with current technology.
Quantum key distribution with a reference quantum state
Molotkov, S. N.
2011-11-15
A new quantum key distribution protocol stable at arbitrary losses in a quantum communication channel has been proposed. For the stability of the protocol, it is of fundamental importance that changes in states associated with losses in the communication channel (in the absence of the eavesdropper) are included in measurements.
Quantum key distribution with entangled photon sources
NASA Astrophysics Data System (ADS)
Ma, Xiongfeng; Fung, Chi-Hang Fred; Lo, Hoi-Kwong
2007-07-01
A parametric down-conversion (PDC) source can be used as either a triggered single-photon source or an entangled-photon source in quantum key distribution (QKD). The triggering PDC QKD has already been studied in the literature. On the other hand, a model and a post-processing protocol for the entanglement PDC QKD are still missing. We fill in this important gap by proposing such a model and a post-processing protocol for the entanglement PDC QKD. Although the PDC model is proposed to study the entanglement-based QKD, we emphasize that our generic model may also be useful for other non-QKD experiments involving a PDC source. Since an entangled PDC source is a basis-independent source, we apply Koashi and Preskill’s security analysis to the entanglement PDC QKD. We also investigate the entanglement PDC QKD with two-way classical communications. We find that the recurrence scheme increases the key rate and the Gottesman-Lo protocol helps tolerate higher channel losses. By simulating a recent 144-km open-air PDC experiment, we compare three implementations: entanglement PDC QKD, triggering PDC QKD, and coherent-state QKD. The simulation result suggests that the entanglement PDC QKD can tolerate higher channel losses than the coherent-state QKD. The coherent-state QKD with decoy states is able to achieve highest key rate in the low- and medium-loss regions. By applying the Gottesman-Lo two-way post-processing protocol, the entanglement PDC QKD can tolerate up to 70dB combined channel losses ( 35dB for each channel) provided that the PDC source is placed in between Alice and Bob. After considering statistical fluctuations, the PDC setup can tolerate up to 53dB channel losses.
A Secure Authenticated Key Exchange Protocol for Credential Services
NASA Astrophysics Data System (ADS)
Shin, Seonghan; Kobara, Kazukuni; Imai, Hideki
In this paper, we propose a leakage-resilient and proactive authenticated key exchange (called LRP-AKE) protocol for credential services which provides not only a higher level of security against leakage of stored secrets but also secrecy of private key with respect to the involving server. And we show that the LRP-AKE protocol is provably secure in the random oracle model with the reduction to the computational Difie-Hellman problem. In addition, we discuss about some possible applications of the LRP-AKE protocol.
NASA Astrophysics Data System (ADS)
Jiang, Haodong; Gao, Ming; Yan, Bao; Wang, Weilong; Ma, Zhi
2016-04-01
We propose an efficient four-intensity decoy-state BB84 protocol and derive concise security bounds for this protocol with the universally composable finite-key analysis method. Comparing with the efficient three-intensity protocol, we find that our efficient four-intensity protocol can increase the secret key rate by at least 30%. Particularly, this increasing rate of secret key rate will be raised as the transmission distance increases. At a large transmission distance, our efficient four-intensity protocol can improve the performance of quantum key distribution profoundly.
Authenticated Quantum Key Distribution with Collective Detection using Single Photons
NASA Astrophysics Data System (ADS)
Huang, Wei; Xu, Bing-Jie; Duan, Ji-Tong; Liu, Bin; Su, Qi; He, Yuan-Hang; Jia, Heng-Yue
2016-05-01
We present two authenticated quantum key distribution (AQKD) protocols by utilizing the idea of collective (eavesdropping) detection. One is a two-party AQKD protocol, the other is a multiparty AQKD protocol with star network topology. In these protocols, the classical channels need not be assumed to be authenticated and the single photons are used as the quantum information carriers. To achieve mutual identity authentication and establish a random key in each of the proposed protocols, only one participant should be capable of preparing and measuring single photons, and the main quantum ability that the rest of the participants should have is just performing certain unitary operations. Security analysis shows that these protocols are free from various kinds of attacks, especially the impersonation attack and the man-in-the-middle (MITM) attack.
Authenticated multi-user quantum key distribution with single particles
NASA Astrophysics Data System (ADS)
Lin, Song; Wang, Hui; Guo, Gong-De; Ye, Guo-Hua; Du, Hong-Zhen; Liu, Xiao-Fen
2016-03-01
Quantum key distribution (QKD) has been growing rapidly in recent years and becomes one of the hottest issues in quantum information science. During the implementation of QKD on a network, identity authentication has been one main problem. In this paper, an efficient authenticated multi-user quantum key distribution (MQKD) protocol with single particles is proposed. In this protocol, any two users on a quantum network can perform mutual authentication and share a secure session key with the assistance of a semi-honest center. Meanwhile, the particles, which are used as quantum information carriers, are not required to be stored, therefore the proposed protocol is feasible with current technology. Finally, security analysis shows that this protocol is secure in theory.
Completely device-independent quantum key distribution
NASA Astrophysics Data System (ADS)
Aguilar, Edgar A.; Ramanathan, Ravishankar; Kofler, Johannes; Pawłowski, Marcin
2016-08-01
Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary assumptions that the parties have to make about their devices, giving rise to device-independent QKD (DIQKD). However, in all existing protocols to date the parties need to have an initial (at least partially) random seed as a resource. In this work, we show that this requirement can be dropped. Using recent advances in the fields of randomness amplification and randomness expansion, we demonstrate that it is sufficient for the message the parties want to communicate to be (partially) unknown to the adversaries—an assumption without which any type of cryptography would be pointless to begin with. One party can use her secret message to locally generate a secret sequence of bits, which can then be openly used by herself and the other party in a DIQKD protocol. Hence our work reduces the requirements needed to perform secure DIQKD and establish safe communication.
Enhanced Usage of Keys Obtained by Physical, Unconditionally Secure Distributions
NASA Astrophysics Data System (ADS)
Kish, Laszlo B.; Granqvist, Claes-Göran
2015-04-01
Unconditionally secure physical key distribution schemes are very slow, and it is practically impossible to use a one-time-pad based cipher to guarantee unconditional security for the encryption of data because using the key bits more than once gives out statistical information, for example via the known-plain-text-attack or by utilizing known components of the protocol and language statistics. Here, we outline a protocol that reduces this speed problem and allows almost-one-time-pad based communication with an unconditionally secure physical key of finite length. The physical, unconditionally secure key is not used for data encryption but is employed in order to generate and share a new software-based key without any known-plain-text component. The software-only-based key distribution is then changed from computationally secure to unconditionally secure, because the communicated key-exchange data (algorithm parameters, one-way functions of random numbers, etc.) are encrypted in an unconditionally secure way with a one-time-pad. For practical applications, this combined physical/software key distribution based communication looks favorable compared to the software-only and physical-only key distribution based communication whenever the speed of the physical key distribution is much lower than that of the software-based key distribution. A mathematical security proof of this new scheme remains an open problem.
Semiquantum key distribution with secure delegated quantum computation
NASA Astrophysics Data System (ADS)
Li, Qin; Chan, Wai Hong; Zhang, Shengyu
2016-01-01
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 experimentally feasible with current technology. As one party of our protocol is the most quantum-resource efficient, it can be more practical and significantly widen the applicability scope of quantum key distribution.
Semiquantum key distribution with secure delegated quantum computation.
Li, Qin; Chan, Wai Hong; Zhang, Shengyu
2016-01-01
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 experimentally feasible with current technology. As one party of our protocol is the most quantum-resource efficient, it can be more practical and significantly widen the applicability scope of quantum key distribution. PMID:26813384
Semiquantum key distribution with secure delegated quantum computation
Li, Qin; Chan, Wai Hong; Zhang, Shengyu
2016-01-01
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 experimentally feasible with current technology. As one party of our protocol is the most quantum-resource efficient, it can be more practical and significantly widen the applicability scope of quantum key distribution. PMID:26813384
Device-independent quantum key distribution based on measurement inputs
NASA Astrophysics Data System (ADS)
Rahaman, Ramij; Parker, Matthew G.; Mironowicz, Piotr; Pawłowski, Marcin
2015-12-01
We provide an analysis of a family of device-independent quantum key distribution (QKD) protocols that has the following features. (a) The bits used for the secret key do not come from the results of the measurements on an entangled state but from the choices of settings. (b) Instead of a single security parameter (a violation of some Bell inequality) a set of them is used to estimate the level of trust in the secrecy of the key. The main advantage of these protocols is a smaller vulnerability to imperfect random number generators made possible by feature (a). We prove the security and the robustness of such protocols. We show that using our method it is possible to construct a QKD protocol which retains its security even if the source of randomness used by communicating parties is strongly biased. As a proof of principle, an explicit example of a protocol based on the Hardy's paradox is presented. Moreover, in the noiseless case, the protocol is secure in a natural way against any type of memory attack, and thus allows one to reuse the device in subsequent rounds. We also analyze the robustness of the protocol using semidefinite programming methods. Finally, we present a postprocessing method, and observe a paradoxical property that rejecting some random part of the private data can increase the key rate of the protocol.
Finite-key analysis of a practical decoy-state high-dimensional quantum key distribution
NASA Astrophysics Data System (ADS)
Bao, Haize; Bao, Wansu; Wang, Yang; Zhou, Chun; Chen, Ruike
2016-05-01
Compared with two-level quantum key distribution (QKD), high-dimensional QKD enables two distant parties to share a secret key at a higher rate. We provide a finite-key security analysis for the recently proposed practical high-dimensional decoy-state QKD protocol based on time-energy entanglement. We employ two methods to estimate the statistical fluctuation of the postselection probability and give a tighter bound on the secure-key capacity. By numerical evaluation, we show the finite-key effect on the secure-key capacity in different conditions. Moreover, our approach could be used to optimize parameters in practical implementations of high-dimensional QKD.
One-way quantum key distribution: Simple upper bound on the secret key rate
Moroder, Tobias; Luetkenhaus, Norbert; Curty, Marcos
2006-11-15
We present a simple method to obtain an upper bound on the achievable secret key rate in quantum key distribution (QKD) protocols that use only unidirectional classical communication during the public-discussion phase. This method is based on a necessary precondition for one-way secret key distillation; the legitimate users need to prove that there exists no quantum state having a symmetric extension that is compatible with the available measurements results. The main advantage of the obtained upper bound is that it can be formulated as a semidefinite program, which can be efficiently solved. We illustrate our results by analyzing two well-known qubit-based QKD protocols: the four-state protocol and the six-state protocol.
Quantum key distribution: vulnerable if imperfectly implemented
NASA Astrophysics Data System (ADS)
Leuchs, G.
2013-10-01
We report several vulnerabilities found in Clavis2, the flagship quantum key distribution (QKD) system from ID Quantique. We show the hacking of a calibration sequence run by Clavis2 to synchronize the Alice and Bob devices before performing the secret key exchange. This hack induces a temporal detection efficiency mismatch in Bob that can allow Eve to break the security of the cryptosystem using faked states. We also experimentally investigate the superlinear behaviour in the single-photon detectors (SPDs) used by Bob. Due to this superlinearity, the SPDs feature an actual multi-photon detection probability which is generally higher than the theoretically-modelled value. We show how this increases the risk of detector control attacks on QKD systems (including Clavis2) employing such SPDs. Finally, we review the experimental feasibility of Trojan-horse attacks. In the case of Clavis2, the objective is to read Bob's phase modulator to acquire knowledge of his basis choice as this information suffices for constructing the raw key in the Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocol. We work in close collaboration with ID Quantique and for all these loopholes, we notified them in advance. Wherever possible, we or ID Quantique proposed countermeasures and they implemented suitable patches and upgrade their systems.
Security of quantum key distribution with multiphoton components
Yin, Hua-Lei; Fu, Yao; Mao, Yingqiu; Chen, Zeng-Bing
2016-01-01
Most qubit-based quantum key distribution (QKD) protocols extract the secure key merely from single-photon component of the attenuated lasers. However, with the Scarani-Acin-Ribordy-Gisin 2004 (SARG04) QKD protocol, the unconditionally secure key can be extracted from the two-photon component by modifying the classical post-processing procedure in the BB84 protocol. Employing the merits of SARG04 QKD protocol and six-state preparation, one can extract secure key from the components of single photon up to four photons. In this paper, we provide the exact relations between the secure key rate and the bit error rate in a six-state SARG04 protocol with single-photon, two-photon, three-photon, and four-photon sources. By restricting the mutual information between the phase error and bit error, we obtain a higher secure bit error rate threshold of the multiphoton components than previous works. Besides, we compare the performances of the six-state SARG04 with other prepare-and-measure QKD protocols using decoy states. PMID:27383014
Security of quantum key distribution with multiphoton components
NASA Astrophysics Data System (ADS)
Yin, Hua-Lei; Fu, Yao; Mao, Yingqiu; Chen, Zeng-Bing
2016-07-01
Most qubit-based quantum key distribution (QKD) protocols extract the secure key merely from single-photon component of the attenuated lasers. However, with the Scarani-Acin-Ribordy-Gisin 2004 (SARG04) QKD protocol, the unconditionally secure key can be extracted from the two-photon component by modifying the classical post-processing procedure in the BB84 protocol. Employing the merits of SARG04 QKD protocol and six-state preparation, one can extract secure key from the components of single photon up to four photons. In this paper, we provide the exact relations between the secure key rate and the bit error rate in a six-state SARG04 protocol with single-photon, two-photon, three-photon, and four-photon sources. By restricting the mutual information between the phase error and bit error, we obtain a higher secure bit error rate threshold of the multiphoton components than previous works. Besides, we compare the performances of the six-state SARG04 with other prepare-and-measure QKD protocols using decoy states.
Security of quantum key distribution with multiphoton components.
Yin, Hua-Lei; Fu, Yao; Mao, Yingqiu; Chen, Zeng-Bing
2016-01-01
Most qubit-based quantum key distribution (QKD) protocols extract the secure key merely from single-photon component of the attenuated lasers. However, with the Scarani-Acin-Ribordy-Gisin 2004 (SARG04) QKD protocol, the unconditionally secure key can be extracted from the two-photon component by modifying the classical post-processing procedure in the BB84 protocol. Employing the merits of SARG04 QKD protocol and six-state preparation, one can extract secure key from the components of single photon up to four photons. In this paper, we provide the exact relations between the secure key rate and the bit error rate in a six-state SARG04 protocol with single-photon, two-photon, three-photon, and four-photon sources. By restricting the mutual information between the phase error and bit error, we obtain a higher secure bit error rate threshold of the multiphoton components than previous works. Besides, we compare the performances of the six-state SARG04 with other prepare-and-measure QKD protocols using decoy states. PMID:27383014
Fundamental rate-loss tradeoff for optical quantum key distribution
NASA Astrophysics Data System (ADS)
Takeoka, Masahiro; Guha, Saikat; Wilde, Mark M.
2014-10-01
Since 1984, various optical quantum key distribution (QKD) protocols have been proposed and examined. In all of them, the rate of secret key generation decays exponentially with distance. A natural and fundamental question is then whether there are yet-to-be discovered optical QKD protocols (without quantum repeaters) that could circumvent this rate-distance tradeoff. This paper provides a major step towards answering this question. Here we show that the secret key agreement capacity of a lossy and noisy optical channel assisted by unlimited two-way public classical communication is limited by an upper bound that is solely a function of the channel loss, regardless of how much optical power the protocol may use. Our result has major implications for understanding the secret key agreement capacity of optical channels—a long-standing open problem in optical quantum information theory—and strongly suggests a real need for quantum repeaters to perform QKD at high rates over long distances.
Private database queries based on counterfactual quantum key distribution
NASA Astrophysics Data System (ADS)
Zhang, Jia-Li; Guo, Fen-Zhuo; Gao, Fei; Liu, Bin; Wen, Qiao-Yan
2013-08-01
Based on the fundamental concept of quantum counterfactuality, we propose a protocol to achieve quantum private database queries, which is a theoretical study of how counterfactuality can be employed beyond counterfactual quantum key distribution (QKD). By adding crucial detecting apparatus to the device of QKD, the privacy of both the distrustful user and the database owner can be guaranteed. Furthermore, the proposed private-database-query protocol makes full use of the low efficiency in the counterfactual QKD, and by adjusting the relevant parameters, the protocol obtains excellent flexibility and extensibility.
Tomographic Approach in Three-Orthogonal-Basis Quantum Key Distribution
NASA Astrophysics Data System (ADS)
Liang, Wen-Ye; Wen, Hao; Yin, Zhen-Qiang; Chen, Hua; Li, Hong-Wei; Chen, Wei; Han, Zheng-Fu
2015-09-01
At present, there is an increasing awareness of some three-orthogonal-basis quantum key distribution protocols, such as, the reference-frame-independent (RFI) protocol and the six-state protocol. For secure key rate estimations of these protocols, there are two methods: one is the conventional approach, and another is the tomographic approach. However, a comparison between these two methods has not been given yet. In this work, with the general model of rotation channel, we estimate the key rate using conventional and tomographic methods respectively. Results show that conventional estimation approach in RFI protocol is equivalent to tomographic approach only in the case of that one of three orthogonal bases is always aligned. In other cases, tomographic approach performs much better than the respective conventional approaches of the RFI protocol and the six-state protocol. Furthermore, based on the experimental data, we illustrate the deep connections between tomography and conventional RFI approach representations. Supported by the National Basic Research Program of China under Grant Nos. 2011CBA00200 and 2011CB921200 and the National Natural Science Foundation of China under Grant Nos. 60921091, 61475148, and 61201239 and Zhejiang Natural Science Foundation under Grant No. LQ13F050005
Tight finite-key analysis for passive decoy-state quantum key distribution under general attacks
NASA Astrophysics Data System (ADS)
Zhou, Chun; Bao, Wan-Su; Li, Hong-Wei; Wang, Yang; Li, Yuan; Yin, Zhen-Qiang; Chen, Wei; Han, Zheng-Fu
2014-05-01
For quantum key distribution (QKD) using spontaneous parametric-down-conversion sources (SPDCSs), the passive decoy-state protocol has been proved to be efficiently close to the theoretical limit of an infinite decoy-state protocol. In this paper, we apply a tight finite-key analysis for the passive decoy-state QKD using SPDCSs. Combining the security bound based on the uncertainty principle with the passive decoy-state protocol, a concise and stringent formula for calculating the key generation rate for QKD using SPDCSs is presented. The simulation shows that the secure distance under our formula can reach up to 182 km when the number of sifted data is 1010. Our results also indicate that, under the same deviation of statistical fluctuation due to finite-size effects, the passive decoy-state QKD with SPDCSs can perform as well as the active decoy-state QKD with a weak coherent source.
Randomness determines practical security of BB84 quantum key distribution
NASA Astrophysics Data System (ADS)
Li, Hong-Wei; Yin, Zhen-Qiang; Wang, Shuang; Qian, Yong-Jun; Chen, Wei; Guo, Guang-Can; Han, Zheng-Fu
2015-11-01
Unconditional security of the BB84 quantum key distribution protocol has been proved by exploiting the fundamental laws of quantum mechanics, but the practical quantum key distribution system maybe hacked by considering the imperfect state preparation and measurement respectively. Until now, different attacking schemes have been proposed by utilizing imperfect devices, but the general security analysis model against all of the practical attacking schemes has not been proposed. Here, we demonstrate that the general practical attacking schemes can be divided into the Trojan horse attack, strong randomness attack and weak randomness attack respectively. We prove security of BB84 protocol under randomness attacking models, and these results can be applied to guarantee the security of the practical quantum key distribution system.
Randomness determines practical security of BB84 quantum key distribution.
Li, Hong-Wei; Yin, Zhen-Qiang; Wang, Shuang; Qian, Yong-Jun; Chen, Wei; Guo, Guang-Can; Han, Zheng-Fu
2015-01-01
Unconditional security of the BB84 quantum key distribution protocol has been proved by exploiting the fundamental laws of quantum mechanics, but the practical quantum key distribution system maybe hacked by considering the imperfect state preparation and measurement respectively. Until now, different attacking schemes have been proposed by utilizing imperfect devices, but the general security analysis model against all of the practical attacking schemes has not been proposed. Here, we demonstrate that the general practical attacking schemes can be divided into the Trojan horse attack, strong randomness attack and weak randomness attack respectively. We prove security of BB84 protocol under randomness attacking models, and these results can be applied to guarantee the security of the practical quantum key distribution system. PMID:26552359
Randomness determines practical security of BB84 quantum key distribution
Li, Hong-Wei; Yin, Zhen-Qiang; Wang, Shuang; Qian, Yong-Jun; Chen, Wei; Guo, Guang-Can; Han, Zheng-Fu
2015-01-01
Unconditional security of the BB84 quantum key distribution protocol has been proved by exploiting the fundamental laws of quantum mechanics, but the practical quantum key distribution system maybe hacked by considering the imperfect state preparation and measurement respectively. Until now, different attacking schemes have been proposed by utilizing imperfect devices, but the general security analysis model against all of the practical attacking schemes has not been proposed. Here, we demonstrate that the general practical attacking schemes can be divided into the Trojan horse attack, strong randomness attack and weak randomness attack respectively. We prove security of BB84 protocol under randomness attacking models, and these results can be applied to guarantee the security of the practical quantum key distribution system. PMID:26552359
High-dimensional quantum key distribution using dispersive optics
NASA Astrophysics Data System (ADS)
Mower, Jacob; Zhang, Zheshen; Desjardins, Pierre; Lee, Catherine; Shapiro, Jeffrey H.; Englund, Dirk
2013-06-01
We propose a high-dimensional quantum key distribution (QKD) protocol that employs temporal correlations of entangled photons. The security of the protocol relies on measurements by Alice and Bob in one of two conjugate bases, implemented using dispersive optics. We show that this dispersion-based approach is secure against collective attacks. The protocol, which represents a QKD analog of pulse position modulation, is compatible with standard fiber telecommunications channels and wavelength division multiplexers. We describe several physical implementations to enhance the transmission rate and describe a heralded qudit source that is easy to implement and enables secret-key generation at >4 bits per character of distilled key across over 200 km of fiber.
A protocol for secure communication in large distributed systems
NASA Astrophysics Data System (ADS)
Anderson, D. P.; Ferrari, D.; Rangan, P. V.; Sartirana, B.
1987-01-01
A mechanism for secure communication in large distributed systems is proposed. The mechanism, called Authenticated Datagram Protocol (ADP), provides message authentication and, optionally, privacy of data. ADP is a host-to-host datagram protocol, positioned below the transport layer; it uses public-key encryption to establish secure channels between hosts and to authenticate owners, and single-key encryption for communication over a channel and to ensure privacy of the messages. ADP is shown to satisfy the main security requirements of large distributed systems, to provide end-to-end security in spite of its relatively low level, and to exhibit several advantages over schemes in which security mechanisms are at a higher level. The results of a trace-driven measurement study of ADP performance show that its throughput and latency are acceptable even within the limitations of today's technology, provided single-key encryption/decryption can be done in hardware.
Experimental realization of equiangular three-state quantum key distribution
NASA Astrophysics Data System (ADS)
Schiavon, Matteo; Vallone, Giuseppe; Villoresi, Paolo
2016-07-01
Quantum key distribution using three states in equiangular configuration combines a security threshold comparable with the one of the Bennett-Brassard 1984 protocol and a quantum bit error rate (QBER) estimation that does not need to reveal part of the key. We implement an entanglement-based version of the Renes 2004 protocol, using only passive optic elements in a linear scheme for the positive-operator valued measure (POVM), generating an asymptotic secure key rate of more than 10 kbit/s, with a mean QBER of 1.6%. We then demonstrate its security in the case of finite key and evaluate the key rate for both collective and general attacks.
Experimental realization of equiangular three-state quantum key distribution
Schiavon, Matteo; Vallone, Giuseppe; Villoresi, Paolo
2016-01-01
Quantum key distribution using three states in equiangular configuration combines a security threshold comparable with the one of the Bennett-Brassard 1984 protocol and a quantum bit error rate (QBER) estimation that does not need to reveal part of the key. We implement an entanglement-based version of the Renes 2004 protocol, using only passive optic elements in a linear scheme for the positive-operator valued measure (POVM), generating an asymptotic secure key rate of more than 10 kbit/s, with a mean QBER of 1.6%. We then demonstrate its security in the case of finite key and evaluate the key rate for both collective and general attacks. PMID:27465643
Key Rate Available from Mismatched Measurements in the BB84 Protocol and the Uncertainty Principle
NASA Astrophysics Data System (ADS)
Matsumoto, Ryutaroh; Watanabe, Shun
We consider the mismatched measurements in the BB84 quantum key distribution protocol, in which measuring bases are different from transmitting bases. We give a lower bound on the amount of a secret key that can be extracted from the mismatched measurements. Our lower bound shows that we can extract a secret key from the mismatched measurements with certain quantum channels, such as the channel over which the Hadamard matrix is applied to each qubit with high probability. Moreover, the entropic uncertainty principle implies that one cannot extract the secret key from both matched measurements and mismatched ones simultaneously, when we use the standard information reconciliation and privacy amplification procedure.
Finite-key analysis for measurement-device-independent quantum key distribution
NASA Astrophysics Data System (ADS)
Song, Ting-Ting; Wen, Qiao-Yan; Guo, Fen-Zhuo; Tan, Xiao-Qing
2012-08-01
The length of signal pulses is finite in practical quantum key distribution. The finite-key analysis of an unconditional quantum key distribution is a burning problem, and the efficient quantum key distribution protocol suitable for practical implementation, measurement-device-independent quantum key distribution (MDI QKD), was proposed very recently. We give the finite-key analysis of MDI QKD, which removes all detector side channels and generates many orders of key rate higher than that of full-device-independent quantum key distribution. The secure bound of the ultimate key rate is obtained under the statistical fluctuations of relative frequency, which can be applied directly to practical threshold detectors with low detection efficiency and highly lossy channels. The bound is evaluated for reasonable values of the observed parameters. The simulation shows that the secure distance is around 10 km when the number of sifted data is 1010. Moreover the secure distance would be much longer in practice because of some simplified treatments used in our paper.
Security of a semi-quantum protocol where reflections contribute to the secret key
NASA Astrophysics Data System (ADS)
Krawec, Walter O.
2016-05-01
In this paper, we provide a proof of unconditional security for a semi-quantum key distribution protocol introduced in a previous work. This particular protocol demonstrated the possibility of using X basis states to contribute to the raw key of the two users (as opposed to using only direct measurement results) even though a semi-quantum participant cannot directly manipulate such states. In this work, we provide a complete proof of security by deriving a lower bound of the protocol's key rate in the asymptotic scenario. Using this bound, we are able to find an error threshold value such that for all error rates less than this threshold, it is guaranteed that A and B may distill a secure secret key; for error rates larger than this threshold, A and B should abort. We demonstrate that this error threshold compares favorably to several fully quantum protocols. We also comment on some interesting observations about the behavior of this protocol under certain noise scenarios.
Twenty two years of quantum key distribution
NASA Astrophysics Data System (ADS)
Hughes, Richard
2007-03-01
Following their 1984 invention of quantum key distribution (QKD), Bennett and Brassard and colleagues performed a proof-of-principle QKD transmission over a 32-cm air path in 1991. This seminal experiment led other researchers to explore implementations of QKD in optical fibers and over line-of-sight outdoor atmospheric paths (``free-space''), resulting in dramatic increases in range, secret bit rate, security and availability. These advances have led to, and been enabled by, improvements in sources, single-photon detectors and the deeper understanding of QKD security with practical sources and detectors in the presence of transmission loss and channel noise. Today, QKD has been implemented with unconditional security over ranges greater than 100km, over multi-kilometer distances in high background environments in both fiber and free-space, and at high (GHz) clock rates over shorter distances. In my talk I will review the key enabling advances underlying these developments of experimental optical fiber and free-space QKD over the past 16 years, describe the present status of the field, and compare and contrast different approaches to implementing security against photon number splitting attacks. I will describe some recent results from QKD in dedicated (``dark'') optical fiber using ultra-high efficiency, low-noise transition edge sensor (TES) photo-detectors, achieving ultra-long transmission distances, and unconditional security over 107km through the use of a decoy-state protocol. I will also describe progress in making QKD compatible with all-optical fiber networks, including the co-existence of QKD signals with conventional optical data on the same fiber. I will conclude my talk with a survey of the prospects for QKD transmission distances exceeding 200km, which will include a comparison of the various single-photon detector technologies now becoming available for quantum communications.
Twenty two years of quantum key distribution
NASA Astrophysics Data System (ADS)
Hughes, Richard
2007-10-01
Following their 1984 invention of quantum key distribution (QKD), Bennett and Brassard and colleagues performed a proof-of-principle QKD transmission over a 32-cm air path in 1991. This seminal experiment led other researchers to explore implementations of QKD in optical fibers and over line-of-sight outdoor atmospheric paths (``free-space''), resulting in dramatic increases in range, secret bit rate, security and availability. These advances have led to, and been enabled by, improvements in sources, single-photon detectors and the deeper understanding of QKD security with practical sources and detectors in the presence of transmission loss and channel noise. Today, QKD has been implemented with unconditional security over ranges greater than 100km, over multi-kilometer distances in high background environments in both fiber and free-space, and at high (GHz) clock rates over shorter distances. In my talk I will review the key enabling advances underlying these developments of experimental QKD over the past 16 years, describe the present status of the field, and compare and contrast different approaches to implementing security against photon number splitting attacks. I will describe some recent results from QKD in dedicated (``dark'') optical fiber using ultra-high efficiency, low-noise transition edge sensor (TES) photo-detectors, achieving ultra-long transmission distances, and unconditional security over 107km through the use of a decoy-state protocol. I will also describe progress in making QKD compatible with all-optical fiber networks, including the co-existence of QKD signals with conventional optical data on the same fiber. I will conclude my talk with a survey of the prospects for QKD transmission distances exceeding 200km, which will include a comparison of the various single-photon detector technologies now becoming available for quantum communications.
Trustworthiness of detectors in quantum key distribution with untrusted detectors
Qi, Bing
2015-02-25
Measurement-device-independent quantum key distribution (MDI-QKD) protocol has been demonstrated as a viable solution to detector side-channel attacks. One of the main advantages of MDI-QKD is that the security can be proved without making any assumptions about how the measurement device works. The price to pay is the relatively low secure key rate comparing with conventional quantum key distribution (QKD), such as the decoy-state BB84 protocol. Recently a new QKD protocol, aiming at bridging the strong security of MDI-QKD with the high e ciency of conventional QKD, has been proposed. In this protocol, the legitimate receiver employs a trusted linear opticsmore » network to encode information on photons received from an insecure quantum channel, and then performs a Bell state measurement (BSM) using untrusted detectors. One crucial assumption made in most of these studies is that the untrusted BSM located inside the receiver's laboratory cannot send any unwanted information to the outside. Here in this paper, we show that if the BSM is completely untrusted, a simple scheme would allow the BSM to send information to the outside. Combined with Trojan horse attacks, this scheme could allow Eve to gain information of the quantum key without being detected. Ultimately, to prevent the above attack, either countermeasures to Trojan horse attacks or some trustworthiness to the "untrusted" BSM device is required.« less
Trustworthiness of detectors in quantum key distribution with untrusted detectors
Qi, Bing
2015-02-25
Measurement-device-independent quantum key distribution (MDI-QKD) protocol has been demonstrated as a viable solution to detector side-channel attacks. One of the main advantages of MDI-QKD is that the security can be proved without making any assumptions about how the measurement device works. The price to pay is the relatively low secure key rate comparing with conventional quantum key distribution (QKD), such as the decoy-state BB84 protocol. Recently a new QKD protocol, aiming at bridging the strong security of MDI-QKD with the high e ciency of conventional QKD, has been proposed. In this protocol, the legitimate receiver employs a trusted linear optics network to encode information on photons received from an insecure quantum channel, and then performs a Bell state measurement (BSM) using untrusted detectors. One crucial assumption made in most of these studies is that the untrusted BSM located inside the receiver's laboratory cannot send any unwanted information to the outside. Here in this paper, we show that if the BSM is completely untrusted, a simple scheme would allow the BSM to send information to the outside. Combined with Trojan horse attacks, this scheme could allow Eve to gain information of the quantum key without being detected. Ultimately, to prevent the above attack, either countermeasures to Trojan horse attacks or some trustworthiness to the "untrusted" BSM device is required.
Counterfactual quantum key distribution with high efficiency
Sun Ying; Wen Qiaoyan
2010-11-15
In a counterfactual quantum key distribution scheme, a secret key can be generated merely by transmitting the split vacuum pulses of single particles. We improve the efficiency of the first quantum key distribution scheme based on the counterfactual phenomenon. This scheme not only achieves the same security level as the original one but also has higher efficiency. We also analyze how to achieve the optimal efficiency under various conditions.
Sifting attacks in finite-size quantum key distribution
NASA Astrophysics Data System (ADS)
Pfister, Corsin; Lütkenhaus, Norbert; Wehner, Stephanie; Coles, Patrick J.
2016-05-01
A central assumption in quantum key distribution (QKD) is that Eve has no knowledge about which rounds will be used for parameter estimation or key distillation. Here we show that this assumption is violated for iterative sifting, a sifting procedure that has been employed in some (but not all) of the recently suggested QKD protocols in order to increase their efficiency. We show that iterative sifting leads to two security issues: (1) some rounds are more likely to be key rounds than others, (2) the public communication of past measurement choices changes this bias round by round. We analyze these two previously unnoticed problems, present eavesdropping strategies that exploit them, and find that the two problems are independent. We discuss some sifting protocols in the literature that are immune to these problems. While some of these would be inefficient replacements for iterative sifting, we find that the sifting subroutine of an asymptotically secure protocol suggested by Lo et al (2005 J. Cryptol. 18 133–65), which we call LCA sifting, has an efficiency on par with that of iterative sifting. One of our main results is to show that LCA sifting can be adapted to achieve secure sifting in the finite-key regime. More precisely, we combine LCA sifting with a certain parameter estimation protocol, and we prove the finite-key security of this combination. Hence we propose that LCA sifting should replace iterative sifting in future QKD implementations. More generally, we present two formal criteria for a sifting protocol that guarantee its finite-key security. Our criteria may guide the design of future protocols and inspire a more rigorous QKD analysis, which has neglected sifting-related attacks so far.
High-capacity quantum Fibonacci coding for key distribution
NASA Astrophysics Data System (ADS)
Simon, David S.; Lawrence, Nate; Trevino, Jacob; Dal Negro, Luca; Sergienko, Alexander V.
2013-03-01
Quantum cryptography and quantum key distribution (QKD) have been the most successful applications of quantum information processing, highlighting the unique capability of quantum mechanics, through the no-cloning theorem, to securely share encryption keys between two parties. Here, we present an approach to high-capacity, high-efficiency QKD by exploiting cross-disciplinary ideas from quantum information theory and the theory of light scattering of aperiodic photonic media. We propose a unique type of entangled-photon source, as well as a physical mechanism for efficiently sharing keys. The key-sharing protocol combines entanglement with the mathematical properties of a recursive sequence to allow a realization of the physical conditions necessary for implementation of the no-cloning principle for QKD, while the source produces entangled photons whose orbital angular momenta (OAM) are in a superposition of Fibonacci numbers. The source is used to implement a particular physical realization of the protocol by randomly encoding the Fibonacci sequence onto entangled OAM states, allowing secure generation of long keys from few photons. Unlike in polarization-based protocols, reference frame alignment is unnecessary, while the required experimental setup is simpler than other OAM-based protocols capable of achieving the same capacity and its complexity grows less rapidly with increasing range of OAM used.
The Case for Quantum Key Distribution
NASA Astrophysics Data System (ADS)
Stebila, Douglas; Mosca, Michele; Lütkenhaus, Norbert
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.
Secure quantum key distribution with an uncharacterized source.
Koashi, Masato; Preskill, John
2003-02-01
We prove the security of the Bennett-Brassard (BB84) quantum key distribution protocol for an arbitrary source whose averaged states are basis independent, a condition that is automatically satisfied if the source is suitably designed. The proof is based on the observation that, to an adversary, the key extraction process is equivalent to a measurement in the sigma(x) basis performed on a pure sigma(z)-basis eigenstate. The dependence of the achievable key length on the bit error rate is the same as that established by Shor and Preskill [Phys. Rev. Lett. 85, 441 (2000)
Security analysis of the decoy method with the Bennett-Brassard 1984 protocol for finite key lengths
NASA Astrophysics Data System (ADS)
Hayashi, Masahito; Nakayama, Ryota
2014-06-01
This paper provides a formula for the sacrifice bit-length for privacy amplification with the Bennett-Brassard 1984 protocol for finite key lengths, when we employ the decoy method. Using the formula, we can guarantee the security parameter for a realizable quantum key distribution system. The key generation rates with finite key lengths are numerically evaluated. The proposed method improves the existing key generation rate even in the asymptotic setting.
NASA Astrophysics Data System (ADS)
Goyal, Sandeep K.; Hamadou Ibrahim, Alpha; Roux, Filippus S.; Konrad, Thomas; Forbes, Andrew
2016-06-01
Using an experimental setup that simulates a turbulent atmosphere, we study the secret key rate for quantum key distribution (QKD) protocols in orbital angular momentum based free space quantum communication. The QKD protocols under consideration include the Ekert 91 protocol for different choices of mutually unbiased bases and the six-state protocol. We find that the secret key rate of these protocols decay to zero, roughly at the same scale where the entanglement of formation decays to zero.
Reference-frame-independent quantum key distribution with source flaws
NASA Astrophysics Data System (ADS)
Wang, Can; Sun, Shi-Hai; Ma, Xiang-Chun; Tang, Guang-Zhao; Liang, Lin-Mei
2015-10-01
Compared with the traditional protocols of quantum key distribution (QKD), the reference-frame-independent (RFI)-QKD protocol has been generally proved to be very useful and practical, since its experimental implementation can be simplified without the alignment of a reference frame. In most RFI-QKD systems, the encoding states are always taken to be perfect, which, however, is not practical in realizations. In this paper, we consider the security of RFI QKD with source flaws based on the loss-tolerant method proposed by Tamaki et al. [Phys. Rev. A 90, 052314 (2014), 10.1103/PhysRevA.90.052314]. As the six-state protocol can be realized with four states, we show that the RFI-QKD protocol can also be performed with only four encoding states instead of six encoding states in its standard version. Furthermore, the numerical simulation results show that the source flaws in the key-generation basis (Z basis) will reduce the key rate but are loss tolerant, while the ones in X and Y bases almost have no effect and the key rate remains almost the same even when they are very large. Hence, our method and results will have important significance in practical experiments, especially in earth-to-satellite or chip-to-chip quantum communications.
A continuous-variable quantum key distribution using correlated photons
NASA Astrophysics Data System (ADS)
Donkor, Eric; Erdmann, Reinhard; Kumavor, Patrick D.
2015-05-01
We propose a quantum key distribution system based on the generation and transmission of random continuous variables in time, energy (frequency), phase, and photon number. The bounds for quantum measurement in our scheme are determined by the uncertainty principle, rather than single quadrature measurements of entangled states, or the no-cloning of (unknown) single quantum states. Correlated measurements are performed in the energy-time, and momentum-displacement frames. As a result the QKD protocols for generation of raw-keys, sifted-keys and privacy amplifications offer a higher level of security against individual or multi-attacks. The network architecture is in a plug-and-play configuration; the QKD protocol; determination of quantum bit error rate, and estimation of system performance in the presence of eavesdropping are presented.
Long-distance quantum key distribution with imperfect devices
Lo Piparo, Nicoló; Razavi, Mohsen
2014-12-04
Quantum key distribution over probabilistic quantum repeaters is addressed. We compare, under practical assumptions, two such schemes in terms of their secure key generation rate per memory, R{sub QKD}. The two schemes under investigation are the one proposed by Duan et al. in [Nat. 414, 413 (2001)] and that of Sangouard et al. proposed in [Phys. Rev. A 76, 050301 (2007)]. We consider various sources of imperfections in the latter protocol, such as a nonzero double-photon probability for the source, dark count per pulse, channel loss and inefficiencies in photodetectors and memories, to find the rate for different nesting levels. We determine the maximum value of the double-photon probability beyond which it is not possible to share a secret key anymore. We find the crossover distance for up to three nesting levels. We finally compare the two protocols.
Mismatched-basis statistics enable quantum key distribution with uncharacterized qubit sources
NASA Astrophysics Data System (ADS)
Yin, Zhen-Qiang; Fung, Chi-Hang Fred; Ma, Xiongfeng; Zhang, Chun-Mei; Li, Hong-Wei; Chen, Wei; Wang, Shuang; Guo, Guang-Can; Han, Zheng-Fu
2014-11-01
In the postprocessing of quantum key distribution, the raw key bits from the mismatched-basis measurements, where two parties use different bases, are normally discarded. Here, we propose a postprocessing method that exploits measurement statistics from mismatched-basis cases and prove that incorporating these statistics enables uncharacterized qubit sources to be used in the measurement-device-independent quantum key distribution protocol and the Bennett-Brassard 1984 protocol, which is otherwise impossible.
Long-distance continuous-variable quantum key distribution with efficient channel estimation
NASA Astrophysics Data System (ADS)
Ruppert, László; Usenko, Vladyslav C.; Filip, Radim
2014-12-01
We investigate the main limitations which prevent the continuous-variable quantum key distribution protocols from achieving long distances in the finite-size setting. We propose a double-modulation protocol which allows using each state for both channel estimation and key distribution. As opposed to the standard method, we optimize the parameters of the protocol and consider squeezed as well as coherent states as a signal. By optimally combining the resources the key rate can approach the theoretical limit for long distances, and one can obtain about ten times higher key rate using ten times shorter block size than in the current state-of-the-art implementation.
Optimal Device Independent Quantum Key Distribution
NASA Astrophysics Data System (ADS)
Kamaruddin, S.; Shaari, J. S.
2016-08-01
We consider an optimal quantum key distribution setup based on minimal number of measurement bases with binary yields used by parties against an eavesdropper limited only by the no-signaling principle. We note that in general, the maximal key rate can be achieved by determining the optimal tradeoff between measurements that attain the maximal Bell violation and those that maximise the bit correlation between the parties. We show that higher correlation between shared raw keys at the expense of maximal Bell violation provide for better key rates for low channel disturbance.
Optimal Device Independent Quantum Key Distribution
Kamaruddin, S.; Shaari, J. S.
2016-01-01
We consider an optimal quantum key distribution setup based on minimal number of measurement bases with binary yields used by parties against an eavesdropper limited only by the no-signaling principle. We note that in general, the maximal key rate can be achieved by determining the optimal tradeoff between measurements that attain the maximal Bell violation and those that maximise the bit correlation between the parties. We show that higher correlation between shared raw keys at the expense of maximal Bell violation provide for better key rates for low channel disturbance. PMID:27485160
Optimal Device Independent Quantum Key Distribution.
Kamaruddin, S; Shaari, J S
2016-01-01
We consider an optimal quantum key distribution setup based on minimal number of measurement bases with binary yields used by parties against an eavesdropper limited only by the no-signaling principle. We note that in general, the maximal key rate can be achieved by determining the optimal tradeoff between measurements that attain the maximal Bell violation and those that maximise the bit correlation between the parties. We show that higher correlation between shared raw keys at the expense of maximal Bell violation provide for better key rates for low channel disturbance. PMID:27485160
Practical issues in quantum-key-distribution postprocessing
Fung, C.-H. Fred; Chau, H. F.; Ma Xiongfeng
2010-01-15
Quantum key distribution (QKD) is a secure key generation method between two distant parties by wisely exploiting properties of quantum mechanics. In QKD, experimental measurement outcomes on quantum states are transformed by the two parties to a secret key. This transformation is composed of many logical steps (as guided by security proofs), which together will ultimately determine the length of the final secret key and its security. We detail the procedure for performing such classical postprocessing taking into account practical concerns (including the finite-size effect and authentication and encryption for classical communications). This procedure is directly applicable to realistic QKD experiments and thus serves as a recipe that specifies what postprocessing operations are needed and what the security level is for certain lengths of the keys. Our result is applicable to the BB84 protocol with a single or entangled photon source.
NASA Astrophysics Data System (ADS)
Li, Fang-Yi; Yin, Zhen-Qiang; Li, Hong-Wei; Chen, Wei; Wang, Shuang; Wen, Hao; Zhao, Yi-Bo; Han, Zheng-Fu
2014-07-01
Although some ideal quantum key distribution protocols have been proved to be secure, there have been some demonstrations that practical quantum key distribution implementations were hacked due to some real-life imperfections. Among these attacks, detector side channel attacks may be the most serious. Recently, a measurement device independent quantum key distribution protocol [Phys. Rev. Lett. 108 (2012) 130503] was proposed and all detector side channel attacks are removed in this scheme. Here a new security proof based on quantum information theory is given. The eavesdropper's information of the sifted key bits is bounded. Then with this bound, the final secure key bit rate can be obtained.
Generalized decoding, effective channels, and simplified security proofs in quantum key distribution
Renes, Joseph M.; Grassl, Markus
2006-08-15
Prepare and measure quantum key distribution protocols can be decomposed into two basic steps: delivery of the signals over a quantum channel and distillation of a secret key from the signal and measurement records by classical processing and public communication. Here we formalize the distillation process for a general protocol in a purely quantum-mechanical framework and demonstrate that it can be viewed as creating an 'effective' quantum channel between the legitimate users Alice and Bob. The process of secret key generation can then be viewed as entanglement distribution using this channel, which enables application of entanglement-based security proofs to essentially any prepare and measure protocol. To ensure secrecy of the key, Alice and Bob must be able to estimate the channel noise from errors in the key, and we further show how symmetries of the distillation process simplify this task. Applying this method, we prove the security of several key distribution protocols based on equiangular spherical codes.
Key Reconciliation for High Performance Quantum Key Distribution
Martinez-Mateo, Jesus; Elkouss, David; Martin, Vicente
2013-01-01
Quantum Key Distribution is carving its place among the tools used to secure communications. While a difficult technology, it enjoys benefits that set it apart from the rest, the most prominent is its provable security based on the laws of physics. QKD requires not only the mastering of signals at the quantum level, but also a classical processing to extract a secret-key from them. This postprocessing has been customarily studied in terms of the efficiency, a figure of merit that offers a biased view of the performance of real devices. Here we argue that it is the throughput the significant magnitude in practical QKD, specially in the case of high speed devices, where the differences are more marked, and give some examples contrasting the usual postprocessing schemes with new ones from modern coding theory. A good understanding of its implications is very important for the design of modern QKD devices. PMID:23546440
Establishing security of quantum key distribution without monitoring disturbance
NASA Astrophysics Data System (ADS)
Koashi, Masato
2015-10-01
In conventional quantum key distribution (QKD) protocols, the information leak to an eavesdropper is estimated through the basic principle of quantum mechanics dictated in the original version of Heisenberg's uncertainty principle. The amount of leaked information on a shared sifted key is bounded from above essentially by using information-disturbance trade-off relations, based on the amount of signal disturbance measured via randomly sampled or inserted probe signals. Here we discuss an entirely different avenue toward the private communication, which does not rely on the information disturbance trade-off relations and hence does not require a monitoring of signal disturbance. The independence of the amount of privacy amplification from that of disturbance tends to give it a high tolerance on the channel noises. The lifting of the burden of precise statistical estimation of disturbance leads to a favorable finite-key-size effect. A protocol based on the novel principle can be implemented by only using photon detectors and classical optics tools: a laser, a phase modulator, and an interferometer. The protocol resembles the differential-phase-shift QKD protocol in that both share a simple binary phase shift keying on a coherent train of weak pulses from a laser. The difference lies in the use of a variable-delay interferometer in the new protocol, which randomly changes the combination of pulse pairs to be superposed. This extra randomness has turned out to be enough to upper-bound the information extracted by the eavesdropper, regardless of how they have disturbed the quantum signal.
Experimental quantum key distribution without monitoring signal disturbance
NASA Astrophysics Data System (ADS)
Takesue, Hiroki; Sasaki, Toshihiko; Tamaki, Kiyoshi; Koashi, Masato
2015-12-01
Quantum key distribution (QKD) is a method of realizing private communication securely against an adversary with unlimited power. The QKD protocols proposed and demonstrated over the past 30 years relied on the monitoring of signal disturbance to set an upper limit to the amount of leaked information. Here, we report an experimental realization of the recently proposed round-robin differential-phase-shift protocol. We used a receiver set-up in which photons are randomly routed to one of four interferometers with different delays so that the phase difference is measured uniformly over all pair combinations among five pulses comprising the quantum signal. The amount of leak can be bounded from this randomness alone, and a secure key was extracted even when a finite communication time and the threshold nature of photon detectors were taken into account. This demonstrates the first QKD experiment without signal disturbance monitoring, thus opening up a new direction towards secure communication.
Fundamental rate-loss tradeoff for optical quantum key distribution.
Takeoka, Masahiro; Guha, Saikat; Wilde, Mark M
2014-01-01
Since 1984, various optical quantum key distribution (QKD) protocols have been proposed and examined. In all of them, the rate of secret key generation decays exponentially with distance. A natural and fundamental question is then whether there are yet-to-be discovered optical QKD protocols (without quantum repeaters) that could circumvent this rate-distance tradeoff. This paper provides a major step towards answering this question. Here we show that the secret key agreement capacity of a lossy and noisy optical channel assisted by unlimited two-way public classical communication is limited by an upper bound that is solely a function of the channel loss, regardless of how much optical power the protocol may use. Our result has major implications for understanding the secret key agreement capacity of optical channels-a long-standing open problem in optical quantum information theory-and strongly suggests a real need for quantum repeaters to perform QKD at high rates over long distances. PMID:25341406
Quantum key distribution without sending a quantum signal
NASA Astrophysics Data System (ADS)
Ralph, T. C.; Walk, N.
2015-06-01
Quantum Key Distribution is a quantum communication technique in which random numbers are encoded on quantum systems, usually photons, and sent from one party, Alice, to another, Bob. Using the data sent via the quantum signals, supplemented by classical communication, it is possible for Alice and Bob to share an unconditionally secure secret key. This is not possible if only classical signals are sent. While this last statement is a long standing result from quantum information theory it turns out only to be true in a non-relativistic setting. If relativistic quantum field theory is considered we show it is possible to distribute an unconditionally secure secret key without sending a quantum signal, instead harnessing the intrinsic entanglement between different regions of space-time. The protocol is practical in free space given horizon technology and might be testable in principle in the near term using microwave technology.
Experimental Measurement-Device-Independent Quantum Key Distribution
NASA Astrophysics Data System (ADS)
Liu, Yang; Chen, Teng-Yun; Wang, Liu-Jun; Liang, Hao; Shentu, Guo-Liang; Wang, Jian; Cui, Ke; Yin, Hua-Lei; Liu, Nai-Le; Li, Li; Ma, Xiongfeng; Pelc, Jason S.; Fejer, M. M.; Peng, Cheng-Zhi; Zhang, Qiang; Pan, Jian-Wei
2013-09-01
Quantum key distribution is proven to offer unconditional security in communication between two remote users with ideal source and detection. Unfortunately, ideal devices never exist in practice and device imperfections have become the targets of various attacks. By developing up-conversion single-photon detectors with high efficiency and low noise, we faithfully demonstrate the measurement-device-independent quantum-key-distribution protocol, which is immune to all hacking strategies on detection. Meanwhile, we employ the decoy-state method to defend attacks on a nonideal source. By assuming a trusted source scenario, our practical system, which generates more than a 25 kbit secure key over a 50 km fiber link, serves as a stepping stone in the quest for unconditionally secure communications with realistic devices.
Experimental measurement-device-independent quantum key distribution.
Liu, Yang; Chen, Teng-Yun; Wang, Liu-Jun; Liang, Hao; Shentu, Guo-Liang; Wang, Jian; Cui, Ke; Yin, Hua-Lei; Liu, Nai-Le; Li, Li; Ma, Xiongfeng; Pelc, Jason S; Fejer, M M; Peng, Cheng-Zhi; Zhang, Qiang; Pan, Jian-Wei
2013-09-27
Quantum key distribution is proven to offer unconditional security in communication between two remote users with ideal source and detection. Unfortunately, ideal devices never exist in practice and device imperfections have become the targets of various attacks. By developing up-conversion single-photon detectors with high efficiency and low noise, we faithfully demonstrate the measurement-device-independent quantum-key-distribution protocol, which is immune to all hacking strategies on detection. Meanwhile, we employ the decoy-state method to defend attacks on a nonideal source. By assuming a trusted source scenario, our practical system, which generates more than a 25 kbit secure key over a 50 km fiber link, serves as a stepping stone in the quest for unconditionally secure communications with realistic devices. PMID:24116758
The physical underpinning of security proofs for quantum key distribution
NASA Astrophysics Data System (ADS)
Boileau, Jean Christian
The dawn of quantum technology unveils a plethora of new possibilities and challenges in the world of information technology, one of which is the quest for secure information transmission. A breakthrough in classical algorithm or the development of a quantum computer could threaten the security of messages encoded using public key cryptosystems based on one-way function such as RSA. Quantum key distribution (QKD) offers an unconditionally secure alternative to such schemes, even in the advent of a quantum computer, as it does not rely on mathematical or technological assumptions, but rather on the universality of the laws of quantum mechanics. Physical concepts associated with quantum mechanics, like the uncertainty principle or entanglement, paved the way to the first successful security proof for QKD. Ever since, further development in security proofs for QKD has been remarkable. But the connection between entanglement distillation and the uncertainty principle has remained hidden under a pile of mathematical burden. Our main goal is to dig the physics out of the new advances in security proofs for QKD. By introducing an alternative definition of private state, which elaborates the ideas of Mayers and Koashi, we explain how the security of all QKD protocols follows from an entropic uncertainty principle. We show explicitly how privacy amplification protocol can be reduced to a private state distillation protocol constructed from our observations about the uncertainty principle. We also derive a generic security proof for one-way permutation-invariant QKD protocols. Considering collective attack, we achieve the same secret key generation rate as the Devetak-Winter's bound. Generalizing an observation from Kraus, Branciard and Renner, we have provided an improved version of the secret key generation rates by considering a different symmetrization. In certain situations, we argue that Azuma's inequality can simplify the security proof considerably, and we explain
Secure multi-party communication with quantum key distribution managed by trusted authority
Hughes, Richard John; Nordholt, Jane Elizabeth; Peterson, Charles Glen
2015-01-06
Techniques and tools for implementing protocols for secure multi-party communication after quantum key distribution ("QKD") are described herein. In example implementations, a trusted authority facilitates secure communication between multiple user devices. The trusted authority distributes different quantum keys by QKD under trust relationships with different users. The trusted authority determines combination keys using the quantum keys and makes the combination keys available for distribution (e.g., for non-secret distribution over a public channel). The combination keys facilitate secure communication between two user devices even in the absence of QKD between the two user devices. With the protocols, benefits of QKD are extended to multi-party communication scenarios. In addition, the protocols can retain benefit of QKD even when a trusted authority is offline or a large group seeks to establish secure communication within the group.
Secure multi-party communication with quantum key distribution managed by trusted authority
Nordholt, Jane Elizabeth; Hughes, Richard John; Peterson, Charles Glen
2013-07-09
Techniques and tools for implementing protocols for secure multi-party communication after quantum key distribution ("QKD") are described herein. In example implementations, a trusted authority facilitates secure communication between multiple user devices. The trusted authority distributes different quantum keys by QKD under trust relationships with different users. The trusted authority determines combination keys using the quantum keys and makes the combination keys available for distribution (e.g., for non-secret distribution over a public channel). The combination keys facilitate secure communication between two user devices even in the absence of QKD between the two user devices. With the protocols, benefits of QKD are extended to multi-party communication scenarios. In addition, the protocols can retain benefit of QKD even when a trusted authority is offline or a large group seeks to establish secure communication within the group.
This report is a generic verification protocol by which EPA’s Environmental Technology Verification program tests newly developed equipment for distributed generation of electric power, usually micro-turbine generators and internal combustion engine generators. The protocol will ...
Collusive attacks to "circle-type" multi-party quantum key agreement protocols
NASA Astrophysics Data System (ADS)
Liu, Bin; Xiao, Di; Jia, Heng-Yue; Liu, Run-Zong
2016-05-01
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 in predetermining 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 protocols that can resist collusive attacks are also similar. We call such protocols complete-graph-type MQKA protocols. A MQKA protocol also exists that can resist the above attacks but is still not fair, and we call it the tree-type MQKA protocol. We first point out a common, easily missed loophole that severely compromises the fairness of present circle-type MQKA protocols. Then we show that two dishonest participants at special positions can totally predetermine the key generated by circle-type MQKA protocols. We anticipate that our observations will contribute to secure and fair MQKA protocols, especially circle-type protocols.
Improving security in the Fiber Distributed Data Interface (FDDI) protocol
NASA Astrophysics Data System (ADS)
Jones, Benjamin E.
1992-09-01
The arrival of high speed packet switched fiber optic LAN's has allowed local area design architectures to be used for larger metropolitan area network (MAN) implementations. The current LAN security mechanisms used in larger and faster fiber optic LAN's and MAN's are often inappropriate or unacceptable for use with emerging applications. The protocol of the Fiber Distributed Data Interface (FDDI) standard provides a natural means for message integrity and availability verification. However, privacy in FDDI is facilitated at higher layers through a generic LAN standard. This thesis proposes a modification to the FDDI protocol implemented at the medium access control (MAC) sublayer, which integrates a confidentiality mechanism for data transfer. The modification provides a simple comprehensive security package to meet the high performance needs of current and emerging applications. In the proposed modification, the inherent properties of the ring are exploited using a unique Central Key Translator to distribute initial session keys. A symmetric bit stream cipher based on modulo2 addition is used for encryption/decryption by the transmitting and receiving stations. Part of the plain text from transmitted message frames is used as feedback to generate new session keys.
Efficient Anonymous Authentication Protocol Using Key-Insulated Signature Scheme for Secure VANET
NASA Astrophysics Data System (ADS)
Park, Youngho; Sur, Chul; Jung, Chae Duk; Rhee, Kyung-Hyune
In this paper, we propose an efficient authentication protocol with conditional privacy preservation for secure vehicular communications. The proposed protocol follows the system model to issue on-the-fly anonymous public key certificates to vehicles by road-side units. In order to design an efficient message authentication protocol, we consider a key-insulated signature scheme for certifying anonymous public keys of vehicles to such a system model. We demonstrate experimental results to confirm that the proposed protocol has better performance than other protocols based on group signature schemes.
Gonzalez, Elias; Kish, Laszlo B; Balog, Robert S; Enjeti, Prasad
2013-01-01
We introduce a protocol with a reconfigurable filter system to create non-overlapping single loops in the smart power grid for the realization of the Kirchhoff-Law-Johnson-(like)-Noise secure key distribution system. The protocol is valid for one-dimensional radial networks (chain-like power line) which are typical of the electricity distribution network between the utility and the customer. The speed of the protocol (the number of steps needed) versus grid size is analyzed. When properly generalized, such a system has the potential to achieve unconditionally secure key distribution over the smart power grid of arbitrary geometrical dimensions. PMID:23936164
2013-01-01
We introduce a protocol with a reconfigurable filter system to create non-overlapping single loops in the smart power grid for the realization of the Kirchhoff-Law-Johnson-(like)-Noise secure key distribution system. The protocol is valid for one-dimensional radial networks (chain-like power line) which are typical of the electricity distribution network between the utility and the customer. The speed of the protocol (the number of steps needed) versus grid size is analyzed. When properly generalized, such a system has the potential to achieve unconditionally secure key distribution over the smart power grid of arbitrary geometrical dimensions. PMID:23936164
Quantum key distribution using gaussian-modulated coherent states
NASA Astrophysics Data System (ADS)
Grosshans, Frédéric; Van Assche, Gilles; Wenger, Jérôme; Brouri, Rosa; Cerf, Nicolas J.; Grangier, Philippe
2003-01-01
Quantum continuous variables are being explored as an alternative means to implement quantum key distribution, which is usually based on single photon counting. The former approach is potentially advantageous because it should enable higher key distribution rates. Here we propose and experimentally demonstrate a quantum key distribution protocol based on the transmission of gaussian-modulated coherent states (consisting of laser pulses containing a few hundred photons) and shot-noise-limited homodyne detection; squeezed or entangled beams are not required. Complete secret key extraction is achieved using a reverse reconciliation technique followed by privacy amplification. The reverse reconciliation technique is in principle secure for any value of the line transmission, against gaussian individual attacks based on entanglement and quantum memories. Our table-top experiment yields a net key transmission rate of about 1.7 megabits per second for a loss-free line, and 75 kilobits per second for a line with losses of 3.1dB. We anticipate that the scheme should remain effective for lines with higher losses, particularly because the present limitations are essentially technical, so that significant margin for improvement is available on both the hardware and software.
Quantum key distribution using gaussian-modulated coherent states.
Grosshans, Frédéric; Van Assche, Gilles; Wenger, Jérôme; Brouri, Rosa; Cerf, Nicolas J; Grangier, Philippe
2003-01-16
Quantum continuous variables are being explored as an alternative means to implement quantum key distribution, which is usually based on single photon counting. The former approach is potentially advantageous because it should enable higher key distribution rates. Here we propose and experimentally demonstrate a quantum key distribution protocol based on the transmission of gaussian-modulated coherent states (consisting of laser pulses containing a few hundred photons) and shot-noise-limited homodyne detection; squeezed or entangled beams are not required. Complete secret key extraction is achieved using a reverse reconciliation technique followed by privacy amplification. The reverse reconciliation technique is in principle secure for any value of the line transmission, against gaussian individual attacks based on entanglement and quantum memories. Our table-top experiment yields a net key transmission rate of about 1.7 megabits per second for a loss-free line, and 75 kilobits per second for a line with losses of 3.1 dB. We anticipate that the scheme should remain effective for lines with higher losses, particularly because the present limitations are essentially technical, so that significant margin for improvement is available on both the hardware and software. PMID:12529636
Finite-key security analysis of quantum key distribution with imperfect light sources
Mizutani, Akihiro; Curty, Marcos; Lim, Charles Ci Wen; Imoto, Nobuyuki; Tamaki, Kiyoshi
2015-09-09
In recent years, the gap between theory and practice in quantum key distribution (QKD) has been significantly narrowed, particularly for QKD systems with arbitrarily flawed optical receivers. The status for QKD systems with imperfect light sources is however less satisfactory, in the sense that the resulting secure key rates are often overly dependent on the quality of state preparation. This is especially the case when the channel loss is high. Very recently, to overcome this limitation, Tamaki et al proposed a QKD protocol based on the so-called 'rejected data analysis', and showed that its security in the limit of infinitelymore » long keys is almost independent of any encoding flaw in the qubit space, being this protocol compatible with the decoy state method. Here, as a step towards practical QKD, we show that a similar conclusion is reached in the finite-key regime, even when the intensity of the light source is unstable. More concretely, we derive security bounds for a wide class of realistic light sources and show that the bounds are also efficient in the presence of high channel loss. Our results strongly suggest the feasibility of long distance provably secure communication with imperfect light sources.« less
Finite-key security analysis of quantum key distribution with imperfect light sources
Mizutani, Akihiro; Curty, Marcos; Lim, Charles Ci Wen; Imoto, Nobuyuki; Tamaki, Kiyoshi
2015-09-09
In recent years, the gap between theory and practice in quantum key distribution (QKD) has been significantly narrowed, particularly for QKD systems with arbitrarily flawed optical receivers. The status for QKD systems with imperfect light sources is however less satisfactory, in the sense that the resulting secure key rates are often overly dependent on the quality of state preparation. This is especially the case when the channel loss is high. Very recently, to overcome this limitation, Tamaki et al proposed a QKD protocol based on the so-called 'rejected data analysis', and showed that its security in the limit of infinitely long keys is almost independent of any encoding flaw in the qubit space, being this protocol compatible with the decoy state method. Here, as a step towards practical QKD, we show that a similar conclusion is reached in the finite-key regime, even when the intensity of the light source is unstable. More concretely, we derive security bounds for a wide class of realistic light sources and show that the bounds are also efficient in the presence of high channel loss. Our results strongly suggest the feasibility of long distance provably secure communication with imperfect light sources.
Experimental quantum key distribution with source flaws
NASA Astrophysics Data System (ADS)
Xu, Feihu; Wei, Kejin; Sajeed, Shihan; Kaiser, Sarah; Sun, Shihai; Tang, Zhiyuan; Qian, Li; Makarov, Vadim; Lo, Hoi-Kwong
2015-09-01
Decoy-state quantum key distribution (QKD) is a standard technique in current quantum cryptographic implementations. Unfortunately, existing experiments have two important drawbacks: the state preparation is assumed to be perfect without errors and the employed security proofs do not fully consider the finite-key effects for general attacks. These two drawbacks mean that existing experiments are not guaranteed to be proven to be secure in practice. Here, we perform an experiment that shows secure QKD with imperfect state preparations over long distances and achieves rigorous finite-key security bounds for decoy-state QKD against coherent attacks in the universally composable framework. We quantify the source flaws experimentally and demonstrate a QKD implementation that is tolerant to channel loss despite the source flaws. Our implementation considers more real-world problems than most previous experiments, and our theory can be applied to general discrete-variable QKD systems. These features constitute a step towards secure QKD with imperfect devices.
Quantum key distribution over multicore fiber
NASA Astrophysics Data System (ADS)
Dynes, J. F.; Kindness, S. J.; Tam, S. W.-B.; Plews, A.; Sharpe, A. W.; Lucamarini, M.; Fröhlich, B.; Yuan, Z. L.; Penty, R. V.; Shields, A. J.
2016-04-01
We present the first quantum key distribution (QKD) experiment over multicore fiber. With space division multiplexing, we demonstrate that weak QKD signals can coexist with classical data signals launched at full power in a 53 km 7-core fiber, while showing negligible degradation in performance. Based on a characterization of intercore crosstalk, we perform additional simulations highlighting that classical data bandwidths beyond 1Tb/s can be supported with high speed QKD on the same fiber.
Quantum key distribution over multicore fiber.
Dynes, J F; Kindness, S J; Tam, S W-B; Plews, A; Sharpe, A W; Lucamarini, M; Fröhlich, B; Yuan, Z L; Penty, R V; Shields, A J
2016-04-18
We present the first quantum key distribution (QKD) experiment over multicore fiber. With space division multiplexing, we demonstrate that weak QKD signals can coexist with classical data signals launched at full power in a 53 km 7-core fiber, while showing negligible degradation in performance. Based on a characterization of intercore crosstalk, we perform additional simulations highlighting that classical data bandwidths beyond 1Tb/s can be supported with high speed QKD on the same fiber. PMID:27137247
NASA Astrophysics Data System (ADS)
Zhang, Yong-Sheng; Li, Chuan-Feng; Guo, Guang-Can
2001-03-01
In a recent paper [A. Cabello, Phys. Rev. A 61, 052312 (2000)], a quantum key distribution protocol based on entanglement swapping was proposed. However, in this Comment, it is shown that this protocol is insecure if Eve uses a special strategy to attack.
Bell's inequality, random sequence, and quantum key distribution
NASA Astrophysics Data System (ADS)
Hwang, Won-Young
2005-05-01
The Ekert 1991 quantum key distribution (QKD) protocol appears to be secure regardless of whatever devices legitimate users adopt for the protocol, as long as the devices give a result that violates Bell’s inequality. However, this is not the case if they ignore nondetection events because Eve can make use of the detection loophole, as Larrson showed [Quantum Inf. Comput. 2, 434 (2002)]. We show that even when legitimate users take into account nondetection events Eve can successfully eavesdrop if the QKD system has been appropriately designed by the manufacturer. A loophole utilized here is that of “free choice” (or “real randomness”). Local QKD devices with a pseudorandom sequence generator installed in them can apparently violate Bell’s inequality.
Long-distance quantum key distribution with imperfect devices
NASA Astrophysics Data System (ADS)
Lo Piparo, Nicoló; Razavi, Mohsen
2013-07-01
Quantum key distribution over probabilistic quantum repeaters is addressed. We compare, under practical assumptions, two such schemes in terms of their secret key generation rates per quantum memory. The two schemes under investigation are the one proposed by Duan [Nature (London)0028-083610.1038/35106500 414, 413 (2001)] and that of Sangouard [Phys. Rev. A1050-294710.1103/PhysRevA.76.050301 76, 050301 (2007)]. We consider various sources of imperfection in both protocols, such as nonzero double-photon probabilities at the sources, dark counts in detectors, and inefficiencies in the channel, photodetectors, and memories. We also consider memory decay and dephasing processes in our analysis. For the latter system, we determine the maximum value of the double-photon probability beyond which secret key distillation is not possible. We also find crossover distances for one nesting level to its subsequent one. We finally compare the two protocols in terms of their achievable secret key generation rates at their optimal settings. Our results specify regimes of operation where one system outperforms the other.
Towards communication-efficient quantum oblivious key distribution
NASA Astrophysics Data System (ADS)
Panduranga Rao, M. V.; Jakobi, M.
2013-01-01
Symmetrically private information retrieval, a fundamental problem in the field of secure multiparty computation, is defined as follows: A database D of N bits held by Bob is queried by a user Alice who is interested in the bit Db in such a way that (1) Alice learns Db and only Db and (2) Bob does not learn anything about Alice's choice b. While solutions to this problem in the classical domain rely largely on unproven computational complexity theoretic assumptions, it is also known that perfect solutions that guarantee both database and user privacy are impossible in the quantum domain. Jakobi [Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.83.022301 83, 022301 (2011)] proposed a protocol for oblivious transfer using well-known quantum key device (QKD) techniques to establish an oblivious key to solve this problem. Their solution provided a good degree of database and user privacy (using physical principles like the impossibility of perfectly distinguishing nonorthogonal quantum states and the impossibility of superluminal communication) while being loss-resistant and implementable with commercial QKD devices (due to the use of the Scarani-Acin-Ribordy-Gisin 2004 protocol). However, their quantum oblivious key distribution (QOKD) protocol requires a communication complexity of O(NlogN). Since modern databases can be extremely large, it is important to reduce this communication as much as possible. In this paper, we first suggest a modification of their protocol wherein the number of qubits that need to be exchanged is reduced to O(N). A subsequent generalization reduces the quantum communication complexity even further in such a way that only a few hundred qubits are needed to be transferred even for very large databases.
NASA Astrophysics Data System (ADS)
Wan, Zhiguo; Deng, Robert H.; Bao, Feng; Preneel, Bart
Although two-party password-authenticated key exchange (PAKE) protocols have been intensively studied in recent years, group PAKE protocols have received little attention. In this paper, we propose a hierarchical group PAKE protocol nPAKE + protocol under the setting where each party shares an independent password with a trusted server. The nPAKE + protocol is a novel combination of the hierarchical key tree structure and the password-based Diffie-Hellman exchange, and hence it achieves substantial gain in computation efficiency. In particular, the computation cost for each client in our protocol is only O(logn). Additionally, the hierarchical feature of nPAKE + enables every subgroup obtains their own subgroup key in the end. We also prove the security of our protocol under the random oracle model and the ideal cipher model.
Optimal eavesdropping on quantum key distribution without quantum memory
NASA Astrophysics Data System (ADS)
Bocquet, Aurélien; Alléaume, Romain; Leverrier, Anthony
2012-01-01
We consider the security of the BB84 (Bennett and Brassard 1984 Proc. IEEE Int. Conf. on Computers, Systems, and Signal Processing pp 175-9), six-state (Bruß 1998 Phys. Rev. Lett. http://dx.doi.org/10.1103/PhysRevLett.81.3018) and SARG04 (Scarani et al 2004 Phys. Rev. Lett. http://dx.doi.org/10.1103/PhysRevLett.92.057901) quantum key distribution protocols when the eavesdropper does not have access to a quantum memory. In this case, Eve’s most general strategy is to measure her ancilla with an appropriate positive operator-valued measure designed to take advantage of the post-measurement information that will be released during the sifting phase of the protocol. After an optimization on all the parameters accessible to Eve, our method provides us with new bounds for the security of six-state and SARG04 against a memoryless adversary. In particular, for the six-state protocol we show that the maximum quantum bit error ratio for which a secure key can be extracted is increased from 12.6% (for collective attacks) to 20.4% with the memoryless assumption.
Interactive identification protocol based on a quantum public-key cryptosystem
NASA Astrophysics Data System (ADS)
Wu, Chenmiao; Yang, Li
2014-11-01
We propose two interactive identification protocols based on a general construction of quantum public-key cryptosystem. Basic protocol contains set-up phase and authentication phase. Participants do operation with quantum computing of Boolean function in two-round transmission of authentication phase. Basic one only ensures completeness and soundness, but leaks information about private-key. We modify basic protocol with random string and random Boolean permutation. After modification, both transmitted states in two-round transmission can be proved to be ultimate mixed states. No participant or attacker will get useful information about private-key by measuring such states. Modified protocol achieves property of zero-knowledge.
Security of quantum key distribution using a simplified trusted relay
NASA Astrophysics Data System (ADS)
Stacey, William; Annabestani, Razieh; Ma, Xiongfeng; Lütkenhaus, Norbert
2015-01-01
We propose a QKD protocol for trusted node relays. Our protocol shifts the communication and computational weight of classical postprocessing to the end users by reassigning the roles of error correction and privacy amplification, while leaving the exchange of quantum signals untouched. We perform a security analysis for this protocol based on the Bennett-Brassard 1984 protocol on the level of infinite key formulas, taking into account weak coherent implementations involving decoy analysis.
Lu Hua; Fung, Chi-Hang Fred; Ma Xiongfeng; Cai Qingyu
2011-10-15
In a deterministic quantum key distribution (DQKD) protocol with a two-way quantum channel, Bob sends a qubit to Alice who then encodes a key bit onto the qubit and sends it back to Bob. After measuring the returned qubit, Bob can obtain Alice's key bit immediately, without basis reconciliation. Since an eavesdropper may attack the qubits traveling on either the Bob-Alice channel or the Alice-Bob channel, the security analysis of DQKD protocol with a two-way quantum channel is complicated and its unconditional security has been controversial. This paper presents a security proof of a single-photon four-state DQKD protocol against general attacks.
Quantum key distribution over probabilistic quantum repeaters
NASA Astrophysics Data System (ADS)
Amirloo, Jeyran; Razavi, Mohsen; Majedi, A. Hamed
2010-09-01
A feasible route toward implementing long-distance quantum key distribution (QKD) systems relies on probabilistic schemes for entanglement distribution and swapping as proposed in the work of Duan, Lukin, Cirac, and Zoller (DLCZ) [Nature (London)NATUAS0028-083610.1038/35106500 414, 413 (2001)]. Here, we calculate the conditional throughput and fidelity of entanglement for DLCZ quantum repeaters by accounting for the DLCZ self-purification property in the presence of multiple excitations in the ensemble memories as well as loss and other sources of inefficiency in the channel and measurement modules. We then use our results to find the generation rate of secure key bits for QKD systems that rely on DLCZ quantum repeaters. We compare the key generation rate per logical memory employed in the two cases with and without a repeater node. We find the crossover distance beyond which the repeater system outperforms the nonrepeater one. That provides us with the optimum internode distancing in quantum repeater systems. We also find the optimal excitation probability at which the QKD rate peaks. Such an optimum probability, in most regimes of interest, is insensitive to the total distance.
Finite-key security analyses on passive decoy-state QKD protocols with different unstable sources
Song, Ting-Ting; Qin, Su-Juan; Wen, Qiao-Yan; Wang, Yu-Kun; Jia, Heng-Yue
2015-01-01
In quantum communication, passive decoy-state QKD protocols can eliminate many side channels, but the protocols without any finite-key analyses are not suitable for in practice. The finite-key securities of passive decoy-state (PDS) QKD protocols with two different unstable sources, type-II parametric down-convention (PDC) and phase randomized weak coherent pulses (WCPs), are analyzed in our paper. According to the PDS QKD protocols, we establish an optimizing programming respectively and obtain the lower bounds of finite-key rates. Under some reasonable values of quantum setup parameters, the lower bounds of finite-key rates are simulated. The simulation results show that at different transmission distances, the affections of different fluctuations on key rates are different. Moreover, the PDS QKD protocol with an unstable PDC source can resist more intensity fluctuations and more statistical fluctuation. PMID:26471947
Finite-key security analyses on passive decoy-state QKD protocols with different unstable sources.
Song, Ting-Ting; Qin, Su-Juan; Wen, Qiao-Yan; Wang, Yu-Kun; Jia, Heng-Yue
2015-01-01
In quantum communication, passive decoy-state QKD protocols can eliminate many side channels, but the protocols without any finite-key analyses are not suitable for in practice. The finite-key securities of passive decoy-state (PDS) QKD protocols with two different unstable sources, type-II parametric down-convention (PDC) and phase randomized weak coherent pulses (WCPs), are analyzed in our paper. According to the PDS QKD protocols, we establish an optimizing programming respectively and obtain the lower bounds of finite-key rates. Under some reasonable values of quantum setup parameters, the lower bounds of finite-key rates are simulated. The simulation results show that at different transmission distances, the affections of different fluctuations on key rates are different. Moreover, the PDS QKD protocol with an unstable PDC source can resist more intensity fluctuations and more statistical fluctuation. PMID:26471947
Finite-key security analysis of quantum key distribution with imperfect light sources
NASA Astrophysics Data System (ADS)
Mizutani, Akihiro; Curty, Marcos; Lim, Charles Ci Wen; Imoto, Nobuyuki; Tamaki, Kiyoshi
2015-09-01
In recent years, the gap between theory and practice in quantum key distribution (QKD) has been significantly narrowed, particularly for QKD systems with arbitrarily flawed optical receivers. The status for QKD systems with imperfect light sources is however less satisfactory, in the sense that the resulting secure key rates are often overly dependent on the quality of state preparation. This is especially the case when the channel loss is high. Very recently, to overcome this limitation, Tamaki et al proposed a QKD protocol based on the so-called ‘rejected data analysis’, and showed that its security—in the limit of infinitely long keys—is almost independent of any encoding flaw in the qubit space, being this protocol compatible with the decoy state method. Here, as a step towards practical QKD, we show that a similar conclusion is reached in the finite-key regime, even when the intensity of the light source is unstable. More concretely, we derive security bounds for a wide class of realistic light sources and show that the bounds are also efficient in the presence of high channel loss. Our results strongly suggest the feasibility of long distance provably secure communication with imperfect light sources.
Detector-device-independent quantum key distribution
Lim, Charles Ci Wen; Korzh, Boris; Martin, Anthony; Bussières, Félix; Thew, Rob; Zbinden, Hugo
2014-12-01
Recently, a quantum key distribution (QKD) scheme based on entanglement swapping, called measurement-device-independent QKD (mdiQKD), was proposed to bypass all measurement side-channel attacks. While mdiQKD is conceptually elegant and offers a supreme level of security, the experimental complexity is challenging for practical systems. For instance, it requires interference between two widely separated independent single-photon sources, and the secret key rates are dependent on detecting two photons—one from each source. Here, we demonstrate a proof-of-principle experiment of a QKD scheme that removes the need for a two-photon system and instead uses the idea of a two-qubit single-photon to significantly simplify the implementation and improve the efficiency of mdiQKD in several aspects.
Measurement-device-independent quantum key distribution.
Lo, Hoi-Kwong; Curty, Marcos; Qi, Bing
2012-03-30
How to remove detector side channel attacks has been a notoriously hard problem in quantum cryptography. Here, we propose a simple solution to this problem--measurement-device-independent quantum key distribution (QKD). It not only removes all detector side channels, but also doubles the secure distance with conventional lasers. Our proposal can be implemented with standard optical components with low detection efficiency and highly lossy channels. In contrast to the previous solution of full device independent QKD, the realization of our idea does not require detectors of near unity detection efficiency in combination with a qubit amplifier (based on teleportation) or a quantum nondemolition measurement of the number of photons in a pulse. Furthermore, its key generation rate is many orders of magnitude higher than that based on full device independent QKD. The results show that long-distance quantum cryptography over say 200 km will remain secure even with seriously flawed detectors. PMID:22540686
Statistical Quadrature Evolution for Continuous-Variable Quantum Key Distribution
NASA Astrophysics Data System (ADS)
Gyongyosi, Laszlo; Imre, Sandor
2016-05-01
We propose a statistical quadrature evolution (SQE) method for multicarrier continuous-variable quantum key distribution (CVQKD). A multicarrier CVQKD protocol utilizes Gaussian subcarrier quantum continuous variables (CV) for information transmission. The SQE framework provides a minimal error estimate of the quadratures of the CV quantum states from the discrete, measured noisy subcarrier variables. We define a method for the statistical modeling and processing of noisy Gaussian subcarrier quadratures. We introduce the terms statistical secret key rate and statistical private classical information, which quantities are derived purely by the statistical functions of our method. We prove the secret key rate formulas for a multiple access multicarrier CVQKD. The framework can be established in an arbitrary CVQKD protocol and measurement setting, and are implementable by standard low-complexity statistical functions, which is particularly convenient for an experimental CVQKD scenario. This work was partially supported by the GOP-1.1.1-11-2012-0092 project sponsored by the EU and European Structural Fund, by the Hungarian Scientific Research Fund - OTKA K-112125, and by the COST Action MP1006.
Gaussian quadrature inference for continuous-variable quantum key distribution
NASA Astrophysics Data System (ADS)
Gyongyosi, L.; Imre, S.
2016-05-01
We propose the Gaussian quadrature inference (GQI) method for multicarrier continuous-variable quantum key distribution (CVQKD). A multicarrier CVQKD protocol utilizes Gaussian subcarrier quantum continuous variables (CV) for information transmission. The GQI framework provides a minimal error estimate of the quadratures of the CV quantum states from the discrete, measured noisy subcarrier variables. GQI utilizes the fundamentals of regularization theory and statistical information processing. We characterize GQI for multicarrier CVQKD, and define a method for the statistical modeling and processing of noisy Gaussian subcarrier quadratures. We demonstrate the results through the adaptive multicarrier quadrature division (AMQD) scheme. We introduce the terms statistical secret key rate and statistical private classical information, which quantities are derived purely by the statistical functions of GQI. We prove the secret key rate formulas for a multiple access multicarrier CVQKD via the AMQD-MQA (multiuser quadrature allocation) scheme. The framework can be established in an arbitrary CVQKD protocol and measurement setting, and are implementable by standard low-complexity statistical functions, which is particularly convenient for an experimental CVQKD scenario.
Measurement-device-independent entanglement-based quantum key distribution
NASA Astrophysics Data System (ADS)
Yang, Xiuqing; Wei, Kejin; Ma, Haiqiang; Sun, Shihai; Liu, Hongwei; Yin, Zhenqiang; Li, Zuohan; Lian, Shibin; Du, Yungang; Wu, Lingan
2016-05-01
We present a quantum key distribution protocol in a model in which the legitimate users gather statistics as in the measurement-device-independent entanglement witness to certify the sources and the measurement devices. We show that the task of measurement-device-independent quantum communication can be accomplished based on monogamy of entanglement, and it is fairly loss tolerate including source and detector flaws. We derive a tight bound for collective attacks on the Holevo information between the authorized parties and the eavesdropper. Then with this bound, the final secret key rate with the source flaws can be obtained. The results show that long-distance quantum cryptography over 144 km can be made secure using only standard threshold detectors.
Quantum key distribution session with 16-dimensional photonic states
NASA Astrophysics Data System (ADS)
Etcheverry, S.; Cañas, G.; Gómez, E. S.; Nogueira, W. A. T.; Saavedra, C.; Xavier, G. B.; Lima, G.
2013-07-01
The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD.
Quantum key distribution session with 16-dimensional photonic states.
Etcheverry, S; Cañas, G; Gómez, E S; Nogueira, W A T; Saavedra, C; Xavier, G B; Lima, G
2013-01-01
The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD. PMID:23897033
Trustworthiness of detectors in quantum key distribution with untrusted detectors
NASA Astrophysics Data System (ADS)
Qi, Bing
2015-02-01
Measurement-device-independent quantum key distribution (MDI-QKD) protocol has been demonstrated as a viable solution to detector side-channel attacks. Recently, to bridge the strong security of MDI-QKD with the high efficiency of conventional QKD, the detector-device-independent (DDI) QKD has been proposed. One crucial assumption made in DDI-QKD is that the untrusted Bell state measurement (BSM) located inside the receiver's laboratory cannot send any unwanted information to the outside. Here, we show that if the BSM is completely untrusted, a simple scheme would allow the BSM to send information to the outside. Combined with Trojan horse attacks, this scheme could allow an eavesdropper to gain information of the quantum key without being detected. To prevent the above attack, either countermeasures to Trojan horse attacks or some trustworthiness to the "untrusted" BSM device is required.
Implementations for device-independent quantum key distribution
NASA Astrophysics Data System (ADS)
Máttar, Alejandro; Acín, Antonio
2016-04-01
Device-independent quantum key distribution (DIQKD) generates a secret key among two parties in a provably secure way without making assumptions about the internal working of the devices used in the protocol. The main challenge for a DIQKD physical implementation is that the data observed among the two parties must violate a Bell inequality without fair-sampling, since otherwise the observed correlations can be faked with classical resources and security can no longer be guaranteed. In spite of the advances recently made to achieve higher detection efficiencies in Bell experiments, DIQKD remains experimentally difficult at long distances due to the exponential increase of loss in the channel separating the two parties. Here we describe and analyze plausible solutions to overcome the crucial problem of channel loss in the frame of DIQKD physical implementations.
Quantum key distribution session with 16-dimensional photonic states
Etcheverry, S.; Cañas, G.; Gómez, E. S.; Nogueira, W. A. T.; Saavedra, C.; Xavier, G. B.; Lima, G.
2013-01-01
The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD. PMID:23897033
Method for adding nodes to a quantum key distribution system
Grice, Warren P
2015-02-24
An improved quantum key distribution (QKD) system and method are provided. The system and method introduce new clients at intermediate points along a quantum channel, where any two clients can establish a secret key without the need for a secret meeting between the clients. The new clients perform operations on photons as they pass through nodes in the quantum channel, and participate in a non-secret protocol that is amended to include the new clients. The system and method significantly increase the number of clients that can be supported by a conventional QKD system, with only a modest increase in cost. The system and method are compatible with a variety of QKD schemes, including polarization, time-bin, continuous variable and entanglement QKD.
An efficient three-party password-based key agreement protocol using extended chaotic maps
NASA Astrophysics Data System (ADS)
Shu, Jian
2015-06-01
Three-party password-based key agreement protocols allow two users to authenticate each other via a public channel and establish a session key with the aid of a trusted server. Recently, Farash et al. [Farash M S, Attari M A 2014 “An efficient and provably secure three-party password-based authenticated key exchange protocol based on Chebyshev chaotic maps”, Nonlinear Dynamics 77(7): 399-411] proposed a three-party key agreement protocol by using the extended chaotic maps. They claimed that their protocol could achieve strong security. In the present paper, we analyze Farash et al.’s protocol and point out that this protocol is vulnerable to off-line password guessing attack and suffers communication burden. To handle the issue, we propose an efficient three-party password-based key agreement protocol using extended chaotic maps, which uses neither symmetric cryptosystems nor the server’s public key. Compared with the relevant schemes, our protocol provides better performance in terms of computation and communication. Therefore, it is suitable for practical applications. Project supported by the National Natural Science Foundation of China (Grant No. 61462033).
Protocols of quantum key agreement solely using Bell states and Bell measurement
NASA Astrophysics Data System (ADS)
Shukla, Chitra; Alam, Nasir; Pathak, Anirban
2014-07-01
Two protocols of quantum key agreement (QKA) that solely use Bell state and Bell measurement 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. The proposed protocols are also generalized to implement QKA using a set of multi-partite entangled states (e.g., 4-qubit cluster state and Ω state). Security of these protocols arises from the 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 communication can be modified to implement protocols of QKA.
An XML-Based Protocol for Distributed Event Services
NASA Technical Reports Server (NTRS)
Smith, Warren; Gunter, Dan; Quesnel, Darcy; Biegel, Bryan (Technical Monitor)
2001-01-01
A recent trend in distributed computing is the construction of high-performance distributed systems called computational grids. One difficulty we have encountered is that there is no standard format for the representation of performance information and no standard protocol for transmitting this information. This limits the types of performance analysis that can be undertaken in complex distributed systems. To address this problem, we present an XML-based protocol for transmitting performance events in distributed systems and evaluate the performance of this protocol.
An XML-based protocol for distributed event services
Gunter, Dan K.; Smith, Warren; Quesnel, Darcy
2001-06-25
A recent trend in distributed computing is the construction of high-performance distributed systems called computational grids. One difficulty we have encountered is that there is no standard format for the representation of performance information and no standard protocol for transmitting this information. This limits the types of performance analysis that can be undertaken in complex distributed systems. To address this problem, we present an XML-based protocol for transmitting performance events in distributed systems and evaluate the performance of this protocol.
Security improvement on an anonymous key agreement protocol based on chaotic maps
NASA Astrophysics Data System (ADS)
Xue, Kaiping; Hong, Peilin
2012-07-01
In 2009, Tseng et al. proposed a password sharing and chaotic map based key agreement protocol (Tseng et al.'s protocol). They claimed that the protocol provided mutual authentication between a server and a user, and allowed the user to anonymously interact with the server to establish a shared session key. However, in 2011, Niu et al. have proved that Tseng et al.'s protocol cannot guarantee user anonymity and protocol security when there is an internal adversary who is a legitimate user. Also it cannot provide perfect forward secrecy. Then Niu et al. introduced a trust third party (TTP) into their protocol designing (Niu et al.'s protocol). But according to our research, Niu et al.'s protocol is found to have several unsatisfactory drawbacks. Based on reconsidering Tseng et al.'s protocol without introducing TTP, we give some improvements to meet the original security and performance requirements. Meanwhile our proposed protocol overcomes the security flaws of Tseng et al.'s protocol.
Quantum key distribution with untrusted detectors
NASA Astrophysics Data System (ADS)
González, P.; Rebón, L.; Ferreira da Silva, T.; Figueroa, M.; Saavedra, C.; Curty, M.; Lima, G.; Xavier, G. B.; Nogueira, W. A. T.
2015-08-01
Side-channel attacks currently constitute the main challenge for quantum key distribution (QKD) to bridge theory with practice. So far two main approaches have been introduced to address this problem, (full) device-independent QKD and measurement-device-independent QKD. Here we present a third solution that might exceed the performance and practicality of the previous two in circumventing detector side-channel attacks, which arguably is the most hazardous part of QKD implementations. Our proposal has, however, one main requirement: the legitimate users of the system need to ensure that their labs do not leak any unwanted information to the outside. The security in the low-loss regime is guaranteed, while in the high-loss regime we already prove its robustness against some eavesdropping strategies.
NASA Astrophysics Data System (ADS)
Jeng, Albert; Chang, Li-Chung; Chen, Sheng-Hui
There are many protocols proposed for protecting Radio Frequency Identification (RFID) system privacy and security. A number of these protocols are designed for protecting long-term security of RFID system using symmetric key or public key cryptosystem. Others are designed for protecting user anonymity and privacy. In practice, the use of RFID technology often has a short lifespan, such as commodity check out, supply chain management and so on. Furthermore, we know that designing a long-term security architecture to protect the security and privacy of RFID tags information requires a thorough consideration from many different aspects. However, any security enhancement on RFID technology will jack up its cost which may be detrimental to its widespread deployment. Due to the severe constraints of RFID tag resources (e. g., power source, computing power, communication bandwidth) and open air communication nature of RFID usage, it is a great challenge to secure a typical RFID system. For example, computational heavy public key and symmetric key cryptography algorithms (e. g., RSA and AES) may not be suitable or over-killed to protect RFID security or privacy. These factors motivate us to research an efficient and cost effective solution for RFID security and privacy protection. In this paper, we propose a new effective generic binary tree based key agreement protocol (called BKAP) and its variations, and show how it can be applied to secure the low cost and resource constraint RFID system. This BKAP is not a general purpose key agreement protocol rather it is a special purpose protocol to protect privacy, un-traceability and anonymity in a single RFID closed system domain.
Public/private key certification authority and key distribution. Draft
Long, J.P.; Christensen, M.J.; Sturtevant, A.P.; Johnston, W.E.
1995-09-25
Traditional encryption, which protects messages from prying eyes, has been used for many decades. The present concepts of encryption are built from that heritage. Utilization of modern software-based encryption techniques implies much more than simply converting files to an unreadable form. Ubiquitous use of computers and advances in encryption technology coupled with the use of wide-area networking completely changed the reasons for utilizing encryption technology. The technology demands a new and extensive infrastructure to support these functions. Full understanding of these functions, their utility and value, and the need for an infrastructure, takes extensive exposure to the new paradigm. This paper addresses issues surrounding the establishment and operation of a key management system (i.e., certification authority) that is essential to the successful implementation and wide-spread use of encryption.
An Improved RSA Based User Authentication and Session Key Agreement Protocol Usable in TMIS.
Amin, Ruhul; Biswas, G P
2015-08-01
Recently, Giri et al.'s proposed a RSA cryptosystem based remote user authentication scheme for telecare medical information system and claimed that the protocol is secure against all the relevant security attacks. However, we have scrutinized the Giri et al.'s protocol and pointed out that the protocol is not secure against off-line password guessing attack, privileged insider attack and also suffers from anonymity problem. Moreover, the extension of password guessing attack leads to more security weaknesses. Therefore, this protocol needs improvement in terms of security before implementing in real-life application. To fix the mentioned security pitfalls, this paper proposes an improved scheme over Giri et al.'s scheme, which preserves user anonymity property. We have then simulated the proposed protocol using widely-accepted AVISPA tool which ensures that the protocol is SAFE under OFMC and CL-AtSe models, that means the same protocol is secure against active and passive attacks including replay and man-in-the-middle attacks. The informal cryptanalysis has been also presented, which confirmed that the proposed protocol provides well security protection on the relevant security attacks. The performance analysis section compares the proposed protocol with other existing protocols in terms of security and it has been observed that the protocol provides more security and achieves additional functionalities such as user anonymity and session key verification. PMID:26123833
Experimental Passive Round-Robin Differential Phase-Shift Quantum Key Distribution
NASA Astrophysics Data System (ADS)
Guan, Jian-Yu; Cao, Zhu; Liu, Yang; Shen-Tu, Guo-Liang; Pelc, Jason S.; Fejer, M. M.; Peng, Cheng-Zhi; Ma, Xiongfeng; Zhang, Qiang; Pan, Jian-Wei
2015-05-01
In quantum key distribution (QKD), the bit error rate is used to estimate the information leakage and hence determines the amount of privacy amplification—making the final key private by shortening the key. In general, there exists a threshold of the error rate for each scheme, above which no secure key can be generated. This threshold puts a restriction on the environment noises. For example, a widely used QKD protocol, the Bennett-Brassard protocol, cannot tolerate error rates beyond 25%. A new protocol, round-robin differential phase-shifted (RRDPS) QKD, essentially removes this restriction and can in principle tolerate more environment disturbance. Here, we propose and experimentally demonstrate a passive RRDPS QKD scheme. In particular, our 500 MHz passive RRDPS QKD system is able to generate a secure key over 50 km with a bit error rate as high as 29%. This scheme should find its applications in noisy environment conditions.
Wu, Tsu-Yang; Tsai, Tung-Tso; Tseng, Yuh-Min
2014-01-01
The existence of malicious participants is a major threat for authenticated group key exchange (AGKE) protocols. Typically, there are two detecting ways (passive and active) to resist malicious participants in AGKE protocols. In 2012, the revocable identity- (ID-) based public key system (R-IDPKS) was proposed to solve the revocation problem in the ID-based public key system (IDPKS). Afterwards, based on the R-IDPKS, Wu et al. proposed a revocable ID-based AGKE (RID-AGKE) protocol, which adopted a passive detecting way to resist malicious participants. However, it needs three rounds and cannot identify malicious participants. In this paper, we fuse a noninteractive confirmed computation technique to propose the first two-round RID-AGKE protocol with identifying malicious participants, which is an active detecting way. We demonstrate that our protocol is a provably secure AGKE protocol with forward secrecy and can identify malicious participants. When compared with the recently proposed ID/RID-AGKE protocols, our protocol possesses better performance and more robust security properties. PMID:24991641
Tsai, Tung-Tso
2014-01-01
The existence of malicious participants is a major threat for authenticated group key exchange (AGKE) protocols. Typically, there are two detecting ways (passive and active) to resist malicious participants in AGKE protocols. In 2012, the revocable identity- (ID-) based public key system (R-IDPKS) was proposed to solve the revocation problem in the ID-based public key system (IDPKS). Afterwards, based on the R-IDPKS, Wu et al. proposed a revocable ID-based AGKE (RID-AGKE) protocol, which adopted a passive detecting way to resist malicious participants. However, it needs three rounds and cannot identify malicious participants. In this paper, we fuse a noninteractive confirmed computation technique to propose the first two-round RID-AGKE protocol with identifying malicious participants, which is an active detecting way. We demonstrate that our protocol is a provably secure AGKE protocol with forward secrecy and can identify malicious participants. When compared with the recently proposed ID/RID-AGKE protocols, our protocol possesses better performance and more robust security properties. PMID:24991641
NASA Astrophysics Data System (ADS)
Nagamatsu, Yuichi; Mizutani, Akihiro; Ikuta, Rikizo; Yamamoto, Takashi; Imoto, Nobuyuki; Tamaki, Kiyoshi
2016-04-01
Although quantum key distribution (QKD) is theoretically secure, there is a gap between the theory and practice. In fact, real-life QKD may not be secure because component devices in QKD systems may deviate from the theoretical models assumed in security proofs. To solve this problem, it is necessary to construct the security proof under realistic assumptions on the source and measurement unit. In this paper, we prove the security of a QKD protocol under practical assumptions on the source that accommodate fluctuation of the phase and intensity modulations. As long as our assumptions hold, it does not matter at all how the phase and intensity distribute or whether or not their distributions over different pulses are independently and identically distributed. Our work shows that practical sources can be safely employed in QKD experiments.
Estimation of output-channel noise for continuous-variable quantum key distribution
NASA Astrophysics Data System (ADS)
Thearle, Oliver; Assad, Syed M.; Symul, Thomas
2016-04-01
Estimation of channel parameters is important for extending the range and increasing the key rate of continuous-variable quantum key distribution protocols. We propose an estimator for the channel noise parameter based on the method-of-moments. The method-of-moments finds an estimator from the moments of the output distribution of the protocol. This estimator has the advantage of being able to use all of the states shared between Alice and Bob. Other estimators are limited to a smaller publicly revealed subset of the states. The proposed estimator has a lower variance for the high-loss channel than what has previously been proposed. We show that the method-of-moments estimator increases the key rate by up to an order of magnitude at the maximum transmission of the protocol.
A Secure Three-Factor User Authentication and Key Agreement Protocol for TMIS With User Anonymity.
Amin, Ruhul; Biswas, G P
2015-08-01
Telecare medical information system (TMIS) makes an efficient and convenient connection between patient(s)/user(s) and doctor(s) over the insecure internet. Therefore, data security, privacy and user authentication are enormously important for accessing important medical data over insecure communication. Recently, many user authentication protocols for TMIS have been proposed in the literature and it has been observed that most of the protocols cannot achieve complete security requirements. In this paper, we have scrutinized two (Mishra et al., Xu et al.) remote user authentication protocols using smart card and explained that both the protocols are suffering against several security weaknesses. We have then presented three-factor user authentication and key agreement protocol usable for TMIS, which fix the security pitfalls of the above mentioned schemes. The informal cryptanalysis makes certain that the proposed protocol provides well security protection on the relevant security attacks. Furthermore, the simulator AVISPA tool confirms that the protocol is secure against active and passive attacks including replay and man-in-the-middle attacks. The security functionalities and performance comparison analysis confirm that our protocol not only provide strong protection on security attacks, but it also achieves better complexities along with efficient login and password change phase as well as session key verification property. PMID:26112322
Distributed reservation control protocols for random access broadcasting channels
NASA Technical Reports Server (NTRS)
Greene, E. P.; Ephremides, A.
1981-01-01
Attention is given to a communication network consisting of an arbitrary number of nodes which can communicate with each other via a time-division multiple access (TDMA) broadcast channel. The reported investigation is concerned with the development of efficient distributed multiple access protocols for traffic consisting primarily of single packet messages in a datagram mode of operation. The motivation for the design of the protocols came from the consideration of efficient multiple access utilization of moderate to high bandwidth (4-40 Mbit/s capacity) communication satellite channels used for the transmission of short (1000-10,000 bits) fixed length packets. Under these circumstances, the ratio of roundtrip propagation time to packet transmission time is between 100 to 10,000. It is shown how a TDMA channel can be adaptively shared by datagram traffic and constant bandwidth users such as in digital voice applications. The distributed reservation control protocols described are a hybrid between contention and reservation protocols.
NASA Astrophysics Data System (ADS)
Antou, Guy; Montavon, Ghislain
2007-06-01
This commentary aims at presenting, from a practical viewpoint, some key points to assess when implementing image analysis coupled to stereological protocols to quantify statistically the architecture of thermal spray coatings and their relevant features (pores, lamellae, and so forth.). This article is the second of a two-part commentary; the first one, published in Journal of Thermal Spray Technology, Vol 16 (No. 1), 2007, detailed those stereological protocols from a historical perspective.
A Scenario-Based Protocol Checker for Public-Key Authentication Scheme
NASA Astrophysics Data System (ADS)
Saito, Takamichi
Security protocol provides communication security for the internet. One of the important features of it is authentication with key exchange. Its correctness is a requirement of the whole of the communication security. In this paper, we introduce three attack models realized as their attack scenarios, and provide an authentication-protocol checker for applying three attack-scenarios based on the models. We also utilize it to check two popular security protocols: Secure SHell (SSH) and Secure Socket Layer/Transport Layer Security (SSL/TLS).
Design and Verification of a Distributed Communication Protocol
NASA Technical Reports Server (NTRS)
Munoz, Cesar A.; Goodloe, Alwyn E.
2009-01-01
The safety of remotely operated vehicles depends on the correctness of the distributed protocol that facilitates the communication between the vehicle and the operator. A failure in this communication can result in catastrophic loss of the vehicle. To complicate matters, the communication system may be required to satisfy several, possibly conflicting, requirements. The design of protocols is typically an informal process based on successive iterations of a prototype implementation. Yet distributed protocols are notoriously difficult to get correct using such informal techniques. We present a formal specification of the design of a distributed protocol intended for use in a remotely operated vehicle, which is built from the composition of several simpler protocols. We demonstrate proof strategies that allow us to prove properties of each component protocol individually while ensuring that the property is preserved in the composition forming the entire system. Given that designs are likely to evolve as additional requirements emerge, we show how we have automated most of the repetitive proof steps to enable verification of rapidly changing designs.
Low cost and compact quantum key distribution
NASA Astrophysics Data System (ADS)
Duligall, J. L.; Godfrey, M. S.; Harrison, K. A.; Munro, W. J.; Rarity, J. G.
2006-10-01
We present the design of a novel free-space quantum cryptography system, complete with purpose-built software, that can operate in daylight conditions. The transmitter and receiver modules are built using inexpensive off-the-shelf components. Both modules are compact allowing the generation of renewed shared secrets on demand over a short range of a few metres. An analysis of the software is shown as well as results of error rates and therefore shared secret yields at varying background light levels. As the system is designed to eventually work in short-range consumer applications, we also present a use scenario where the consumer can regularly 'top up' a store of secrets for use in a variety of one-time-pad (OTP) and authentication protocols.
Eigenchannel decomposition for continuous-variable quantum key distribution
NASA Astrophysics Data System (ADS)
Gyongyosi, L.; Imre, S.
2015-03-01
We develop a singular layer transmission model for continuous-variable quantum key distribution (CVQKD). In CVQKD, the transmit information is carried by continuous-variable (CV) quantum states, particularly by Gaussian random distributed position and momentum quadratures. The reliable transmission of the quadrature components over a noisy link is a cornerstone of CVQKD protocols. The proposed singular layer uses the singular value decomposition of the Gaussian quantum channel, which yields an additional degree of freedom for the phase space transmission. This additional degree of freedom can further be exploited in a multiple-access scenario. The singular layer defines the eigenchannels of the Gaussian physical link, which can be used for the simultaneous reliable transmission of multiple user data streams. We demonstrate the results through the adaptive multicarrier quadrature division-multiuser quadrature allocation (AMQD-MQA) CVQKD multiple-access scheme. We define the singular model of AMQD-MQA and characterize the properties of the eigenchannel interference. The singular layer transmission provides improved simultaneous transmission rates for the users with unconditional security in a multiple-access scenario, particularly in crucial low signal-to-noise ratio regimes.
Security of two-way continuous-variable quantum key distribution with source noise
NASA Astrophysics Data System (ADS)
Wang, Tianyi; Yu, Song; Zhang, Yi-Chen; Gu, Wanyi; Guo, Hong
2014-11-01
We investigate the security of reverse reconciliation two-way continuous-variable quantum key distribution with source noise at both legitimate sides. Because the source noise originates from imperfect devices, we ascribe it to the legitimate sides rather than the eavesdropper. The trusted model consists of a thermal noise injected into a beam splitter. The expressions of secret key rate are derived against collective entangling cloner attacks for homodyne and heterodyne detections. Simulation results show that by applying the trusted model, the security bound of the reverse reconciliation two-way protocols can be tightened, while the advantage over one-way protocols still maintains.
Performance Improvement of Two-way Quantum Key Distribution by Using a Heralded Noiseless Amplifier
NASA Astrophysics Data System (ADS)
Li, Chenyang; Miao, Ruihang; Gong, Xinbao; Guo, Ying; He, Guangqiang
2016-04-01
We show the successful use of a heralded noiseless linear amplifier on the detection stage in the two-way continuous-variable quantum key distribution to improve the performance. Due to the excess noise, the secret-key rate of the two-way protocol becomes negative for a certain distance of transmission. The use of a heralded noiseless linear amplifier increases this distance by the equivalent of 20 log10 g dB of losses, and it also helps the two-way protocol tolerate more excess noise.
NASA Astrophysics Data System (ADS)
Woodhead, Erik
2014-08-01
Local randomization is a preprocessing procedure in which one of the legitimate parties of a quantum key distribution (QKD) scheme adds noise to their version of the key and was found by Kraus et al. [Phys. Rev. Lett. 95, 080501 (2005), 10.1103/PhysRevLett.95.080501] to improve the security of certain QKD protocols. In this article, the improvement yielded by local randomization is derived for an imperfect implementation of the Bennett-Brassard 1984 (BB84) QKD protocol, in which the source emits four given but arbitrary pure states and the detector performs arbitrarily aligned measurements. Specifically, this is achieved by modifying an approach to analyzing the security of imperfect variants of the BB84 protocol against collective attacks, introduced in [Phys. Rev. A 88, 012331 (2013), 10.1103/PhysRevA.88.012331], to include the additional preprocessing step. The previously known improvement to the threshold channel noise, from 11% to 12.41%, is recovered in the special case of an ideal BB84 implementation and becomes more pronounced in the case of a nonideal source. Finally, the bound derived for the asymptotic key rate, both with and without local randomization, is shown to be tight with the particular source characterization used. This is demonstrated by the explicit construction of a family of source states and optimal attacks for which the key-rate bound is attained with equality.
Subcarrier Wave Quantum Key Distribution in Telecommunication Network with Bitrate 800 kbit/s
NASA Astrophysics Data System (ADS)
Gleim, A. V.; Nazarov, Yu. V.; Egorov, V. I.; Smirnov, S. V.; Bannik, O. I.; Chistyakov, V. V.; Kynev, S. M.; Anisimov, A. A.; Kozlov, S. A.; Vasiliev, V. N.
2015-09-01
In the course of work on creating the first quantum communication network in Russia we demonstrated quantum key distribution in metropolitan optical network infrastructure. A single-pass subcarrier wave quantum cryptography scheme was used in the experiments. BB84 protocol with strong reference was chosen for performing key distribution. The registered sifted key rate in an optical cable with 1.5 dB loss was 800 Kbit/s. Signal visibility exceeded 98%, and quantum bit error rate value was 1%. The achieved result is a record for this type of systems.
Four-state quantum key distribution exploiting maximum mutual information measurement strategy
NASA Astrophysics Data System (ADS)
Chen, Dong-Xu; Zhang, Pei; Li, Hong-Rong; Gao, Hong; Li, Fu-Li
2016-02-01
We propose a four-state quantum key distribution (QKD) scheme using generalized measurement of nonorthogonal states, the maximum mutual information measurement strategy. Then, we analyze the eavesdropping process in intercept-resend and photon number splitting attack scenes. Our analysis shows that in the intercept-resend and photon number splitting attack eavesdropping scenes, our scheme is more secure than BB84 protocol and has higher key generation rate which may be applied to high-density QKD.
``Plug and play'' quantum key distribution system with differential phase shift
NASA Astrophysics Data System (ADS)
Zhou, Chunyuan; Wu, Guang; Chen, Xiuliang; Zeng, Heping
2003-09-01
We propose a "plug and play" scheme for the long-distance fiber-based cryptosystem based on the differential phase shift quantum key distribution, where any birefringence effects and polarization-dependent losses in the transmission fiber are automatically compensated by using a Faraday mirror. This system not only has stable performance but also creates keys 8/3 times more efficiently than the conventional cryptosystem based on the BB84 protocol.
Quantum Key Distribution Based on Interferometry and Interaction-Free Measurement
NASA Astrophysics Data System (ADS)
Li, Yan-Bing; Xu, Sheng-Wei; Wang, Qing-Le; Liu, Fang; Wan, Zong-Jie
2016-01-01
We propose a quantum key distribution based on Mach-Zehnder (MZ) interferometry and interaction-free measurement on single photon. The raw key comes from the photons on which MZ interferometry happened. And the interaction-free measurements are used to detect eavesdroppers. The analysis indicates that the protocol is secure, and can prevent some familiar attacks, such as photon number splitting (PNS) attack. This scheme is easy to be realized in current experiments.
Practical round-robin differential phase-shift quantum key distribution.
Zhang, Ying-Ying; Bao, Wan-Su; Zhou, Chun; Li, Hong-Wei; Wang, Yang; Jiang, Mu-Sheng
2016-09-01
Recently, a novel protocol named round-robin differential phase-shift (RRDPS) quantum key distribution [Nature 509, 475(2014)] has been proposed. It can estimate information leakage without monitoring bit error rate. In this paper, we study the performance of RRDPS using heralded single photon source (HSPS) without and with decoy-state method, then compare it with the performance of weak coherent pulses (WCPs). From numerical simulation, we can see that HSPS performs better especially for shorter packet and higher bit error rate. Moreover, we propose a general theory of decoy-state method for RRDPS protocol based on only three decoy states and one signal state. Taking WCPs as an example, the three-intensity decoy-state protocol can distribute secret keys over a distance of 128 km when the length of pulses packet is 32, which confirms great practical interest of our method. PMID:27607679
Finite-size analysis of a continuous-variable quantum key distribution
Leverrier, Anthony; Grangier, Philippe
2010-06-15
The goal of this paper is to extend the framework of finite-size analysis recently developed for quantum key distribution to continuous-variable protocols. We do not solve this problem completely here, and we mainly consider the finite-size effects on the parameter estimation procedure. Despite the fact that some questions are left open, we are able to give an estimation of the secret key rate for protocols which do not contain a postselection procedure. As expected, these results are significantly more pessimistic than those obtained in the asymptotic regime. However, we show that recent continuous-variable protocols are able to provide fully secure secret keys in the finite-size scenario, over distances larger than 50 km.
Quantum key distribution using continuous-variable non-Gaussian states
NASA Astrophysics Data System (ADS)
Borelli, L. F. M.; Aguiar, L. S.; Roversi, J. A.; Vidiella-Barranco, A.
2016-02-01
In this work, we present a quantum key distribution protocol using continuous-variable non-Gaussian states, homodyne detection and post-selection. The employed signal states are the photon added then subtracted coherent states (PASCS) in which one photon is added and subsequently one photon is subtracted from the field. We analyze the performance of our protocol, compared with a coherent state-based protocol, for two different attacks that could be carried out by the eavesdropper (Eve). We calculate the secret key rate transmission in a lossy line for a superior channel (beam-splitter) attack, and we show that we may increase the secret key generation rate by using the non-Gaussian PASCS rather than coherent states. We also consider the simultaneous quadrature measurement (intercept-resend) attack, and we show that the efficiency of Eve's attack is substantially reduced if PASCS are used as signal states.
Secure key-exchange protocol with an absence of injective functions.
Mislovaty, R; Perchenok, Y; Kanter, I; Kinzel, W
2002-12-01
The security of neural cryptography is investigated. A key-exchange protocol over a public channel is studied where the parties exchanging secret messages use multilayer neural networks which are trained by their mutual output bits and synchronize to a time dependent secret key. The weights of the networks have integer values between +/-L. Recently an algorithm for an eavesdropper which could break the key was introduced by [A. Shamir, A. Mityagin, and A. Klimov, Ramp Session (Eurocrypt, Amsterdam, 2002)]. We show that the synchronization time increases with L2 while the probability to find a successful attacker decreases exponentially with L. Hence for large L we find a secure key-exchange protocol which depends neither on number theory nor on injective trapdoor functions used in conventional cryptography. PMID:12513342
Making the decoy-state measurement-device-independent quantum key distribution practically useful
NASA Astrophysics Data System (ADS)
Zhou, Yi-Heng; Yu, Zong-Wen; Wang, Xiang-Bin
2016-04-01
The relatively low key rate seems to be the major barrier to its practical use for the decoy-state measurement-device-independent quantum key distribution (MDI-QKD). We present a four-intensity protocol for the decoy-state MDI-QKD that hugely raises the key rate, especially in the case in which the total data size is not large. Also, calculations show that our method makes it possible for secure private communication with fresh keys generated from MDI-QKD with a delay time of only a few seconds.
Performance of device-independent quantum key distribution
NASA Astrophysics Data System (ADS)
Cao, Zhu; Zhao, Qi; Ma, Xiongfeng
2016-07-01
Quantum key distribution provides information-theoretically-secure communication. In practice, device imperfections may jeopardise the system security. Device-independent quantum key distribution solves this problem by providing secure keys even when the quantum devices are untrusted and uncharacterized. Following a recent security proof of the device-independent quantum key distribution, we improve the key rate by tightening the parameter choice in the security proof. In practice where the system is lossy, we further improve the key rate by taking into account the loss position information. From our numerical simulation, our method can outperform existing results. Meanwhile, we outline clear experimental requirements for implementing device-independent quantum key distribution. The maximal tolerable error rate is 1.6%, the minimal required transmittance is 97.3%, and the minimal required visibility is 96.8 % .
An XML-Based Protocol for Distributed Event Services
NASA Technical Reports Server (NTRS)
Smith, Warren; Gunter, Dan; Quesnel, Darcy; Biegel, Bryan (Technical Monitor)
2001-01-01
This viewgraph presentation provides information on the application of an XML (extensible mark-up language)-based protocol to the developing field of distributed processing by way of a computational grid which resembles an electric power grid. XML tags would be used to transmit events between the participants of a transaction, namely, the consumer and the producer of the grid scheme.
NASA Astrophysics Data System (ADS)
Walenta, N.; Burg, A.; Caselunghe, D.; Constantin, J.; Gisin, N.; Guinnard, O.; Houlmann, R.; Junod, P.; Korzh, B.; Kulesza, N.; Legré, M.; Lim, C. W.; Lunghi, T.; Monat, L.; Portmann, C.; Soucarros, M.; Thew, R. T.; Trinkler, P.; Trolliet, G.; Vannel, F.; Zbinden, H.
2014-01-01
We present a compactly integrated, 625 MHz clocked coherent one-way quantum key distribution system which continuously distributes secret keys over an optical fibre link. To support high secret key rates, we implemented a fast hardware key distillation engine which allows for key distillation rates up to 4 Mbps in real time. The system employs wavelength multiplexing in order to run over only a single optical fibre. Using fast gated InGaAs single photon detectors, we reliably distribute secret keys with a rate above 21 kbps over 25 km of optical fibre. We optimized the system considering a security analysis that respects finite-key-size effects, authentication costs and system errors for a security parameter of ɛQKD = 4 × 10-9.
Faked state attacks on realistic round robin DPS quantum key distribution systems and countermeasure
NASA Astrophysics Data System (ADS)
Iwakoshi, T.
2015-05-01
In May 2014, a new quantum key distribution protocol named "Round Robin Differential-Phase-Shift Quantum Key Distribution (RR DPS QKD)" was proposed. It has a special feature that the key consumption via privacy amplification is a small constant because RR DPS QKD guarantees its security by information causality, not by information-disturbance trade-off. Therefore, the authors claimed that RR DPS QKD systems does not need to monitor the disturbance by an attacker in the quantum channel. However, this study shows that a modified Faked-State Attack (or so-called bright illumination attack) can hack a RR DPS QKD system almost perfectly if it is implemented with realistic detectors even information-causality guarantees the security of RR DPS QKD protocol. Therefore, this study also proposes a possible Measurement-Device-Independent RR DPS QKD system to avoid the modified Faked-State Attack.
Quantum hacking of a continuous-variable quantum-key-distribution system using a wavelength attack
NASA Astrophysics Data System (ADS)
Huang, Jing-Zheng; Weedbrook, Christian; Yin, Zhen-Qiang; Wang, Shuang; Li, Hong-Wei; Chen, Wei; Guo, Guang-Can; Han, Zheng-Fu
2013-06-01
The security proofs of continuous-variable quantum key distribution are based on the assumptions that the eavesdropper can neither act on the local oscillator nor control Bob's beam splitter. These assumptions may be invalid in practice due to potential imperfections in the implementations of such protocols. In this paper, we consider the problem of transmitting the local oscillator in a public channel and propose a wavelength attack which allows the eavesdropper to control the intensity transmission of Bob's beam splitter by switching the wavelength of the input light. Specifically we target continuous-variable quantum key distribution systems that use the heterodyne detection protocol using either direct or reverse reconciliation. Our attack is proved to be feasible and renders all of the final keys shared between the legitimate parties insecure, even if they have monitored the intensity of the local oscillator. To prevent our attack on commercial systems, a simple wavelength filter should be randomly added before performing monitoring detection.
Islam, S K Hafizul; Khan, Muhammad Khurram
2014-10-01
Recently, many authentication protocols have been presented using smartcard for the telecare medicine information system (TMIS). In 2014, Xu et al. put forward a two-factor mutual authentication with key agreement protocol using elliptic curve cryptography (ECC). However, the authors have proved that the protocol is not appropriate for practical use as it has many problems (1) it fails to achieve strong authentication in login and authentication phases; (2) it fails to update the password correctly in the password change phase; (3) it fails to provide the revocation of lost/stolen smartcard; and (4) it fails to protect the strong replay attack. We then devised an anonymous and provably secure two-factor authentication protocol based on ECC. Our protocol is analyzed with the random oracle model and demonstrated to be formally secured against the hardness assumption of computational Diffie-Hellman problem. The performance evaluation demonstrated that our protocol outperforms from the perspective of security, functionality and computation costs over other existing designs. PMID:25190590
Shor-Preskill-type security proof for quantum key distribution without public announcement of bases
Hwang, Won-Young; Wang Xiangbin; Matsumoto, Keiji; Kim, Jaewan; Lee, Hai-Woong
2003-01-01
We give a Shor-Preskill-type security proof to quantum key distribution without public announcement of bases [W.Y. Hwang et al., Phys. Lett. A 244, 489 (1998)]. First, we modify the Lo-Chau protocol once more so that it finally reduces to the quantum key distribution without public announcement of bases. Then we show how we can estimate the error rate in the code bits based on that in the checked bits in the proposed protocol, which is the central point of the proof. We discuss the problem of imperfect sources and that of large deviation in the error rate distributions. We discuss when the bases sequence must be discarded.
Photon-monitoring attack on continuous-variable quantum key distribution with source in middle
NASA Astrophysics Data System (ADS)
Wang, Yijun; Huang, Peng; Guo, Ying; Huang, Dazu
2014-12-01
Motivated by a fact that the non-Gaussian operation may increase entanglement of an entangled system, we suggest a photon-monitoring attack strategy in the entanglement-based (EB) continuous-variable quantum key distribution (CVQKD) using the photon subtraction operations, where the entangled source originates from the center instead of one of the legal participants. It shows that an eavesdropper, Eve, can steal large information from participants after intercepting the partial beams with the photon-monitoring attach strategy. The structure of the proposed CVQKD protocol is useful in simply analyzing how quantum loss in imperfect channels can decrease the performance of the CVQKD protocol. The proposed attack strategy can be implemented under current technology, where a newly developed and versatile no-Gaussian operation can be well employed with the entangled source in middle in order to access to mass information in the EB CVQKD protocol, as well as in the prepare-and-measure (PM) CVQKD protocol.
Distributed Dynamic Host Configuration Protocol (D2HCP).
Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez
2011-01-01
Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment. PMID:22163856
Distributed Dynamic Host Configuration Protocol (D2HCP)
Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez
2011-01-01
Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment. PMID:22163856
Continuous operation of high bit rate quantum key distribution
NASA Astrophysics Data System (ADS)
Dixon, A. R.; Yuan, Z. L.; Dynes, J. F.; Sharpe, A. W.; Shields, A. J.
2010-04-01
We demonstrate a quantum key distribution with a secure bit rate exceeding 1 Mbit/s over 50 km fiber averaged over a continuous 36 h period. Continuous operation of high bit rates is achieved using feedback systems to control path length difference and polarization in the interferometer and the timing of the detection windows. High bit rates and continuous operation allows finite key size effects to be strongly reduced, achieving a key extraction efficiency of 96% compared to keys of infinite lengths.
Reference-free-independent quantum key distribution immune to detector side channel attacks
NASA Astrophysics Data System (ADS)
Yin, Zhen-Qiang; Wang, Shuang; Chen, Wei; Li, Hong-Wei; Guo, Guang-Can; Han, Zheng-Fu
2014-05-01
Usually, a shared reference frame is indispensable for practical quantum key distribution (QKD) systems. As a result, most QKD systems need active alignment of reference frame due to the unknown and slowly variances of reference frame introduced by environment. Quite interestingly, reference-free-independent (RFI) QKD can generate secret-key bits without alignment of reference frame. However, RFI QKD may be still vulnerable to detector side channel attacks. Here, we propose a new RFI QKD protocol, in which all detector side channels are removed. Furthermore, our protocol can still tolerate unknown and slow variance of reference frame without active alignment. And a numerical simulation shows that long security distance is probable in this protocol.
Post-quantum attacks on key distribution schemes in the presence of weakly stochastic sources
NASA Astrophysics Data System (ADS)
Al–Safi, S. W.; Wilmott, C. M.
2015-09-01
It has been established that the security of quantum key distribution protocols can be severely compromised were one to permit an eavesdropper to possess a very limited knowledge of the random sources used between the communicating parties. While such knowledge should always be expected in realistic experimental conditions, the result itself opened a new line of research to fully account for real-world weak randomness threats to quantum cryptography. Here we expand of this novel idea by describing a key distribution scheme that is provably secure against general attacks by a post-quantum adversary. We then discuss possible security consequences for such schemes under the assumption of weak randomness.
Controlling Continuous-Variable Quantum Key Distribution with Tuned Linear Optics Cloning Machines
NASA Astrophysics Data System (ADS)
Guo, Ying; Qiu, Deli; Huang, Peng; Zeng, Guihua
2015-09-01
We show that the tolerable excess noise can be elegantly controlled while inserting a tunable linear optics cloning machine (LOCM) for continuous-variable key distribution (CVQKD). The LOCM-tuned noise can be stabilized to an optimal value by the reference partner of reconciliation to guarantee the high secret key rate. Simulation results show that there is a considerable improvement of the performance for the LOCM-based CVQKD protocol in terms of the secret rate while making a fine balance between the secret key rate and the transmission distance with the dynamically tuned parameters in suitable ranges.
Quantum key distribution using entangled-photon trains with no basis selection
Inoue, Kyo; Takesue, Hiroki
2006-03-15
Conventional quantum key distribution (QKD) protocols include a basis selection process for providing a secure secret key. In contrast, this paper proposes an entanglement-based QKD with no basis selection procedure. Entangled-photon pulse trains with an average photon number less than one per pulse are sent to two legitimate parties, from which a secret key is created utilizing the entanglement nature. Eavesdropping on a transmission line is prevented by a condition of less than one photon per pulse, and sending classically correlated coherent pulses instead of quantum correlated ones is revealed by monitoring coincident count rate000.
Measurement device-independent quantum key distribution with heralded pair coherent state
NASA Astrophysics Data System (ADS)
Chen, Dong; Shang-Hong, Zhao; Lei, Shi
2016-07-01
The original measurement device-independent quantum key distribution is reviewed, and a modified protocol using heralded pair coherent state (HPCS) is proposed to overcome the quantum bit error rate associated with the dark count rate of the detectors in long-distance quantum key distribution. Our simulation indicates that the secure transmission distance can be improved evidently with HPCS owing to the lower probability of vacuum events when compared with weak coherent source scenario, while the secure key rate can be increased with HPCS due to the higher probability of single-photon events when compared with heralded single-photon source scenario. Furthermore, we apply the finite key analysis to the decoy state MDI-QKD with HPCS and obtain a practical key rate.
An improved authenticated key agreement protocol for telecare medicine information system.
Liu, Wenhao; Xie, Qi; Wang, Shengbao; Hu, Bin
2016-01-01
In telecare medicine information systems (TMIS), identity authentication of patients plays an important role and has been widely studied in the research field. Generally, it is realized by an authenticated key agreement protocol, and many such protocols were proposed in the literature. Recently, Zhang et al. pointed out that Islam et al.'s protocol suffers from the following security weaknesses: (1) Any legal but malicious patient can reveal other user's identity; (2) An attacker can launch off-line password guessing attack and the impersonation attack if the patient's identity is compromised. Zhang et al. also proposed an improved authenticated key agreement scheme with privacy protection for TMIS. However, in this paper, we point out that Zhang et al.'s scheme cannot resist off-line password guessing attack, and it fails to provide the revocation of lost/stolen smartcard. In order to overcome these weaknesses, we propose an improved protocol, the security and authentication of which can be proven using applied pi calculus based formal verification tool ProVerif. PMID:27218005
NASA Astrophysics Data System (ADS)
Hwang, Won-Young; Su, Hong-Yi; Bae, Joonwoo
2016-07-01
We study N-dimensional measurement-device-independent quantum-key-distribution protocol where one checking state is used. Only assuming that the checking state is a superposition of other N sources, we show that the protocol is secure in zero quantum-bit-error-rate case, suggesting possibility of the protocol. The method may be applied in other quantum information processing.
Biometrics based novel key distribution solution for body sensor networks.
Miao, Fen; Jiang, Lei; Li, Ye; Zhang, Yuan-Ting
2009-01-01
The security of wireless body sensor network (BSN) is very important to telemedicine and m-healthcare, and it still remains a critical challenge. This paper presents a novel key distribution solution which allows two sensors in one BSN to agree on a changeable cryptographic key. A previously published scheme, fuzzy vault, is firstly applied to secure the random cryptographic key generated from electrocardiographic (ECG) signals. Simulations based on ECG data from MIT PhysioBank database, produce a minimum half total error rate (HTER) of 0.65%, which demonstrates our key distribution solution is promising compared with previous method, with HTER of 4.26%. PMID:19964960