This paper introduces Generalized Quantum-assisted Digital Signature (GQaDS), an improved version of a recently proposed scheme whose information theoretic security is inherited by adopting QKD keys for digital signature purposes. Its security against forging is computed considering a trial-and-error approach taken by the malicious forger and GQaDS parameters are optimized via an analytical approach balancing between forgery and repudiation probabilities. The hash functions of the previous implementation are replaced with Carter-Wegman Message Authentication Codes (MACs), strengthening the scheme security and reducing the signature length. For particular scenarios where the second verifier has a safe reputation, a simplified version of GQaDS, namely deterministic GQaDS, can further reduce the required signature length, keeping the desired security strength.
This paper introduces Generalized Quantum-assisted Digital Signature (GQaDS), an improved version of a recently proposed scheme whose information theoretic security is inherited by adopting QKD keys for digital signature purposes. Its security against forging is computed considering a trial-and-error approach taken by the malicious forger and GQaDS parameters are optimized via an analytical approach balancing between forgery and repudiation probabilities. The hash functions of the previous implementation are replaced with Carter-Wegman Message Authentication Codes (MACs), strengthening the scheme security and reducing the signature length. For particular scenarios where the second verifier has a safe reputation, a simplified version of GQaDS, namely deterministic GQaDS, can further reduce the required signature length, keeping the desired security strength.
Digital signature (DS) is an essential application of cryptography, used to certify the provenance of a message and its authenticity, guaranteeing the non-repudiation, unforgeability, and transferability of messages. However, the forthcoming advent of quantum computation poses a significant threat to classical signature schemes. A possible solution could be the introduction of novel DS schemes based on the fundamental laws of quantum physics. Recently, several quantum DS (QDS) protocols have been proposed, even relying on the exploitation of off-the-shelf quantum key distribution (QKD) solutions. However, their efficiency and large signature size, uncorrelated to the size of the message to sign, represent the main limitation in their employment in a practical scenario. A trade-off solution could be a quantum-assisted DS (QADS), where the QKD technology is exploited together with classical cryptographic functions to achieve a stronger DS scheme, more resistant even to quantum attacks. We propose a generalized quantum-assisted digital signature (G-QADS) protocol based on a hybrid system, composed by the standard Wegman-Carter Message Authentication Code (WG-MAC) together with symmetric QKD keys, to enhance the security of the DS, allowing messages with arbitrary lengths to be signed while maintaining a suitable DS length. In this work, the G-QADS process is proposed for a three-party configuration (one signer and two verifiers), where the third participant is involved in the procedure just in the case of contention between the other two parties. The G-QADS protocol is then experimentally tested to prove its resilience to forging and non-repudiation attacks, demonstrating its capability in securing the message signature (with a success probability of the attacks <10 −18 ). The performance is experimentally tested exploiting QKD prototypes based on standard BB84 protocol with decoy states and polarization encoding, in a software-defined network (SDN) infrastructure supervised by a single SDN controller, which provides the management of both classical and quantum communication channels. The proposed solution could push the practical exploitation of QKD into a new application domain, leading to a more pervasive integration of quantum technology in realistic scenarios.
Currently used digital signatures based on asymmetric cryptography will be vulnerable to quantum computers running Shor's algorithm. In this work, we propose a new quantum-assisted digital signature protocol based on symmetric keys generated by QKD, that allows signing and verifying messages in a simple way implementing an integration of currently available classical and quantum technologies. The protocol is described for a three-user scenario composed of one sender and two receivers. In contrast to previous schemes, it is independent of the message length. The security of the protocol has been analyzed, as well as its integrity, authenticity and non-repudiation properties.
One of the most important applications of cryptography is digital signature (DS), which aims to certify the provenance of a message as well as its authenticity, ensuring the nonrepudiation, unforgeability, and transferability of messages. However, the forthcoming advent of quantum computers poses a significant threat to classical signature schemes. In this work, an improved version of a novel quantum-assisted digital signature (QADS) solution will be presented, in which quantum keys generated by quantum key distribution (QKD) are used together with standard classical cryptographic functions to provide a hybrid system that integrates quantum and classical cryptography. The quantum keys enhance the security of the DS, allowing to sign messages with arbitrary lengths while maintaining a suitable DS length. The proposed solution could push the practical exploitation of QKD in a new application domain, leading to a more pervasive integration of quantum technology in realistic scenarios.
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) 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.
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.