Quantum messages with signatures forgeable in arbitrated quantum signature schemes
Taewan Kim, Jeong Woon Choi, Nam-Su Jho, Soojoon Lee

TL;DR
This paper investigates the security of arbitrated quantum signature schemes by examining the existence of forgeable quantum message-signature pairs, revealing that such pairs always exist in schemes with quantum encryption and rotation but are absent in certain schemes.
Contribution
The study demonstrates that forgeable quantum message-signature pairs always exist in schemes with quantum encryption and rotation, and provides numerical evidence of their absence in specific arbitrated quantum signature schemes.
Findings
Forgeable message-signature pairs always exist in schemes with quantum encryption and rotation.
Numerical analysis shows no forgeable pairs in certain arbitrated quantum signature schemes.
Understanding forgeability helps assess the security of quantum signature protocols.
Abstract
Even though a method to perfectly sign quantum messages has not been known, the arbitrated quantum signature scheme has been considered as one of good candidates. However, its forgery problem has been an obstacle to the scheme being a successful method. In this paper, we consider one situation, which is slightly different from the forgery problem, that we check whether at least one quantum message with signature can be forged in a given scheme, although all the messages cannot be forged. If there exist only a finite number of forgeable quantum messages in the scheme then the scheme can be secure against the forgery attack by not sending the forgeable quantum messages, and so our situation does not directly imply that we check whether the scheme is secure against the attack. But, if users run a given scheme without any consideration of forgeable quantum messages then a sender might…
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.
