Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum cryptographic system with reduced data loss

Hoi‐Kwong Lo

Published Jan 23, 2023• 2 citations
OpenAlex

Abstract

A secure method for distributing a random cryptographic key with reduced data loss. Traditional quantum key distribution systems employ similar probabilities for the different communication modes and thus reject at least half of the transmitted data. The invention substantially reduces the amount of discarded data (those that are encoded and decoded in different communication modes e.g. using different operators) in quantum key distribution without compromising security by using significantly different probabilities for the different communication modes. Data is separated into various sets according to the actual operators used in the encoding and decoding process and the error rate for each set is determined individually. The invention increases the key distribution rate of the BB84 key distribution scheme proposed by Bennett and Brassard in 1984. Using the invention, the key distribution rate increases with the number of quantum signals transmitted and can be doubled asymptotically.

Related papers

Security of quantum key distribution

Shuang Wang, Jingzheng Huang, Zheng‐Fu Han +10 more

We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. An eavesdropper may try to break such a scheme by eavesdropping mainly along the predominant basis. To defeat such an attack, we perform a refined analysis of accepted data: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset individually.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Oct 1, 2012•43 citations

Method and apparatus for free-space quantum key distribution in daylight

Hughes, Richard J.; Buttler, William T.; Lamoreaux, Steve K.; Morgan, George L.; Nordholt, Jane E.; Peterson, C. Glen; Kwiat, Paul G.

A quantum cryptography apparatus securely generates a key to be used for secure transmission between a sender and a receiver connected by an atmospheric transmission link. A first laser outputs a timing bright light pulse; other lasers output polarized optical data pulses after having been enabled by a random bit generator. Output optics transmit output light from the lasers that is received by receiving optics. A first beam splitter receives light from the receiving optics, where a received timing bright light pulse is directed to a delay circuit for establishing a timing window for receiving light from the lasers and where an optical data pulse from one of the lasers has a probability of being either transmitted by the beam splitter or reflected by the beam splitter. A first polarizer receives transmitted optical data pulses to output one data bit value and a second polarizer receives reflected optical data pulses to output a second data bit value. A computer receives pulses representing receipt of a timing bright timing pulse and the first and second data bit values, where receipt of the first and second data bit values is indexed by the bright timing pulse.

•Jan 23, 2023•1 citation

Method for adding nodes to a quantum key distribution system

Warren P. Grice

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.

•Jan 23, 2023•0 citations

Efficient Quantum Key Distribution

M. Ardehali, Chau, H. F., Hoi‐Kwong Lo

We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. An eavesdropper may try to break such a scheme by eavesdropping mainly along the predominant basis. To defeat such an attack, we perform a refined analysis of accepted data: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset {\it individually}.

arXiv:quant-ph/9803007•Mar 3, 1998•37 citations

Communication systems and methods

Stephen F. Bush

A communication system is provided that includes a first quantum key distribution device and a communication device. The first quantum key distribution device is configured to be coupled to a second quantum key distribution device over a quantum channel and to generate a quantum key based on a quantum state transmitted along the quantum channel. The communication device is communicatively connected to the first quantum key distribution device within a network. The communication device is configured to receive the quantum key from the first quantum key distribution device and transmit the quantum key to an end device in the network via a classical link to enable the end device to use the quantum key for encrypting and/or decrypting messages communicated through the network.

•Jan 23, 2023•0 citations

Finite-key analysis for quantum key distribution with weak coherent pulses based on Bernoulli sampling

Shun Kawakami, Toshihiko Sasaki, Masato Koashi

