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

arXiv:2402.04544 · Physical Review Applied

Efficient quantum digital signatures over long distances with likely bit strings

Ji-Qian Qin, Zong‐Wen Yu, Xiang‐Bin Wang

Published Feb 6, 2024• 11 citations
arXivHTMLPDF

Abstract

Quantum digital signatures (QDSs) can provide information-theoretic security of messages against forgery and repudiation. Compared with previous QDS protocols that focus on signing one-bit messages, hash function--based QDS protocols can save quantum resources and are able to sign messages of arbitrary length. Using the idea of likely bit strings, we propose an efficient QDS protocol with hash functions over long distances. Our method of likely bit strings can be applied to any quantum key distribution--based QDS protocol to significantly improve the signature rate and dramatically increase the secure signature distance of QDS protocols. In order to save computing resources, we propose an improved method where Alice participates in the verification process of Bob and Charlie. This eliminates the computational complexity relating to the huge number of all likely strings. We demonstrate the advantages of our method and our improved method with the example of sending-or-not-sending QDS. Under typical parameters, both our method and our improved method can improve the signature rate by more than $100$ times and increase the signature distance by about $150\phantom{\rule{0.2em}{0ex}}\mathrm{km}$ compared with hash function--based QDS protocols without likely bit strings.

DOI
10.1103/physrevapplied.21.024012

Related papers

Quantum Digital Signatures with Random Pairing

Ji-Qian Qin, Cong Jiang, Yunlong Yu +1 more

Digital signatures can guarantee the unforgeability and transferability of the message. Differently from classical digital signatures, whose security depends on computational complexity, quantum digital signatures (QDSs) can provide information-theoretic security. We propose a general method of random-pairing QDS, which can drastically increase QDS efficiency. In a way, our random-pairing method provides a tightened result for the security level of QDS. In the method, the parity value of each pair is used for the outcome-bit value. We present general formulas for the fraction of untagged bits and error rates of the outcome bits. Random pairing can be applied as a fundamental method to increase the QDS efficiency for all existing quantum key distribution (QKD) protocols. We take the QDS with sending-or-not-sending protocol and the QDS with side-channel-free protocol as examples to demonstrate the advantage of random pairing through numerical simulation. A similar advantage with random pairing is also found with decoy-state measurement-device-independent QKD and also the decoy-state BB84 protocol. We study the random-pairing QDS with sending-or-not-sending protocol considering effects of finite data size through optimization. The numerical simulation results show that the signature rate can be increased by more than $100\mathrm{%}$ under a noisy channel using our random-pairing method.

arXiv:2201.10530•Physical Review Applied•Apr 25, 2022•34 citations

One-time universal hashing quantum digital signatures without perfect keys

Bing-Hong Li, Yuan-Mei Xie, Xiaoyu Cao +4 more

Quantum digital signatures (QDSs), generating correlated bit strings among three remote parties for signatures through quantum law, can guarantee nonrepudiation, authenticity, and integrity of messages. Recently, a one-time universal-hashing QDS framework, exploiting the quantum asymmetric encryption and universal hash functions, has been proposed to significantly improve the signature rate and ensure unconditional security by directly signing the hash value of long messages. However, similar to quantum key distribution, this framework utilizes keys with perfect secrecy by performing privacy amplification that introduces cumbersome matrix operations, thereby consuming large computational resources, causing delays, and increasing failure probability. Here, we prove that, different from private communication, imperfect quantum keys with partial information leakage can be used for digital signatures and authentication without compromising the security while having eight orders of magnitude improvement on signature rate for signing a megabit message compared with conventional single-bit schemes. This study significantly reduces the delay for data postprocessing and is compatible with any quantum key generation protocols. In our simulation, taking two-photon twin-field key generation protocol as an example, QDS can be practically implemented over a fiber distance of 650 km between the signer and receiver. For the first time, this study offers a cryptographic application of quantum keys with imperfect secrecy and paves a way for the practical and agile implementation of digital signatures in a future quantum network.

arXiv:2301.01132•Physical Review Applied•Oct 4, 2023•41 citations

Continuous-variable quantum digital signatures that can withstand coherent attacks

Yi-Fan Zhang, Wen-Bo Liu, Bing-Hong Li +2 more

Quantum digital signatures (QDSs), which utilize correlated bit strings among sender and recipients, guarantee the authenticity, integrity, and nonrepudiation of classical messages based on quantum laws. Continuous-variable (CV) quantum protocol with heterodyne and homodyne measurement has obvious advantages of low-cost implementation and easy wavelength division multiplexing. However, security analyses in previous research are limited to the proof against collective attacks in finite-size scenarios. Moreover, existing multibit CV QDS schemes have primarily focused on adapting single-bit protocols for simplicity of security proof, often sacrificing signature efficiency. Here, we introduce a CV QDS protocol designed to withstand general coherent attacks through the use of a cutting-edge fidelity test function, while achieving high signature efficiency by employing a refined one-time universal hashing signing technique. Our protocol is proved to be robust against finite-size effects and excess noise in quantum channels. In simulation, results demonstrate a significant reduction of over six orders of magnitude in signature length for a megabit message signing task compared with existing CV QDS protocols and this advantage expands as the message size grows. Our work offers a solution with enhanced security and efficiency, paving the way for large-scale deployment of CV QDSs in future quantum networks.

