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

Chinese Physics Letters

Increasing the Efficiencies of Random-Choice-Based Quantum Communication Protocols with Delayed Measurement

Fu‐Guo Deng, Long Gui Lu, 汪燕, 肖丽

Published Jan 1, 2004• 2 citations
OpenAlex

Abstract

The security of quantum communications lies in the capability of the legitimate parties to detect eavesdropping.Here we propose to use delayed measurement to increase the efficiency of protocols of quantum key distribution and quantum secret sharing that uses a random choice of measuring-basis. In addition to a higher efficiency,these measures also bring the benefit of much reduced amount of classical communications.

Related papers

Increasing the Efficiencies of Random-Choice-Based Quantum Communication Protocols with Delayed Measurement

Deng Fu-Guo, Long Gui-Lu, Yan Wang +1 more

The security of quantum communications lies in the capability of the legitimate parties to detect eavesdropping. Here we propose to use delayed measurement to increase the efficiency of protocols of quantum key distribution and quantum secret sharing that uses a random choice of measuring-basis. In addition to a higher efficiency, these measures also bring the benefit of much reduced amount of classical communications.

Chinese Physics Letters•Oct 27, 2004•91 citations

Improving BB84 Efficiency with Delayed Measurement via Quantum Memory

Mohammed Th. Hassan, Omar Abouelazm

In this paper, we introduce a novel modification to the BB84 Quantum Key Distribution (QKD) protocol, aimed at enhancing its efficiency through the use of quantum memory and delayed measurement. In the standard BB84 protocol, the receiver immediately measures the qubits sent by the sender using randomly chosen bases. Due to mismatches between the sender and receiver's bases, a significant portion of the qubits are discarded, reducing the overall key generation rate. Our proposed protocol allows the receiver to store the received qubits in quantum memory and defer measurement until after the sender reveals her basis choices, effectively eliminating the need to discard mismatched qubits. This modification improves the key generation efficiency while maintaining the core security features of the standard BB84 protocol. By avoiding the unnecessary loss of qubits, our protocol achieves a higher secret key rate without introducing additional vulnerabilities. We present a detailed step-by-step explanation of the delayed measurement process. Although this approach does not alter the security guarantees of BB84, it represents a significant improvement in efficiency, making the protocol more viable for large-scale quantum communication networks.

arXiv:2410.21191•Oct 28, 2024•0 citations

Exploiting the randomness of the measurement basis in quantum cryptography: Secure Quantum Key Growing without Privacy Amplification

Hannes R. Böhm, Paul S. Böhm, Markus Aspelmeyer +2 more

We suggest that the randomness of the choices of measurement basis by Alice and Bob provides an additional important resource for quantum cryptography. As a specific application, we present a novel protocol for quantum key distribution (QKD) which enhances the BB84 scheme by encrypting the information sent over the classical channel during key sifting. We show that, in the limit of long keys, this process prevents an eavesdropper from reproducing the sifting process carried out by the legitimate users. The inability of the eavesdropper to sift the information gathered by tapping the quantum channel reduces the amount of information that an eavesdropper can gain on the sifted key. We further show that the protocol proposed is self sustaining, and thus allows the growing of a secret key.

arXiv:quant-ph/0408179•Aug 30, 2004•2 citations

Choice of measurement as the secret

Bin Liu, Fei Gao, Su‐Juan Qin +3 more

Recently, Kalev et al. [A. Kalev, A. Mann, and M. Revzen, Phys. Rev. Lett. 110, 260502 (2013).] proposed a quantum (public) communication protocol with an interesting encoding style, where the signal is encoded in the choice of the measurement basis of one of the communicating parties (Bob) and Bob's measurement results are irrelevant for the communication. As we know, one of the main advantages of quantum technique in communication over the classical one is the higher security. Therefore, as Kalev et al. have mentioned in their paper, an interesting open question is whether one could and how to utilize this new encoding style to design a secure communication protocol, i.e., translate the choice of measurement into the secret. Here we propose a quantum key distribution protocol, which is a secure communication protocol, with this encoding style, where Bob's measurement results are still irrelevant. Furthermore, the security of the proposed protocol in the zero-error case has been proved.

Physical Review A•Apr 22, 2014•9 citations

Resilient quantum secret sharing against collusion and eavesdropping: a measurement-basis and hash-based approach

Wenting Pan, Yu Cun Zhou, Jing Xue +1 more

Abstract Quantum secret sharing (QSS) is a fundamental primitive in quantum cryptography, enabling secure distribution of sensitive information among multiple parties. However, existing protocols often suffer from vulnerabilities such as collusion attacks, uneven share distribution, and protocol failure due to random basis selection. This paper proposes a novel QSS protocol that integrates hash-based measurement basis derivation with decoy photon-enhanced eavesdropping detection. The scheme ensures fair and deterministic secret reconstruction while eliminating the need for entangled states or complex quantum operations, thereby significantly reducing the quantum operational complexity and hardware requirements. The protocol’s correctness, security against both internal and external adversaries, and efficiency in terms of qubit usage, transmission delay, and computational overhead are rigorously analyzed. Notably, the protocol supports dynamic participant management, allowing agents to join or leave securely without re-executing the entire protocol. Comparative analysis demonstrates that the proposed approach outperforms existing QSS protocols across multiple performance metrics. By minimizing quantum resource requirements-such as the elimination of entanglement generation and complex quantum operations-our protocol enhances compatibility with near-term quantum networks, thus facilitating the transition from theoretical QSS models to experimentally feasible implementations.

Physica Scripta•Oct 1, 2025•1 citation

A modified protocol of quantum state sharing based on entanglement swapping and random EPR selection

