Quantum digital signatures (QDS) exploit quantum laws to guarantee non-repudiation, unforgeability and transferability of messages with information-theoretic security. Current QDS protocols face two major restrictions, including the requirement of the symmetrization step with additional secure classical channels and the quadratic scaling of the signature rate with the probability of detection events. Here, we present an efficient QDS protocol to overcome these issues by utilizing the classical post-processing operation called post-matching method. Our protocol does not need the symmetrization step, and the signature rate scales linearly with the probability of detection events. Simulation results show that the signature rate is three orders of magnitude higher than the original protocol in a 100-km-long fiber. This protocol is compatible with existing quantum communication infrastructure, therefore we anticipate that it will play a significant role in providing digital signatures with unconditional security.
Quantum digital signatures (QDS) exploit quantum laws to guarantee non-repudiation, unforgeability and transferability of messages with information-theoretic security. Current QDS protocols face two major restrictions, including the requirement of the symmetrization step with additional secure classical channels and the quadratic scaling of the signature rate with the probability of detection events. Here, we present an efficient QDS protocol to overcome these issues by utilizing the classical post-processing operation called post-matching method. Our protocol does not need the symmetrization step, and the signature rate scales linearly with the probability of detection events. Simulation results show that the signature rate is three orders of magnitude higher than the original protocol in a 100-km-long fiber. This protocol is compatible with existing quantum communication infrastructure, therefore we anticipate that it will play a significant role in providing digital signatures with unconditional security.
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.
Guaranteeing nonrepudiation, unforgeability as well as transferability of a signature is one of the most vital safeguards in today's e-commerce era. Based on fundamental laws of quantum physics, quantum digital signature (QDS) aims to provide information-theoretic security for this cryptographic task. However, up to date, the previously proposed QDS protocols are impractical due to various challenging problems and most importantly, the requirement of authenticated (secure) quantum channels between participants. Here, we present the first quantum digital signature protocol that removes the assumption of authenticated quantum channels while remaining secure against the collective attacks. Besides, our QDS protocol can be practically implemented over more than 100 km under current mature technology as used in quantum key distribution.
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.
We propose an entanglement-based quantum digital signature (QDS) protocol optimized for quantum networks. The protocol follows the Lamport-inspired QDS paradigm but eliminates QKD post-processing by signing and verifying with raw conclusive keys, thereby reducing latency and implementation complexity. We provide a finite-size security analysis of robustness, unforgeability, and non-repudiation. Under standard fiber-loss and detector models, simulations show a consistent signature rate advantage over a representative Lamport-inspired QDS baseline across metro-to-regional distances. The proposed protocol is practical for near-term deployment while preserving end-to-end, finite key security guarantees.
Digital signatures guarantee the authenticity and transferability of messages and are widely used in modern communication. The security of currently used classical digital signature schemes, however, relies on computational assumptions. In contrast, quantum digital signature (QDS) schemes offer information-theoretic security guaranteed by the laws of quantum mechanics. We present two QDS protocols which have the same experimental requirements as quantum key distribution, which is already commercially available. We also give a security proof for the presented QDS schemes against coherent forging attacks.
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.