Quantum Digital Signatures with Random Pairing
Ji-Qian Qin, Cong Jiang, Yun-Long Yu, Xiang-Bin Wang

TL;DR
This paper introduces a random pairing method for quantum digital signatures (QDS) that significantly enhances efficiency and security, demonstrated through numerical simulations on various protocols showing over 100% rate increase.
Contribution
The paper proposes a novel random pairing approach for QDS that improves efficiency and security levels across multiple quantum key distribution protocols.
Findings
Signature rate increased by over 100% with random pairing.
Random pairing enhances security and efficiency of QDS.
Applicable to various QKD protocols like SNS, SCF, MDIQKD, and BB84.
Abstract
Digital signatures can guarantee the unforgeability and transferability of the message. Different from classical digital signatures, whose security depends on computational complexity, quantum digital signatures (QDS) can provide information-theoretic security. We propose a general method of random pairing QDS (RP-QDS), which can drastically improve QDS efficiency. In a way, our random pairing method provide a tightened result of 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 fraction of untagged bits and error rates of the outcome bits. Random pairing can be applied as a fundamental method to improve the QDS efficiency for all existing quantum key distribution (QKD) protocols. We take sending-or-not-sending (SNS) QDS and side-channel-free (SCF) QDS as examples to demonstrate the advantage of random…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
