Efficient Arbitrated Quantum Digital Signature with Multi‐Receiver Verification

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 arbitrator, the transferability of one‐to‐one signature is always required to achieve unforgeability, with complicated implementation and heavy key consumption. In this article, an arbitrated quantum digital signature scheme is proposed, in which the signature can be verified by multiple receivers simultaneously, and meanwhile, the transferability of the signature is still kept. This 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 a one‐time pad encryption scheme. The evaluation results show that this 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.

Authors

Institutions

Publication Details

Journal
Advanced Quantum Technologies
Published
2024-09-02
DOI
https://doi.org/10.1002/qute.202400110
Citations
3
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
1.04

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Arbitrated Quantum Digital Signature with Multi‐Receiver Verification

Ming-Qiang Bai, Zhiwen Mo, Siyu Xiong, Wanrong Yu et al.
3 citations
Advanced Quantum Technologies
Quantum Computing Algorithms and Architecture
1.04
article

Efficient Arbitrated Quantum Digital Signature with Multi‐Receiver Verification

Ming-Qiang Bai, Zhiwen Mo, Siyu Xiong, Wanrong Yu, Bang-Ying Tang, Bo Liu, Hui Han, Jinquan Huang, Fangzhao Li
article en
3 citations

Abstract

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 arbitrator, the transferability of one‐to‐one signature is always required to achieve unforgeability, with complicated implementation and heavy key consumption. In this article, an arbitrated quantum digital signature scheme is proposed, in which the signature can be verified by multiple receivers simultaneously, and meanwhile, the transferability of the signature is still kept. This 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 a one‐time pad encryption scheme. The evaluation results show that this 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.

Advanced Quantum TechnologiesVol. 7(11)
Sun Yat-sen University (CN), National University of Defense Technology (CN), Academy of Military Medical Sciences (CN), Sichuan Normal University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Sichuan Province
Peace, Justice and strong institutions
Openalex Percentile: Top 19%
Quantum Computing Algorithms and Architecture
1.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.