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.
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.
Quantum digital signatures (QDSs), which are unforgeable, non-repudiable, and transferable, are widely used in quantum communication networks. Unfortunately, previous protocols have often relied on three-party models for security analysis and experimental verification. As the number of parties increases, the number of quantum links required increases exponentially, undoubtedly leading to high channel losses and cost for multi-party QDSs. This study proposes a multi-party ring QDS scheme that can effectively deal with the issue of redundant quantum links. Furthermore, compared with the previously proposed QDS protocols, our protocol can prevent repudiation attacks without symmetry operation or swap test. Hence, it also can reduce the possibility of forging attacks by eliminating the possibility of forgery using illegal strings.
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.
Digital signatures are the building blocks of modern communication to prevent masquerading by any party other than recipients, repudiation by signatory and forgery by any individual recipient. Digital signature scheme is said to be standard if the signature (a) is a pattern depending upon the message to be signed, (b) is built upon some information publically known and unique to the signatory, (c) can be stored by all the recipients. While classical methods provide computational security only, quantum mechanics guarantees information-theoretically secure and standard digital signature schemes. However, standard quantum digital signature schemes are based on quantum one-way functions and hence require long term quantum memory for storing quantum signatures, which is not practically feasible yet. We demonstrate here a standard quantum digital signature scheme by replacing quantum one-way functions with multiparty controlled EPR channels. It allows signatory to generate non-locally correlated quantum signatures, instead of multiple copies of a unique quantum state, and assures security against any individual since others have non-locally correlated information.
With the quantum computational paradigm rapidly developing across the world, new vulnerabilities on currently deployed cryptography protocols are to be taken in consideration. A possible answer to said vulnerabilities is using quantum technologies on cryptography. For a quantum-assisted cryptography protocol, key pairs can be generated via quantum state measurements. This protocol is known as quantum key distribution, of extended use for providing security against any algorithm-based attack to the keys. Ensured the key protection against eavesdroppers, a QKD-assisted protocol can focus its security analysis on party behaviour. Depending on the protocol rules and steps to follow, users can attempt attacks on it with the purpose of causing disagreement or misunderstanding between parties. In this work, we present a simulation environment for a hybrid, quantum-assisted digital signature (QDS) protocol. The configurations available for the simulated network as well as the digital signature protocol make it possible to design specific communication scenarios, such as attacks on the message integrity, forging and repudiation attempts or noisy communication across the quantum channels.
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.
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.