arXiv:2407.03609•Physical Review A•Nov 20, 2024•8 citations

Multibit quantum digital signature with continuous variables using basis encoding over insecure channels

Wei Zhao, Ronghua Shi, Jinjing Shi +3 more

A quantum digital signature (QDS) is utilized to authenticate classical messages and offers information theoretical security guaranteed by the laws of quantum mechanics. Focusing on signing a one-bit message, previous continuous-variable quantum digital signature (CV-QDS) protocols that shared secret keys are generated by quantum key distribution, and it is only mentioned to suitably iterate the one-bit protocol for a multibit message. Although the CV-QDS protocol is unconditionally secure while sending single-bit messages, iterating the one-bit protocol in a naive way will allow some forgery attacks. In this paper, for signing one-bit and multibit messages, a CV-QDS protocol is proposed, on the condition that nonrepudiation and no forging are guaranteed. For one-bit and multibit schemes, we compare the difference in the distribution stage and messaging stage, analyzing the security as well as summarizing some formulas for calculation. We hope the protocol with continuous variables could further improve the performance of QDS.

Physical Review A•Jan 14, 2021•23 citations

High-efficiency continuous-variable quantum digital signature protocol for signing multi-bit messages

Wei Zhao, Ronghua Shi, Xinchao Ruan

Abstract A quantum digital signature (QDS) is guaranteed by the laws of quantum physics and can provide unconditional security to authenticate classical messages. Previous QDS protocols that shared secret keys could be realized using discrete-variable quantum key distribution (DV-QKD), for which the DV-QKD relied on extreme requirements like single-photon detection and extremely weak pulses of light. QDS protocols are mainly focused on how to sign a one-bit message rather than multi-bit messages. In this paper, we present a continuous-variable quantum digital signature (CV-QDS) protocol for signing multi-bit messages. The CV-QDS protocol has better compatibility with existing communication systems and the encoding strategy for multi-bit messages is simpler than before. We hope the continuous-variable protocol could further improve the performance of QDS.

Laser Physics Letters•Jan 29, 2021•2 citations

Secure and practical multiparty quantum digital signatures

Chen-Xun Weng, Yu-Shuo Lu, Rui-Qi Gao +6 more

Quantum digital signatures (QDSs) promise information-theoretic security against repudiation and forgery of messages. Compared with currently existing three-party QDS protocols, multiparty protocols have unique advantages in the practical case of more than two receivers when sending a mass message. However, complex security analysis, numerous quantum channels and low data utilization efficiency make it intractable to expand three-party to multiparty scenario. Here, based on six-state non-orthogonal encoding protocol, we propose an effective multiparty QDS framework to overcome these difficulties. The number of quantum channels in our protocol only linearly depends on the number of users. The post-matching method is introduced to enhance data utilization efficiency and make it linearly scale with the probability of detection events even for five-party scenario. Our work compensates for the absence of practical multiparty protocols, which paves the way for future QDS networks.

