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), 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.
The quantum digital signature (QDS) has attracted much attention as it ensures the nonrepudiation, unforgeability, and transferability of signature messages based on information-theoretic security. Amiri et al. ( Phys. Rev. A 93 032325 ) proposed the first practical QDS protocol based on orthogonal coding, which has realized information-theoretic security and become the mainstream paradigm in QDS research. The procedure of QDS involves two essential stages, the one is the distribution stage, in which Alice-Bob and Alice-Charlie individually utilize the three-intensity decoy-state quantum key distribution protocol but without error correction or privacy amplification, namely, key-generation protocol, to generate correlated bit strings, the other is the messaging stage, in which Alice transmits signature messages to the two recipients. However, previous theoretical and experimental studies both overlooked the modulation errors that may be introduced in the state preparation process due to the imperfections in modulator devices. Under the traditional framework of GLLP analysis method, these errors will significantly reduce the actual signature rates. Therefore, we propose a state-preparation-error tolerant QDS and use parameter analysis to characterize the state preparation error to make the simulation analysis more realistic. In addition, we analyze the signature rates of the present scheme by using the three-intensity decoy-state method. Compared with previous QDS protocols, our protocol almost shows no performance degradation under practical state preparation errors and exhibits a maximum transmission distance around 180 km. Furthermore, state preparation errors do not have a significant influence on the bit error rate induced by normal communication between the legitimate users or the one produced by an eavesdropper. These results prove that the method proposed in this paper has excellent robustness against state preparation errors and it can achieve much higher signature rates and signature distances than other standard methods. Besides, signature rates are basically unchanged under different total pulse numbers, which shows that our protocol also has good robustness against the finite-size effect. Additionally, in the key generation process, our method is only required to prepare three quantum states, which will reduce the difficulty of experiment realizations. Furthermore, the proposed method can also be combined with the measurement-device-independent QDS protocol and the twin-field QDS protocol to further increase the security level of QDS protocol. Therefore, our work will provide an important reference value for realizing the practical application of QDS in the future.
Abstract Cryptography promises four information security objectives, namely, confidentiality, integrity, authenticity and non-repudiation, to support trillions of transactions annually in the digital economy. Efficient digital signatures, ensuring integrity, authenticity and non-repudiation of data with information-theoretical security are highly urgent and intractable open problems in cryptography. Here, we propose a high-efficiency quantum digital signature (QDS) protocol using asymmetric quantum keys acquired via secret sharing, one-time universal2 hashing and a one-time pad. We just need to use a 384-bit key to sign documents of lengths up to 264 with a security bound of 10−19. If a one-megabit document is signed, the signature efficiency is improved by more than 108 times compared with previous QDS protocols. Furthermore, we build the first all-in-one quantum secure network integrating information-theoretically secure communication, digital signatures, secret sharing and conference key agreement and experimentally demonstrate this signature efficiency advantage. Our work completes the cryptography toolbox of the four information security objectives.
Quantum digital signatures (QDSs), which distribute and measure quantum states by key generation protocols and then sign messages via classical data processing, are a key area of interest in quantum cryptography. However, the practical implementation of a QDS network has many challenges, including complex interference technical requirements, linear channel loss of quantum state transmission, and potential side-channel attacks on detectors. Here, we propose an asynchronous measurement-device-independent (MDI) QDS protocol with asynchronous two-photon interference strategy and one-time universal hashing method. The two-photon interference approach protects our protocol against all detector side-channel attacks and relaxes the difficulty of experiment implementation, while the asynchronous strategy effectively reduces the equivalent channel loss to its square root. Compared to previous MDI-QDS schemes, our protocol shows several orders of magnitude performance improvements and doubling of transmission distance when processing multibit messages. Our findings present an efficient and practical MDI-QDS scheme, paving the way for large-scale data processing with nonrepudiation in quantum networks.
Digital signatures are one of the security cornerstones of the current information age. Compared with classical digital signatures based on computational complexity, quantum digital signatures (QDS) theoretically guarantee data integrity, authenticity, and non-repudiation by quantum mechanics, showing great potential for development in cryptography and thus attracting widespread attention. However, the performance of existing QDS systems are still limited in rate and distance. Here we report the first experimental demonstration of twin-field QDS (TF-QDS) using a GHz system. We achieve a maximum transmission distance of 504 km fiber spools for both single-bit and multi-bit schemes, surpassing all existing state-of-the-art QDS experiments more than 200 km. Furthermore, by combining the one-time universal hash method, we achieve a maximum signature rate of 21.1 times per second for a 1 Mbit file over fiber distances up to 302 km. In this work, the signature rates of both single-bit scheme and multi-bit scheme are more than two orders of magnitude higher than that of previous works at similar distance. Our work provides a new record for long-distance and high-rate QDS, representing a significant step in the development of QDS.
Digital signature is a key technique in information security, especially for identity authentications. Compared to classical correspondence, quantum digital signatures (QDSs) provide a considerably higher level of security. At present, its performance is limited by key generation protocols, which are fundamentally limited in terms of channel capacity. Based on the idea of twin-field quantum key distribution, this Letter presents a twin-field QDS protocol and details a corresponding security analysis. In its distribution stage, a specific key generation protocol, the sending-or-not-sending twin-field protocol, has been adopted. Besides, we present a systematic model to evaluate the performance of a QDS protocol and compare the performance of our protocol to other typical QDS protocols. Numerical simulation results show that the new protocol exhibits outstanding security and practicality compared to other existing protocols. Therefore, our protocol paves the way toward real-world applications of QDSs.
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 150km compared with hash function--based QDS protocols without likely bit strings.