An essential step in quantum key distribution is the estimation of parameters related to the leaked amount of information, which is usually done by sampling of the communication data. When the data size is finite, the final key rate depends on how the estimation process handles statistical fluctuations. Many of the present security analyses are based on the method with simple random sampling, where hypergeometric distribution or its known bounds are used for the estimation. Here we propose a concise method based on Bernoulli sampling, which is related to binomial distribution. Our method is suitable for the Bennett-Brassard 1984 (BB84) protocol with weak coherent pulses [C. H. Bennett and G. Brassard, Proceedings of the IEEE Conference on Computers, Systems and Signal Processing (IEEE, New York, 1984), Vol. 175], reducing the number of estimated parameters to achieve a higher key generation rate compared to the method with simple random sampling. We also apply the method to prove the security of the differential-quadrature-phase-shift (DQPS) protocol in the finite-key regime. The result indicates that the advantage of the DQPS protocol over the phase-encoding BB84 protocol in terms of the key rate, which was previously confirmed in the asymptotic regime, persists in the finite-key regime.

arXiv:1701.04168•Physical Review A•Jul 5, 2017•5 citations
A secure method for distributing a random cryptographic key with reduced data loss. Traditional quantum key distribution systems employ similar probabilities for the different communication modes and thus reject at least half of the transmitted data. The invention substantially reduces the amount of discarded data (those that are encoded and decoded in different communication modes e.g. using different operators) in quantum key distribution without compromising security by using significantly different probabilities for the different communication modes. Data is separated into various sets according to the actual operators used in the encoding and decoding process and the error rate for each set is determined individually. The invention increases the key distribution rate of the BB84 key distribution scheme proposed by Bennett and Brassard in 1984. Using the invention, the key distribution rate increases with the number of quantum signals transmitted and can be doubled asymptotically.
We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. An eavesdropper may try to break such a scheme by eavesdropping mainly along the predominant basis. To defeat such an attack, we perform a refined analysis of accepted data: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset individually.
A quantum cryptography apparatus securely generates a key to be used for secure transmission between a sender and a receiver connected by an atmospheric transmission link. A first laser outputs a timing bright light pulse; other lasers output polarized optical data pulses after having been enabled by a random bit generator. Output optics transmit output light from the lasers that is received by receiving optics. A first beam splitter receives light from the receiving optics, where a received timing bright light pulse is directed to a delay circuit for establishing a timing window for receiving light from the lasers and where an optical data pulse from one of the lasers has a probability of being either transmitted by the beam splitter or reflected by the beam splitter. A first polarizer receives transmitted optical data pulses to output one data bit value and a second polarizer receives reflected optical data pulses to output a second data bit value. A computer receives pulses representing receipt of a timing bright timing pulse and the first and second data bit values, where receipt of the first and second data bit values is indexed by the bright timing pulse.
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.
We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. An eavesdropper may try to break such a scheme by eavesdropping mainly along the predominant basis. To defeat such an attack, we perform a refined analysis of accepted data: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset {\it individually}.
A communication system is provided that includes a first quantum key distribution device and a communication device. The first quantum key distribution device is configured to be coupled to a second quantum key distribution device over a quantum channel and to generate a quantum key based on a quantum state transmitted along the quantum channel. The communication device is communicatively connected to the first quantum key distribution device within a network. The communication device is configured to receive the quantum key from the first quantum key distribution device and transmit the quantum key to an end device in the network via a classical link to enable the end device to use the quantum key for encrypting and/or decrypting messages communicated through the network.
An essential step in quantum key distribution is the estimation of parameters related to the leaked amount of information, which is usually done by sampling of the communication data. When the data size is finite, the final key rate depends on how the estimation process handles statistical fluctuations. Many of the present security analyses are based on the method with simple random sampling, where hypergeometric distribution or its known bounds are used for the estimation. Here we propose a concise method based on Bernoulli sampling, which is related to binomial distribution. Our method is suitable for the Bennett-Brassard 1984 (BB84) protocol with weak coherent pulses [C. H. Bennett and G. Brassard, Proceedings of the IEEE Conference on Computers, Systems and Signal Processing (IEEE, New York, 1984), Vol. 175], reducing the number of estimated parameters to achieve a higher key generation rate compared to the method with simple random sampling. We also apply the method to prove the security of the differential-quadrature-phase-shift (DQPS) protocol in the finite-key regime. The result indicates that the advantage of the DQPS protocol over the phase-encoding BB84 protocol in terms of the key rate, which was previously confirmed in the asymptotic regime, persists in the finite-key regime.