Jian Tao Dong, Jianfu Teng, Shuyan Wang

Quantum secret sharing (QSS), an important branch of quantum communication, is the generalization of classical secret sharing into quantum scenario. The secret messages are split into several parts, and each part is distributed to a separate party so that no action of a subset of all the parties without the cooperation of the entire group is able to read out the secret messages. In this paper, a quantum state sharing protocol is proposed by using entanglement swapping and random EPR selection. The EPR pairs of Bell-state measurement are selected randomly by the sender Alice, which can improve the security of the scheme and raise probability of detecting Eve to 95.8%. In addition, difference coding is used in this protocol to achieve a high efficiency. The security of the present multiparty QSS against eavesdropping has been analyzed. It is convenient in application as it require only two qubit entanglements, one measuring-basis and two-qubit joint measurements, not GHZ states, for sharing an arbitrary secret two-qubit state.

International Conference on Neural Networks and Signal Processing•Jun 1, 2008•2 citations
The security of quantum communications lies in the capability of the legitimate parties to detect eavesdropping.Here we propose to use delayed measurement to increase the efficiency of protocols of quantum key distribution and quantum secret sharing that uses a random choice of measuring-basis. In addition to a higher efficiency,these measures also bring the benefit of much reduced amount of classical communications.
In this paper, we introduce a novel modification to the BB84 Quantum Key Distribution (QKD) protocol, aimed at enhancing its efficiency through the use of quantum memory and delayed measurement. In the standard BB84 protocol, the receiver immediately measures the qubits sent by the sender using randomly chosen bases. Due to mismatches between the sender and receiver's bases, a significant portion of the qubits are discarded, reducing the overall key generation rate. Our proposed protocol allows the receiver to store the received qubits in quantum memory and defer measurement until after the sender reveals her basis choices, effectively eliminating the need to discard mismatched qubits. This modification improves the key generation efficiency while maintaining the core security features of the standard BB84 protocol. By avoiding the unnecessary loss of qubits, our protocol achieves a higher secret key rate without introducing additional vulnerabilities. We present a detailed step-by-step explanation of the delayed measurement process. Although this approach does not alter the security guarantees of BB84, it represents a significant improvement in efficiency, making the protocol more viable for large-scale quantum communication networks.
We suggest that the randomness of the choices of measurement basis by Alice and Bob provides an additional important resource for quantum cryptography. As a specific application, we present a novel protocol for quantum key distribution (QKD) which enhances the BB84 scheme by encrypting the information sent over the classical channel during key sifting. We show that, in the limit of long keys, this process prevents an eavesdropper from reproducing the sifting process carried out by the legitimate users. The inability of the eavesdropper to sift the information gathered by tapping the quantum channel reduces the amount of information that an eavesdropper can gain on the sifted key. We further show that the protocol proposed is self sustaining, and thus allows the growing of a secret key.
Recently, Kalev et al. [A. Kalev, A. Mann, and M. Revzen, Phys. Rev. Lett. 110, 260502 (2013).] proposed a quantum (public) communication protocol with an interesting encoding style, where the signal is encoded in the choice of the measurement basis of one of the communicating parties (Bob) and Bob's measurement results are irrelevant for the communication. As we know, one of the main advantages of quantum technique in communication over the classical one is the higher security. Therefore, as Kalev et al. have mentioned in their paper, an interesting open question is whether one could and how to utilize this new encoding style to design a secure communication protocol, i.e., translate the choice of measurement into the secret. Here we propose a quantum key distribution protocol, which is a secure communication protocol, with this encoding style, where Bob's measurement results are still irrelevant. Furthermore, the security of the proposed protocol in the zero-error case has been proved.
Abstract Quantum secret sharing (QSS) is a fundamental primitive in quantum cryptography, enabling secure distribution of sensitive information among multiple parties. However, existing protocols often suffer from vulnerabilities such as collusion attacks, uneven share distribution, and protocol failure due to random basis selection. This paper proposes a novel QSS protocol that integrates hash-based measurement basis derivation with decoy photon-enhanced eavesdropping detection. The scheme ensures fair and deterministic secret reconstruction while eliminating the need for entangled states or complex quantum operations, thereby significantly reducing the quantum operational complexity and hardware requirements. The protocol’s correctness, security against both internal and external adversaries, and efficiency in terms of qubit usage, transmission delay, and computational overhead are rigorously analyzed. Notably, the protocol supports dynamic participant management, allowing agents to join or leave securely without re-executing the entire protocol. Comparative analysis demonstrates that the proposed approach outperforms existing QSS protocols across multiple performance metrics. By minimizing quantum resource requirements-such as the elimination of entanglement generation and complex quantum operations-our protocol enhances compatibility with near-term quantum networks, thus facilitating the transition from theoretical QSS models to experimentally feasible implementations.
Quantum secret sharing (QSS), an important branch of quantum communication, is the generalization of classical secret sharing into quantum scenario. The secret messages are split into several parts, and each part is distributed to a separate party so that no action of a subset of all the parties without the cooperation of the entire group is able to read out the secret messages. In this paper, a quantum state sharing protocol is proposed by using entanglement swapping and random EPR selection. The EPR pairs of Bell-state measurement are selected randomly by the sender Alice, which can improve the security of the scheme and raise probability of detecting Eve to 95.8%. In addition, difference coding is used in this protocol to achieve a high efficiency. The security of the present multiparty QSS against eavesdropping has been analyzed. It is convenient in application as it require only two qubit entanglements, one measuring-basis and two-qubit joint measurements, not GHZ states, for sharing an arbitrary secret two-qubit state.