arXiv:2104.12059•Optics Express•Jul 28, 2021•24 citations
Quantum digital signatures (QDSs) can provide information-theoretic security of messages against forgery and repudiation. Compared with previous QDS protocols that focus on signing one-bit messages, hash function--based QDS protocols can save quantum resources and are able to sign messages of arbitrary length. Using the idea of likely bit strings, we propose an efficient QDS protocol with hash functions over long distances. Our method of likely bit strings can be applied to any quantum key distribution--based QDS protocol to significantly improve the signature rate and dramatically increase the secure signature distance of QDS protocols. In order to save computing resources, we propose an improved method where Alice participates in the verification process of Bob and Charlie. This eliminates the computational complexity relating to the huge number of all likely strings. We demonstrate the advantages of our method and our improved method with the example of sending-or-not-sending QDS. Under typical parameters, both our method and our improved method can improve the signature rate by more than 100100100 times and increase the signature distance by about 150km150\phantom{\rule{0.2em}{0ex}}\mathrm{km}150km compared with hash function--based QDS protocols without likely bit strings.
Digital signatures can guarantee the unforgeability and transferability of the message. Differently from classical digital signatures, whose security depends on computational complexity, quantum digital signatures (QDSs) can provide information-theoretic security. We propose a general method of random-pairing QDS, which can drastically increase QDS efficiency. In a way, our random-pairing method provides a tightened result for the security level of QDS. In the method, the parity value of each pair is used for the outcome-bit value. We present general formulas for the fraction of untagged bits and error rates of the outcome bits. Random pairing can be applied as a fundamental method to increase the QDS efficiency for all existing quantum key distribution (QKD) protocols. We take the QDS with sending-or-not-sending protocol and the QDS with side-channel-free protocol as examples to demonstrate the advantage of random pairing through numerical simulation. A similar advantage with random pairing is also found with decoy-state measurement-device-independent QKD and also the decoy-state BB84 protocol. We study the random-pairing QDS with sending-or-not-sending protocol considering effects of finite data size through optimization. The numerical simulation results show that the signature rate can be increased by more than $100\mathrm{%}$ under a noisy channel using our random-pairing method.
Quantum digital signatures (QDSs), generating correlated bit strings among three remote parties for signatures through quantum law, can guarantee nonrepudiation, authenticity, and integrity of messages. Recently, a one-time universal-hashing QDS framework, exploiting the quantum asymmetric encryption and universal hash functions, has been proposed to significantly improve the signature rate and ensure unconditional security by directly signing the hash value of long messages. However, similar to quantum key distribution, this framework utilizes keys with perfect secrecy by performing privacy amplification that introduces cumbersome matrix operations, thereby consuming large computational resources, causing delays, and increasing failure probability. Here, we prove that, different from private communication, imperfect quantum keys with partial information leakage can be used for digital signatures and authentication without compromising the security while having eight orders of magnitude improvement on signature rate for signing a megabit message compared with conventional single-bit schemes. This study significantly reduces the delay for data postprocessing and is compatible with any quantum key generation protocols. In our simulation, taking two-photon twin-field key generation protocol as an example, QDS can be practically implemented over a fiber distance of 650 km between the signer and receiver. For the first time, this study offers a cryptographic application of quantum keys with imperfect secrecy and paves a way for the practical and agile implementation of digital signatures in a future quantum network.
Quantum digital signatures (QDSs), which utilize correlated bit strings among sender and recipients, guarantee the authenticity, integrity, and nonrepudiation of classical messages based on quantum laws. Continuous-variable (CV) quantum protocol with heterodyne and homodyne measurement has obvious advantages of low-cost implementation and easy wavelength division multiplexing. However, security analyses in previous research are limited to the proof against collective attacks in finite-size scenarios. Moreover, existing multibit CV QDS schemes have primarily focused on adapting single-bit protocols for simplicity of security proof, often sacrificing signature efficiency. Here, we introduce a CV QDS protocol designed to withstand general coherent attacks through the use of a cutting-edge fidelity test function, while achieving high signature efficiency by employing a refined one-time universal hashing signing technique. Our protocol is proved to be robust against finite-size effects and excess noise in quantum channels. In simulation, results demonstrate a significant reduction of over six orders of magnitude in signature length for a megabit message signing task compared with existing CV QDS protocols and this advantage expands as the message size grows. Our work offers a solution with enhanced security and efficiency, paving the way for large-scale deployment of CV QDSs in future quantum networks.
A quantum digital signature (QDS) is utilized to authenticate classical messages and offers information theoretical security guaranteed by the laws of quantum mechanics. Focusing on signing a one-bit message, previous continuous-variable quantum digital signature (CV-QDS) protocols that shared secret keys are generated by quantum key distribution, and it is only mentioned to suitably iterate the one-bit protocol for a multibit message. Although the CV-QDS protocol is unconditionally secure while sending single-bit messages, iterating the one-bit protocol in a naive way will allow some forgery attacks. In this paper, for signing one-bit and multibit messages, a CV-QDS protocol is proposed, on the condition that nonrepudiation and no forging are guaranteed. For one-bit and multibit schemes, we compare the difference in the distribution stage and messaging stage, analyzing the security as well as summarizing some formulas for calculation. We hope the protocol with continuous variables could further improve the performance of QDS.
Abstract A quantum digital signature (QDS) is guaranteed by the laws of quantum physics and can provide unconditional security to authenticate classical messages. Previous QDS protocols that shared secret keys could be realized using discrete-variable quantum key distribution (DV-QKD), for which the DV-QKD relied on extreme requirements like single-photon detection and extremely weak pulses of light. QDS protocols are mainly focused on how to sign a one-bit message rather than multi-bit messages. In this paper, we present a continuous-variable quantum digital signature (CV-QDS) protocol for signing multi-bit messages. The CV-QDS protocol has better compatibility with existing communication systems and the encoding strategy for multi-bit messages is simpler than before. We hope the continuous-variable protocol could further improve the performance of QDS.
Quantum digital signatures (QDSs) promise information-theoretic security against repudiation and forgery of messages. Compared with currently existing three-party QDS protocols, multiparty protocols have unique advantages in the practical case of more than two receivers when sending a mass message. However, complex security analysis, numerous quantum channels and low data utilization efficiency make it intractable to expand three-party to multiparty scenario. Here, based on six-state non-orthogonal encoding protocol, we propose an effective multiparty QDS framework to overcome these difficulties. The number of quantum channels in our protocol only linearly depends on the number of users. The post-matching method is introduced to enhance data utilization efficiency and make it linearly scale with the probability of detection events even for five-party scenario. Our work compensates for the absence of practical multiparty protocols, which paves the way for future QDS networks.