Efficient Arbitrated Quantum Digital Signature with Multi-Receiver Verification

TL;DR

This paper introduces an efficient arbitrated quantum digital signature scheme enabling multiple receivers to verify signatures simultaneously, reducing key consumption and computational complexity compared to existing methods.

Contribution

It presents a novel arbitrated quantum digital signature scheme that maintains transferability, simplifies implementation, and significantly reduces key usage and computation costs.

Findings

Uses at least two orders of magnitude less key than existing schemes

Supports simultaneous multi-receiver verification

Employs efficient hashing and encryption for low complexity

Abstract

Quantum digital signature is used to authenticate the identity of the signer with information theoretical security, while providing non-forgery and non-repudiation services. In traditional multi-receiver quantum digital signature schemes without an arbitrater, the transferability of one-to-one signature is always required to achieve unforgeability, with complicated implementation and heavy key consumption. In this article, we propose an arbitrated quantum digital signature scheme, in which the signature can be verified by multiple receivers simultaneously, and meanwhile, the transferability of the signature is still kept. Our scheme can be simplified performed to various quantum secure networks, due to the proposed efficient signature calculation procedure with low secure key consumption and low computation complexity, by employing one-time universal hashing algorithm and one-time pad encryption scheme. The evaluation results show that our scheme uses at least two orders of magnitude less key than existing signature schemes with transferability when signing files of the same length with the same number of receivers and security parameter settings.